The countable-union conjecture for well-quasi-orders
The countable-union conjecture for well-quasi-orders
Let be a well-quasi-ordered poset. A better quasi-order is a poset such that the quasi-order of countable sequences from under one-to-one domination is a well-quasi-order. A poset is a countable union of better quasi-orders if it is the union of countably many subsets, each carrying a better-quasi-order induced from .
Countable-union conjecture. Every well-quasi-ordered poset is a countable union of better quasi-orders.
This conjecture was proposed in work of Abraham, Bonnet, and Kubis. The supplied text gives no resolution status, so whether every well-quasi-order admits such a decomposition remains open.
Sources & referencesView supporting material
Primary source
Roland Assous and Maurice Pouzet, “Jónsson posets”, arXiv:1712.09442 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.