Indexed metadata

Log-concavity of longest increasing subsequence

Yupeng Li

Source record

Source: arXiv

Published: Oct 27, 2026

arXiv: 2610.36483

Open original source ↗

Source abstract

We prove a conjecture proposed by Chen that, for every fixed nn, the sequence (an,k)k=1n(a_{n,k})_{k=1}^n is log-concave, where an,ka_{n,k} counts permutations of [n][n] whose longest increasing subsequence has length kk.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.