Dense packing of patterns in a permutation

DOI10.1007/s00026-007-0329-7zbMath1141.05004OpenAlexW2137101235MaRDI QIDQ2427018

Svante Linusson, Johan Wästlund, Henrik Eriksson, Kimmo Eriksson

Publication date: 14 May 2008

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-007-0329-7

zbMATH Keywords

pattern containmentpermutation statistic

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (14)

Waiting time distribution for the emergence of superpatterns ⋮ Patterns in colored circular permutations ⋮ Universal layered permutations ⋮ Prolific permutations and permuted packings: downsets containing many large patterns ⋮ Supertrees ⋮ An asymptotically tight lower bound for superpatterns with small alphabets ⋮ Containing All Permutations ⋮ Universality of random permutations ⋮ Preferential arrangement superpatterns ⋮ Some results on superpatterns for preferential arrangements ⋮ Lower bounds for superpatterns and universal sequences ⋮ Asymptotic bounds for permutations containing many different patterns ⋮ Unnamed Item ⋮ Bounds on superpatterns containing all layered permutations

This page was built for publication: Dense packing of patterns in a permutation