论文信息 - An asymptotically tight lower bound for superpatterns with small alphabets

An asymptotically tight lower bound for superpatterns with small alphabets

A permutation σ ∈ Sn is a k-superpattern (or k-universal) if it contains each τ ∈ Sk as a pattern. This notion of “superpatterns” can be generalized to words on smaller alphabets, and several questions about superpatterns on small alphabets have recently been raised in the survey of Engen and Vatter. One of these questions concerned the length of the shortest k-superpattern on [k + 1]. A construction by Miller gave an upper bound of (k + k)/2, which we show is optimal up to lower-order terms. This implies a weaker version of a conjecture by Eriksson, Eriksson, Linusson and Wastlund. Our results also refute a 40-year-old conjecture of Gupta.

Zach Hunter | Zach Hunter

[1] Daniel J. Kleitman,et al. A Lower Bound on the Length of a Sequence Containing All Permutations as Subsequences , 1976, J. Comb. Theory, Ser. A.

[2] Noga Alon,et al. The runsort permuton , 2021, Adv. Appl. Math..

[3] Emmanuel Lecouturier,et al. On a conjecture of H. Gupta , 2012, Discret. Math..

[4] Vincent Vatter,et al. Containing All Permutations , 2018, Am. Math. Mon..

[5] Matthew Kwan,et al. Lower bounds for superpatterns and universal sequences , 2021, J. Comb. Theory, Ser. A.

[6] Svante Linusson,et al. Dense Packing of Patterns in a Permutation , 2007 .

[7] Universality of random permutations , 2019, Bulletin of the London Mathematical Society.

[8] E. Lecouturier,et al. On a conjecture of H . , 2012 .

[9] Hansraj Gupta. On permutation-generating strings and rosaries , 1981 .

[10] Richard Arratia,et al. On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern , 1999, Electron. J. Comb..

[11] Alison Miller,et al. Asymptotic bounds for permutations containing many different patterns , 2009, J. Comb. Theory, Ser. A.

[12] D. Bienstock. On the Chernoff bounds , 1985 .