Some open problems on permutation patterns

DOI10.1017/CBO9781139506748.007zbMath1300.05020arXiv1210.7320OpenAlexW2963151240MaRDI QIDQ2875859

Einar Steingrímsson

Publication date: 12 August 2014

Published in: Surveys in Combinatorics 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7320

zbMATH Keywords

Möbius functiongrowth rates of permutation classesposet of permutations

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05)

Related Items (14)

Extremal functions of forbidden multidimensional matrices ⋮ 1324-avoiding permutations revisited ⋮ Permutations avoiding 1324 and patterns in Łukasiewicz paths ⋮ Using functional equations to enumerate 1324-avoiding permutations ⋮ A structural characterisation of \(\mathrm{Av}(1324)\) and new bounds on its growth rate ⋮ On the Möbius function of permutations with one descent ⋮ Finite Automata, Probabilistic Method, and Occurrence Enumeration of a Pattern in Words and Permutations ⋮ Reduced word manipulation: patterns and enumeration ⋮ Equidistributions of mesh patterns of length two and Kitaev and Zhang's conjectures ⋮ Pattern-avoiding polytopes ⋮ Lower bounds for superpatterns and universal sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the topology of the permutation pattern poset

This page was built for publication: Some open problems on permutation patterns