Combinatorics of the symmetries of ascents in restricted inversion sequences
From MaRDI portal
Publication:2104908
Abstract: The systematic study of inversion sequences avoiding triples of relations was initiated by Martinez and Savage. For a triple , they introduced as the set of inversion sequences of length such that there are no indices with , and . To solve a conjecture of Martinez and Savage, Lin constructed a bijection between and that preserves the distinct entries and further posed a symmetry conjecture of ascents on these two classes of restricted inversion sequences. Concerning Lin's symmetry conjecture, an algebraic proof using the kernel method was recently provided by Andrews and Chern, but a bijective proof still remains mysterious. The goal of this article is to establish bijectively both Lin's symmetry conjecture and the -positivity of the ascent polynomial on . The latter result implies that the distribution of ascents on is symmetric and unimodal.
Recommendations
Cites work
- A new decomposition of ascent sequences and Euler-Stirling statistics
- A permutation code preserving a double Eulerian bistatistic
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- A sextuple equidistribution arising in pattern avoidance
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Enumeration of inversion sequences avoiding triples of relations
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Gamma-positivity in combinatorics and geometry
- Inversion sequences avoiding pairs of patterns
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Pattern avoidance in inversion sequences
- Pattern-avoiding inversion sequences and open partition diagrams
- Patterns in inversion sequences. I.
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Patterns of relation triples in inversion and ascent sequences
- Real-rootedness of variations of Eulerian polynomials
- Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers
- Restricted permutations and queue jumping
- The On-Line Encyclopedia of Integer Sequences
- The \(s\)-Eulerian polynomials have only real roots
- Vincular patterns in inversion sequences
- Wilf equivalences between vincular patterns in inversion sequences
Cited in
(7)- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- A bijection for length-5 patterns in permutations
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- \(s\)-inversion sequences and \(P\)-partitions of type \(B\)
- Inversion sequences avoiding quadruple length-3 patterns
This page was built for publication: Combinatorics of the symmetries of ascents in restricted inversion sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104908)