Pattern avoidance in permutations: Linear and cyclic orders

zbMath1035.05010MaRDI QIDQ1422119

Antoine Vella

Publication date: 5 February 2004

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/123425

zbMATH Keywords

permutationspermutation statisticsDyck pathspattern avoidancelinear and cyclic orderspath statistics

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (8)

Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions ⋮ Pattern avoidance of \([4,k\)-pairs in circular permutations] ⋮ Unnamed Item ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Some enumerations on non-decreasing Dyck paths ⋮ Cyclic pattern containment and avoidance ⋮ Unnamed Item ⋮ Combinatorial generation via permutation languages. I. Fundamentals

This page was built for publication: Pattern avoidance in permutations: Linear and cyclic orders