Descent sets of a permutation and its inverse: almost every pair occurs
For a permutation w of {1,…,n} let D(w) be its descent set. Stanley asked for the number f(n) of pairs (S,T) of subsets of {1,…,n−1} that arise as (D(w), D(w−1)), and for the growth rate L = lim f(n)1/n, which lies between 2 and 4. We prove that almost every pair arises, so L = 4. The proved results are formally verified in Lean 4 and the computations are independently rechecked. This record is identical to the folder descent-sets-inverse at tag descent-sets-inverse-v3 of https://github.com/jvvk/mathematics. Version 3 of the preprint; versions 1 and 2 were released on GitHub only.
Authors
- Vamshi Jandhyala (ORCID: https://orcid.org/0009-0006-6708-5805)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.5281/zenodo.24353518
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint