Consecutive patterns in inversion sequences

MaRDI QIDQ5207836zbMATH OpenFDO

Authors Juan S. Auli, Sergi Elizalde

Publication date 13 January 2020

Full work available at URL https://arxiv.org/abs/1904.02694, https://dmtcs.episciences.org/5856/pdf

zbMATH Keywords

consecutive patterninversion sequencepattern avoidanceWilf equivalence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: An inversion sequence of length $n$ is an integer sequence $e=e_1{e}_{2}dots{e}_n$ such that $0leq{e}_i<i$ for each $i$. Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck began the study of patterns in inversion sequences, focusing on the enumeration of those that avoid classical patterns of length 3. We initiate an analogous systematic study of consecutive patterns in inversion sequences, namely patterns whose entries are required to occur in adjacent positions. We enumerate inversion sequences that avoid consecutive patterns of length 3, and generalize some results to patterns of arbitrary length. Additionally, we study the notion of Wilf equivalence of consecutive patterns in inversion sequences, as well as generalizations of this notion analogous to those studied for permutation patterns. We classify patterns of length up to 4 according to the corresponding Wilf equivalence relations.

Recommendations

• Inversion sequences avoiding consecutive patterns
• Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
• Wilf equivalences between vincular patterns in inversion sequences
• Length-four pattern avoidance in inversion sequences
• Inversion sequences avoiding a triple of patterns of 3 letters

Cited in

(23)

• Antichain sequences
• Weak ascent sequences and related combinatorial structures
• Length-four pattern avoidance in inversion sequences
• Inversion sequences avoiding consecutive patterns
• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Inversion polynomials for permutations avoiding consecutive patterns
• Wilf equivalences between vincular patterns in inversion sequences
• Patterns in inversion sequences. I.
• Pattern avoidance in inversion sequences
• Inversion sequences avoiding pairs of patterns
• Bijections for restricted inversion sequences and permutations with fixed points
• Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
• On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
• Descent distribution on Catalan words avoiding ordered pairs of relations
• Parameters in inversion sequences
• Inversion sequences avoiding a triple of patterns of 3 letters
• Consecutive patterns in Catalan words and the descent distribution
• Inversion sequences avoiding a pair of patterns of type (2,1)
• Inversion sequences avoiding quadruple length-3 patterns
• Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
• Bijections for generalized Wilf equivalences
• The enumeration of inversion sequences avoiding the patterns 201 and 210
• An explicit bijection between the inversion sequences avoiding 0312 and 0321

This page was built for publication: Consecutive patterns in inversion sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207836)