Combinatorics of the symmetries of ascents in restricted inversion sequences
From MaRDI portal
Publication:2104908
DOI10.1016/J.AAM.2022.102449zbMATH Open1504.05007OpenAlexW4200635797MaRDI QIDQ2104908FDOQ2104908
Authors: Joanna N. Chen, Zhicong Lin
Publication date: 8 December 2022
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2112.04115
Recommendations
Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)
Cites Work
- The \(s\)-Eulerian polynomials have only real roots
- Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers
- Patterns in inversion sequences. I.
- The On-Line Encyclopedia of Integer Sequences
- A sextuple equidistribution arising in pattern avoidance
- A permutation code preserving a double Eulerian bistatistic
- Wilf equivalences between vincular patterns in inversion sequences
- Gamma-positivity in combinatorics and geometry
- Pattern avoidance in inversion sequences
- Real-rootedness of variations of Eulerian polynomials
- Enumeration of inversion sequences avoiding triples of relations
- Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
- Restricted permutations and queue jumping
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Pattern-avoiding inversion sequences and open partition diagrams
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- Inversion sequences avoiding pairs of patterns
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Further enumeration results concerning a recent equivalence of restricted 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
Uses Software
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)