Combinatorics of the symmetries of ascents in restricted inversion sequences

Abstract

The systematic study of inversion sequences avoiding triples of relations was initiated by Martinez and Savage. For a triple (1,2,3)∈\<,>,≤,≥,=,≠,-\3, they introduced n(1,2,3) as the set of inversion sequences e=e1e2·s en of length n such that there are no indices 1≤ i<j<k≤ n with ei 1 ej, ej 2 ek and ei 3 ek. To solve a conjecture of Martinez and Savage, Lin constructed a bijection between n(≥,≠,>) and n(>,≠,≥) 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 n(>,≠,>). The latter result implies that the distribution of ascents on n(>,≠,>) is symmetric and unimodal.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…