Preferential arrangement superpatterns

DOI10.1016/J.ENDM.2016.09.003zbMath1356.05003OpenAlexW2536249361MaRDI QIDQ510524

Yonah Biers-Ariel, Yiguang Zhang, Anant P. Godbole

Publication date: 13 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.003

zbMATH Keywords

permutationsuperpatternpreferential arrangements

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Waiting time distribution for the emergence of superpatterns
• Omnibus sequences, coupon collection, and missing word counts
• A lower bound on the length of a sequence containing all permutations as subsequences
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Packing patterns into words
• A construction of short sequences containing all permutations of a set as subsequences
• Dense packing of patterns in a permutation

This page was built for publication: Preferential arrangement superpatterns