PreprintarXiv licencearXiv
Log-concavity of longest increasing subsequence
Abstract
We prove a conjecture proposed by Chen that, for every fixed n, the sequence (an,k)k=1n is log-concave, where an,k counts permutations of [n] whose longest increasing subsequence has length k.
Related
- On Chen's conjecture for the log-concavity of the longest increasing subsequence distribution
- Longest increasing subsequences of dyadic-type chaotic orbits
- The longest increasing subsequences of Luce permutations and permutons
- The $2$-co-lacunary subsequence principle for arbitrary noncommutative L1-spaces
- Fourier rearrangements on discrete groups: Lp and operator-norm subsequence convergence
BibTeX
@misc{li2026logconcavity,
title = {{Log-concavity of longest increasing subsequence}},
author = {Yupeng Li},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36483},
eprint = {2610.36483},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36483},
}
RIS
TY - UNPB
TI - Log-concavity of longest increasing subsequence
AU - Yupeng Li
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.36483
UR - https://arxiv.org/abs/2610.36483
AB - We prove a conjecture proposed by Chen that, for every fixed n, the sequence (a_n,k)_k=1^n is log-concave, where a_n,k counts permutations of [n] whose longest increasing subsequence has length k.
ER -