Recurrences for permutations with long increasing subsequences
Manuel Kauers, Chen Wang
Abstract
We prove two simple bivariate recurrences for the number of permutations with a long increasing subsequence. The two recurrences imply D-finiteness of the sequence in a certain range. As a consequence, we also obtain a proof of a conjecture posed by Kauers and Koutschan in 2023.
Create a lesson
Related papers
Canonical-row Chern flow on Bott--Samelson towers: realizable-volume models for Schubert, Grothendieck, and Lascoux polynomials
Khai-Hoan Nguyen-Dang, Zhenpeng Wang
Degeneracy bounds, stability, and a sharp gap for B-colorings
Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang
Duals of algebraic matroids need not be algebraic
Matt Larson, Tuong Le
Most (0,1)-polytopes are not normal
Santiago Morales
Bounded Twin-Width Tournaments are -Bounded
Chaoliang Tang, Junchi Zhang
An Affine Semigroup from Orbifold Boundary Conditions: cut, phylogenetic and hierarchical models in the unit-weight sector, and weighted configurations beyond them
Carles Marín