Patterns in Inversion Sequences I

  title={Patterns in Inversion Sequences I},
  author={Sylvie Corteel and Megan A. Martinez and Carla D. Savage and Michael Weselcouch},
  journal={Discrete Mathematics & Theoretical Computer Science},
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 (e1, e2, . . . , en) is an inversion sequence if 0 ≤ ei < i for all i ∈ [n]. Inversion sequences of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 28 references

Savage and Mirkó Visontai . The sEulerian polynomials have only real roots

D. Carla
Trans . Amer . Math . Soc . • 2015

The depth of a permutation

T. Kyle Petersen, Bridget Eileen Tenner
J. Comb., • 2015
View 2 Excerpts

The s-Eulerian polynomials have only real roots

Carla D. Savage, Mirkó Visontai
Trans. Amer. Math. Soc., • 2015
View 1 Excerpt

Permlab: Software for permutation patterns

Michael Albert, • 2012
View 1 Excerpt

Schuster . Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences

Carla D. Savage, J. Michael
J . Combin . Theory Ser . A • 2012

Counting simsun permutations by descents

Chak-On Chow andWai Chee Shiu
Ann. Comb., • 2011
View 1 Excerpt

Similar Papers

Loading similar papers…