×

Atomicity and well quasi-order for consecutive orderings on words and permutations. (English) Zbl 1460.05005

Summary: Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are (a) being atomic, i.e., not being decomposable as a union of two downward closed proper subsets or, equivalently, satisfying the joint embedding property; and (b) being well quasi-ordered. The two posets are (1) words over a finite alphabet under the consecutive subword ordering, and (2) finite permutations under the consecutive subpermutation ordering. Underpinning the four results are characterizations of atomicity and well quasi-order for the subpath ordering on paths of a finite directed graph.

MSC:

05A05 Permutations, words, matrices
05C20 Directed graphs (digraphs), tournaments
06A07 Combinatorics of partially ordered sets
68R05 Combinatorics in computer science
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] A. Atminas, V. Lozin, and M. Moshkov, WQO is decidable for factorial languages, Inform. and Comput., 256 (2017), pp. 321-333. · Zbl 1376.68083
[2] S. Avgustinovich and S. Kitaev, On uniquely \(k\)-determined permutations, Discrete Math., 308 (2008), pp. 1500-1507. · Zbl 1134.05002
[3] S. Braunfeld, Infinite Limits of Finite-Dimensional Permutation Structures, and Their Automorphism Groups: Between Model Theory and Combinatorics, Ph.D. dissertation, Rutgers University, 2018, https://arxiv.org/abs/1805.04219. · Zbl 1412.03014
[4] S. Braunfeld, The undecidability of joint embedding and joint homomorphism for hereditary graph classes, Discrete Math. Theor. Comput. Sci., 21 (2019), 9, https://dmtcs.episciences.org/5923.
[5] G. Cherlin, Forbidden substructures and combinatorial dichotomies: WQO and universality, Discrete Math., 311 (2011), pp. 1543-1584. · Zbl 1223.05131
[6] T. Dwyer and S. Elizalde, Wilf equivalence relations for consecutive patterns, Adv. in Appl. Math., 99 (2018), pp. 134-157. · Zbl 1388.05007
[7] S. Elizalde, A survey of consecutive patterns in permutations, in Recent Trends in Combinatorics, IMA Vol. Math. Appl. 159, Springer, 2016, pp. 601-618. · Zbl 1354.05004
[8] G. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc., 2 (1952), pp. 326-336. · Zbl 0047.03402
[9] S. Huczynska and N. Ruškuc, Well quasi-order in combinatorics: Embeddings and homomorphisms, in Surveys in Combinatorics 2015, London Math. Soc. Lecture Note Ser. 424, Cambridge University Press, 2015, pp. 261-293. · Zbl 1352.05008
[10] V. Jelínek, Ramsey-type and amalgamation-type properties of permutations, in Surveys in Combinatorics 2017, London Math. Soc. Lecture Note Ser. 440, Cambridge University Press, 2017, pp. 272-311. · Zbl 1423.05188
[11] M. McDevitt, Orderings on Words and Permutations, Ph.D. thesis, University of St Andrews, 2019.
[12] N. Robertson and P. Seymour, Graph minors XX: Wagner’s conjecture, J. Combin. Theory Ser. B, 92 (2004), pp. 325-357. · Zbl 1061.05088
[13] J.H. van Lint and R.M. Wilson, A Course in Combinatorics, Cambridge University Press, 1992. · Zbl 0769.05001
[14] V. Vatter, Permutation classes, in Handbook of Enumerative Combinatorics, Discrete Math. Appl. (Boca Raton), CRC Press, 2015, pp. 753-833, https://arxiv.org/abs/1409.5159. · Zbl 1353.05010
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.