English
Related papers

Related papers: Linear extensions of partial orders and Reverse Ma…

200 papers

We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…

Logic · Mathematics 2018-08-06 Florian Pelupessy

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

Logic · Mathematics 2011-10-19 Peter A. Cholak , Damir D. Dzhafarov , Noah Schweber , Richard A. Shore

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi

We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…

Combinatorics · Mathematics 2012-03-28 Filippo Disanto , Luca Ferrari , Simone Rinaldi

We consider a category of all finite partial orderings with quotient maps as arrows and construct a Fra\"iss\'e sequence in this category. Then we use commonly known relations between partial orders and lattices to construct a sequence of…

Combinatorics · Mathematics 2022-01-26 Szymon Głcab , Michał Pawlikowski

We analyze the axiomatic strength of the following theorem due to Rival and Sands in the style of reverse mathematics. "Every infinite partial order $P$ of finite width contains an infinite chain $C$ such that every element of $P$ is either…

Logic · Mathematics 2024-08-06 Marta Fiori-Carones , Alberto Marcone , Paul Shafer , Giovanni Soldà

We give a classification of non-orthogonality classes of trivial order 1 strongly minimal sets in differentially closed fields. A central idea is the introduction of $\tau$-forms, functions on the prolongation of a variety which are…

Logic · Mathematics 2007-05-23 Eric Rosen

In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.

Combinatorics · Mathematics 2016-08-19 Andrii Arman , Vojtěch Rödl

We prove that several versions of the Tietze extension theorem for functions with moduli of uniform continuity are equivalent to WKL_0 over RCA_0. This confirms a conjecture of Giusto and Simpson that was also phrased as a question in…

Logic · Mathematics 2016-02-18 Paul Shafer

Higman's lemma states that for any well partial order $X$, the partial order $X^*$ of finite sequences with members from $X$ is also well. By combining results due to Girard as well as Sch\"{u}tte and Simpson, one can show that Higman's…

Logic · Mathematics 2025-07-30 Patrick Uftring

Let \Omega be a set of unsatisfiable clauses, an implicit resolution refutation of \Omega is a circuit \beta with a resolution proof {\alpha} of the statement "\beta describes a correct tree-like resolution refutation of \Omega". We show…

Logic in Computer Science · Computer Science 2015-07-01 Zi Chao Wang

Restricting the chain-antichain principle CAC to partially ordered sets which respect the natural ordering of the integers is a trivial distinction in the sense of classical reverse mathematics. We utilize computability-theoretic reductions…

Logic · Mathematics 2025-01-17 Noah A. Hughes

We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…

Combinatorics · Mathematics 2012-11-20 Mike Develin , Matthew Macauley , Victor Reiner

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

Combinatorics · Mathematics 2012-01-31 Graham Brightwell , Malwina Luczak

We give a necessary and sufficient condition for that the support $\tau$-tilting poset of a finite dimensional algebra is isomorphic to the poset of symmetric group with weak order. Moreover we show that there are infinitely many finite…

Representation Theory · Mathematics 2016-05-18 Ryoichi Kase

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…

Logic · Mathematics 2022-06-16 Fedor Pakhomov , James Walsh

We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…

Representation Theory · Mathematics 2021-06-04 Aslak Bakke Buan , Bethany Marsh

We show that every unstable NIP theory admits a V-definable linear quasi-order, over a finite set of parameters. In particular, if the theory is omega-categorical, then it interprets an infinite linear order. This partially answers a…

Logic · Mathematics 2021-07-02 Pierre Simon

Bayer-Stillman showed that $reg(I) = reg(gin_\tau(I))$ when $\tau$ is the graded reverse lexicographic order. We show that the reverse lexicographic order is the unique monomial order $\tau$ satisfying $reg(I) = reg(gin_\tau(I))$ for all…

Commutative Algebra · Mathematics 2014-11-21 HyunBin Loh

We prove that finite partial orders with a linear extension form a Ramsey class. Our proof is based on the fact that class of acyclic graphs has the Ramsey property and uses the partite construction.

Combinatorics · Mathematics 2017-03-03 Jaroslav Nešetřil , Vojtěch Rödl