scholarly journals A well-quasi-order for tournaments

2011 ◽  
Vol 101 (1) ◽  
pp. 47-53 ◽  
Author(s):  
Maria Chudnovsky ◽  
Paul Seymour
Keyword(s):  
Well Quasi Order ◽  
Quasi Order

scholarly journals Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique

10.37236/4074 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Aistis Atminas ◽  
Robert Brignall ◽  
Nicholas Korpelainen ◽  
Vadim Lozin ◽  
Vincent Vatter
Keyword(s):  
Permutation Graphs ◽  
Structural Decomposition ◽  
Well Quasi Order ◽  
Quasi Order

We consider well-quasi-order for classes of permutation graphs which omit both a path and a clique. Our principle result is that the class of permutation graphs omitting $P_5$ and a clique of any size is well-quasi-ordered. This is proved by giving a structural decomposition of the corresponding permutations. We also exhibit three infinite antichains to show that the classes of permutation graphs omitting $\{P_6,K_6\}$, $\{P_7,K_5\}$, and $\{P_8,K_4\}$ are not well-quasi-ordered.

scholarly journals Constructing sequences one step at a time

2020 ◽  
Vol 20 (03) ◽  
pp. 2050017
Author(s):  
Henry Towsner
Keyword(s):  
Reverse Mathematics ◽  
New Method ◽  
Well Quasi Order ◽  
Thin Set ◽  
One Step ◽  
Quasi Order ◽  
Weak König’S Lemma ◽  
König’S Lemma

We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain–Antichain ([Formula: see text]) Principle. Using this method, we are able to prove several new separations in the presence of Weak König’s Lemma ([Formula: see text]), including showing that [Formula: see text] does not imply the thin set theorem for pairs, and that the principle “the product of well-quasi-orders is a well-quasi-order” is strictly between [Formula: see text] and the Ascending/Descending Sequences principle, even in the presence of [Formula: see text].

scholarly journals Critical Properties and Complexity Measures of Read-Once Boolean Functions

2021 ◽  
Author(s):  
Vadim Lozin ◽  
Mikhail Moshkov
Keyword(s):  
Boolean Functions ◽  
Critical Properties ◽  
Complexity Measures ◽  
Well Quasi Order ◽  
Finite Set ◽  
Quasi Order ◽  
Parameter Measuring ◽  
Two Parameters

AbstractIn this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order. This implies that every parameter measuring complexity of the functions can be characterized by a finite set of minimal subclasses of read-once functions, where this parameter is unbounded. We focus on two parameters related to certificate complexity and characterize each of them in the terminology of minimal classes.

scholarly journals THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER

2019 ◽  
Vol 85 (1) ◽  
pp. 300-324
Author(s):  
JACQUES DUPARC ◽  
LOUIS VUILLEUMIER
Keyword(s):  
Specific Class ◽  
Well Quasi Order ◽  
Quasi Order ◽  
Image Position ◽  
Scott Domain ◽  
Colored Posets

AbstractWe prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets $\mathbb{P}_{emb} $ equipped with the order induced by homomorphisms is embedded into the Wadge order on the $\Delta _2^0 $-degrees of the Scott domain. We then show that $\mathbb{P}_{emb} $ admits both infinite strictly decreasing chains and infinite antichains with respect to this notion of comparison, which therefore transfers to the Wadge order on the $\Delta _2^0 $-degrees of the Scott domain.

scholarly journals Well-Quasi-Order of Relabel Functions

Order ◽  
2010 ◽  
Vol 27 (3) ◽  
pp. 301-315 ◽  
Author(s):  
Jean Daligault ◽  
Michael Rao ◽  
Stéphan Thomassé
Keyword(s):  
Well Quasi Order ◽  
Quasi Order
Sign in / Sign up

Export Citation Format

Share Document