Abstract
AbstractWe consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which governs consecutive embeddings. For each poset we ask the well quasi-order and atomicity decidability questions: Given finitely many equivalence relations $$\rho _1,\dots ,\rho _k$$
ρ
1
,
⋯
,
ρ
k
, is the downward closed set $${{\,\textrm{Av}\,}}(\rho _1,\dots ,\rho _k)$$
Av
(
ρ
1
,
⋯
,
ρ
k
)
consisting of all equivalence relations which do not contain any of $$\rho _1,\dots ,\rho _k$$
ρ
1
,
⋯
,
ρ
k
: (a) well-quasi-ordered, meaning that it contains no infinite antichains? and (b) atomic, meaning that it is not a union of two proper downward closed subsets, or, equivalently, that it satisfies the joint embedding property?
Publisher
Springer Science and Business Media LLC
Reference15 articles.
1. Atminas, A., Lozin, V., Moshkov, M.: WQO is decidable for factorial languages. Inform. Comput. 256, 321–333 (2017)
2. Braunfeld, S.: The undecidability of joint embedding and joint homomorphism for hereditary graph classes. Discrete Math. Theor. Comput. Sci. 21(9), 17 (2019)
3. Braunfeld, S.: The undecidability of joint embedding for 3-dimensional permutation classes. Discrete Math. Theor. Comput. Sci. 22(10), 20 (2021)
4. Cherlin, G.: Forbidden substructures and combinatorial dichotomies: WQO and universality. Discrete Math. 311, 1543–1584 (2011)
5. Ding, G.: Subgraphs and well quasi-ordering. J. Graph Theory 16, 489–502 (1992)