Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings

DOI10.1016/j.ejc.2019.07.003zbMath1420.05015arXiv1707.07809OpenAlexW2964091007WikidataQ127460155 ScholiaQ127460155MaRDI QIDQ2323247

Dömötör Pálvölgyi, Benjamin Gunby

Publication date: 30 August 2019

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

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

zbMATH Keywords

generating functionforbidden permutations

Mathematics Subject Classification ID

Partitions of sets (05A18) Permutations, words, matrices (05A05) Data structures (68P05)

Related Items (2)

Singleton mesh patterns in multidimensional permutations ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Random \(k\)-dimensional orders: Width and number of linear extensions
• Permuting machines and priority queues
• Hereditary properties of partitions, ordered graphs and ordered hypergraphs
• Random orders
• Davenport-Schinzel theory of matrices
• Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
• The speed of hereditary properties of graphs
• Counting pattern-free set partitions. I: A generalization of Stirling numbers of the second kind
• A jump to the Bell number for hereditary graph properties
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Pattern avoidance for set partitions \`a la Klazar
• How often are two permutations comparable?
• Asymptotic results on Klazar set partition avoidance
• The on-line encyclopedia of integer sequences
• Combinatorics of Set Partitions
• Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems

This page was built for publication: Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings