Preferential arrangement superpatterns

DOI10.1016/J.ENDM.2016.09.003MaRDI QIDQ510524zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Some results on superpatterns for preferential arrangements
• Simple permutations, alternating permutations, and the superpatterns that contain them.
• Lower bounds for superpatterns and universal sequences
• Asymptotic bounds for permutations containing many different patterns
• Note on superpatterns

Cites work

• scientific article; zbMATH DE number 4217776 (Why is no real title available?)
• A construction of short sequences containing all permutations of a set as subsequences
• A lower bound on the length of a sequence containing all permutations as subsequences
• Dense packing of patterns in a permutation
• Omnibus sequences, coupon collection, and missing word counts
• On the Stanley-Wilf conjecture for the number of permutations avoiding a given pattern
• Packing patterns into words
• Waiting time distribution for the emergence of superpatterns

Cited in

(4)

• Some results on superpatterns for preferential arrangements
• An asymptotically tight lower bound for superpatterns with small alphabets
• Bounds on superpatterns containing all layered permutations
• Skip letters for short supersequence of all permutations

This page was built for publication: Preferential arrangement superpatterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510524)