Consecutive patterns in inversion sequences. II: Avoiding patterns of relations

MaRDI QIDQ5241192zbMATH OpenFDO

Authors Juan S. Auli, Sergi Elizalde

Publication date 30 October 2019

Full work available at URL https://arxiv.org/abs/1906.07365, https://cs.uwaterloo.ca/journals/JIS/VOL22/Elizalde/eli14.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

consecutive patterninversion sequencepattern avoidancepattern of relationsWilf equivalence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: Inversion sequences are integer sequences $e=e_1{e}_{2}dots{e}_n$ such that $0leq{e}_i<i$ for each $i$. The study of patterns in inversion sequences was initiated by Corteel--Martinez--Savage--Weselcouch and Mansour--Shattuck in the classical (non-consecutive) case, and later by Auli--Elizalde in the consecutive case, where the entries of a pattern are required to occur in adjacent positions. In this paper we continue this investigation by considering {em consecutive patterns of relations}, in analogy to the work of Martinez--Savage in the classical case. Specifically, given two binary relations $R_1,R_{2}inleq,geq,<,>,=,eq$, we study inversion sequences $e$ with no subindex $i$ such that $e_i{R}_1{e}_{i+1}{R}_2{e}_{i+2}$. By enumerating such inversion sequences according to their length, we obtain well-known quantities such as Catalan numbers, Fibonacci numbers and central polynomial numbers, relating inversion sequences to other combinatorial structures. We also classify consecutive patterns of relations into Wilf equivalence classes, according to the number of inversion sequences avoiding them, and into more restrictive classes that consider the positions of the occurrences of the patterns. As a byproduct of our techniques, we obtain a simple bijective proof of a result of Baxter--Shattuck and Kasraoui about Wilf-equivalence of vincular patterns, and we prove a conjecture of Martinez and Savage, as well as related enumeration formulas for inversion sequences satisfying certain unimodality conditions.

Recommendations

• Inversion sequences avoiding consecutive patterns
• Consecutive patterns in inversion sequences
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Inversion sequences avoiding pairs of patterns
• Wilf equivalences between vincular patterns in inversion sequences

Cites work

• A sextuple equidistribution arising in pattern avoidance
• A survey of consecutive patterns in permutations
• Catalan Numbers
• Computational approaches to consecutive pattern avoidance in permutations
• Consecutive patterns in inversion sequences
• Consecutive patterns in permutations
• Egge triples and unbalanced Wilf equivalence
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• Enumeration of inversion sequences avoiding triples of relations
• Enumeration schemes for vincular patterns
• Generalized permutation patterns and a classification of the Mahonian statistics
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• New Wilf-equivalence results for vincular patterns
• Pattern avoidance in inversion sequences
• Patterns in inversion sequences. I.
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Restricted inversion sequences and enhanced 3-noncrossing partitions
• Restricted permutations
• Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
• Some Wilf-equivalences for vincular patterns
• Wilf equivalence relations for consecutive patterns

Cited in

(23)

• Enumeration of inversion sequences avoiding triples of relations
• Combinatorics of the symmetries of ascents in restricted inversion sequences
• Weak ascent sequences and related combinatorial structures
• Length-four pattern avoidance in inversion sequences
• Inversion sequences avoiding consecutive patterns
• A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
• On \(\underline{12} 0\)-avoiding inversion and ascent sequences
• Ascent sequences avoiding pairs of patterns
• Vincular patterns in inversion sequences
• Inversion polynomials for permutations avoiding consecutive patterns
• Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
• Wilf equivalences between vincular patterns in inversion sequences
• Inversion sequences avoiding pairs of patterns
• Patterns in inversion sequences. II: Inversion sequences avoiding triples of relations
• Bijections for restricted inversion sequences and permutations with fixed points
• Consecutive patterns in inversion sequences
• Enumeration of smooth inversion sequences and proof of a recent related conjecture
• On 0012-avoiding inversion sequences and a conjecture of Lin and Ma
• Parameters in inversion sequences
• A bijection for length-5 patterns in permutations
• 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

Describes a project that uses

Uses Software

• CAV
• OEIS

This page was built for publication: Consecutive patterns in inversion sequences. II: Avoiding patterns of relations

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