PreprintCC BY 4.0arXiv
Recurrences for permutations with long increasing subsequences
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.
Related
- The longest increasing subsequences of Luce permutations and permutons
- Caged subsequences in permutations
- Longest increasing subsequences of dyadic-type chaotic orbits
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231
- Quotients of L1 by subsequences of the Haar system have cotype 2
BibTeX
@misc{kauers2026recurrences,
title = {{Recurrences for permutations with long increasing subsequences}},
author = {Manuel Kauers and Chen Wang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.02220},
eprint = {2609.02220},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.02220},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Recurrences for permutations with long increasing subsequences
AU - Manuel Kauers
AU - Chen Wang
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2609.02220
UR - https://arxiv.org/abs/2609.02220
AB - 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.
ER -