Partitions with constrained ranks and lattice paths
From MaRDI portal
Publication:6659957
DOI10.54550/ECA2023V3S3R18MaRDI QIDQ6659957
Sylvie Corteel, Carla D. Savage, Sergi Elizalde
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17)
Cites Work
- Title not available (Why is that?)
- Two descent statistics over \(321\)-avoiding centrosymmetric involutions
- Descent sets on 321-avoiding involutions and hook decompositions of partitions
- Mahonian pairs
- q-Catalan numbers
- Extension of the partition sieve
- On lattice path counting by major index and descents
- Strong versions of Sperner's theorem
- A bijection for partitions with all ranks at least \(t\)
- A lattice path approach to counting partitions with minimum rank \(t\)
- Restricted partition pairs
- Measuring symmetry in lattice paths and partitions
- Families of major index distributions: closed forms and unimodality
- The theory of arithmetic functions. Proceedings of the conference at Western Michigan University, April 29 -- May 1, 1971
- Counting lattice paths by crossings and major index I: the corner-flipping bijections
- On the Netto Inversion Number of a Sequence
This page was built for publication: Partitions with constrained ranks and lattice paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659957)
