Patterns in inversion sequences. I.
From MaRDI portal
Abstract: Permutations that avoid given patterns have been studied in great depth for their connections to other fields of mathematics, computer science, and biology. From a combinatorial perspective, permutation patterns have served as a unifying interpretation that relates a vast array of combinatorial structures. In this paper, we introduce the notion of patterns in inversion sequences. A sequence is an inversion sequence if for all . Inversion sequences of length are in bijection with permutations of length ; an inversion sequence can be obtained from any permutation by setting . This correspondence makes it a natural extension to study patterns in inversion sequences much in the same way that patterns have been studied in permutations. This paper, the first of two on patterns in inversion sequences, focuses on the enumeration of inversion sequences that avoid words of length three. Our results connect patterns in inversion sequences to a number of well-known numerical sequences including Fibonacci numbers, Bell numbers, Schr"oder numbers, and Euler up/down numbers.
Recommendations
Cited in
(63)- A sextuple equidistribution arising in pattern avoidance
- Enumeration of inversion sequences avoiding triples of relations
- Refined Wilf-equivalences by Comtet statistics
- Combinatorics of the symmetries of ascents in restricted inversion sequences
- Weak ascent sequences and related combinatorial structures
- Length-four pattern avoidance in inversion sequences
- A combinatorial bijection on di-sk trees
- On pattern avoidance in matchings and involutions
- Inversion sequences avoiding consecutive patterns
- 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
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Patterns of relation triples in inversion and ascent sequences
- Vincular patterns in inversion sequences
- Passing through a stack \(k\) times with reversals
- Inversion polynomials for permutations avoiding consecutive patterns
- Patterns in treeshelves
- Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
- The \(\gamma \)-positive coefficients arising in segmented permutations
- Wilf equivalences between vincular patterns in inversion sequences
- Counting inversion sequences by parity successions and runs
- Pattern avoidance in inversion sequences
- On -positive polynomials arising in pattern avoidance
- 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
- Catalan words avoiding pairs of length three patterns
- Equivalence of the descents statistic on some (4,4)-avoidance classes of permutations
- Statistics on bargraphs of inversion sequences of permutations
- Consecutive patterns in inversion sequences. II: Avoiding patterns of relations
- Further enumeration results concerning a recent equivalence of restricted inversion sequences
- Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li
- Enumeration of smooth inversion sequences and proof of a recent related conjecture
- Three classes of inversion sequences counted by large Schröder numbers
- Restricted inversion sequences and Schröder paths
- Five classes of pattern avoiding inversion sequences under one roof: generating trees
- 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
- Three new refined Arnold families
- Inversion sequences avoiding a triple of patterns of 3 letters
- An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences
- Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions
- Some \(\gamma \)-positive polynomials arising from enumerations of the pseudo Schröder paths
- Inversion sequences avoiding quadruple length-3 patterns
- Inversion sequences avoiding 021 and another pattern of length four
- Pattern avoidance in weak ascent sequences
- Bijections on pattern avoiding inversion sequences and related objects
- Completing the enumeration of inversion sequences avoiding one or two patterns of length 3
- Patterns in rectangulations. I: -like patterns, inversion sequence classes I(010, 101, 120, 201) and I(011, 201), and rushed Dyck paths
- Generating trees growing on the left for pattern-avoiding inversion sequences
- Bijections for generalized Wilf equivalences
- Inversion sequences avoiding a set of length-3 patterns
- Sorting inversion sequences
- Lattice points on polyominoes of inversion sequences
- Inversion sequences avoiding {120,210} and another pattern of length three
- Inversion sequences and signed permutations
- The enumeration of inversion sequences avoiding the patterns 201 and 210
- An explicit bijection between the inversion sequences avoiding 0312 and 0321
- On 102-avoiding inversion sequences
- Signed inversion sequences avoiding a set of length-2 signed patterns
- Enumeration of inversion sequences avoiding 010 and some patterns of length four
This page was built for publication: Patterns in inversion sequences. I.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2831885)
