Consecutive Patterns in Inversion Sequences
An inversion sequence of length $n$ is an integer sequence $e=e_{1}e_{2}\dots e_{n}$ such that $0\leq 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 pa...
Main Authors: | Juan S. Auli, Sergi Elizalde |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2019-11-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/5350/pdf |
Similar Items
-
Patterns in Inversion Sequences I
by: Sylvie Corteel, et al.
Published: (2016-03-01) -
Pattern Avoidance in Weak Ascent Sequences
by: Beáta Bényi, et al.
Published: (2024-08-01) -
Continued fractions for permutation statistics
by: Sergi Elizalde
Published: (2018-06-01) -
Equivalence classes of mesh patterns with a dominating pattern
by: Murray Tannock, et al.
Published: (2018-02-01) -
Enumeration of Dumont permutations avoiding certain four-letter patterns
by: Alexander Burstein, et al.
Published: (2021-07-01)