English
Related papers

Related papers: Dilworth's Theorem for Borel Posets

200 papers

Motivated by the study of the dimension of random posets, it was conjectured by Bollob\'as and Brightwell in 1997 that if $P$ is a finite poset whose cover graph contains at most one cycle then its order dimension is at most $3$. In this…

Combinatorics · Mathematics 2025-05-23 Antoine Abram , Adrien Segovia

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs G and H are 2-isomorphic, or equivalently, their cycle matroids are isomorphic, if and only if G can be transformed into H by a series of operations called Whitney…

Data Structures and Algorithms · Computer Science 2020-06-25 Fedor V. Fomin , Petr A. Golovach

We introduce two polynomials (in $q$) associated with a finite poset $P$ that encode some information on the covering relation in $P$. If $P$ is a distributive lattice, and hence $P$ is isomorphic to the poset of dual order ideals in a…

Combinatorics · Mathematics 2012-05-22 Dmitri I. Panyushev

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

Discrete Mathematics · Computer Science 2025-09-17 Ben Young

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

Computational Geometry · Computer Science 2008-06-12 Timothy G. Abbott , Zachary Abel , David Charlton , Erik D. Demaine , Martin L. Demaine , Scott D. Kominers

We study the NP-hard graph problem Collapsed k-Core where, given an undirected graph G and integers b, x, and k, we are asked to remove b vertices such that the k-core of remaining graph, that is, the (uniquely determined) largest induced…

Discrete Mathematics · Computer Science 2018-06-01 Junjie Luo , Hendrik Molter , Ondrej Suchy

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…

Combinatorics · Mathematics 2021-07-27 Yueming Zhong

We prove the endomorphism conjecture for graded posets whose largest Whitney number is at most 4. In particular, this implies the endomorphism conjecture is true for graded posets of width at most 4.

Combinatorics · Mathematics 2023-06-02 Miklós Bóna , Ryan R. Martin

We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…

Combinatorics · Mathematics 2022-03-25 Zachary Hamaker , Rebecca Patrias , Oliver Pechenik , Nathan Williams

In the Selective Coloring problem, we are given an integer $k$, a graph $G$, and a partition of $V(G)$ into $p$ parts, and the goal is to decide whether or not we can pick exactly one vertex of each part and obtain a $k$-colorable induced…

Data Structures and Algorithms · Computer Science 2020-12-01 Guilherme C. M. Gomes , Vinicius F. dos Santos

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…

Combinatorics · Mathematics 2014-04-18 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

We give a counterexample to a conjecture made by Cigler, Jerman and Wojciechowski stating that all posets are conclusive. We also provide combinatorial characterizations for conclusiveness of finite posets and the existence of outer…

Combinatorics · Mathematics 2026-01-26 Bekir Danış , İsmail Alperen Öğüt

We show that if the ground set of a matroid can be partitioned into $k\ge 2$ bases, then for any given subset $S$ of the ground set, there is a partition into $k$ bases such that the sizes of the intersections of the bases with $S$ may…

Combinatorics · Mathematics 2025-12-02 Hannaneh Akrami , Siyue Liu , Roshan Raj , László A. Végh

With a view to establishing measure theoretic approximation properties of Delone sets, we study a setup which arises naturally in the problem of averaging almost periodic functions along exponential sequences. In this setting, we establish…

Dynamical Systems · Mathematics 2019-08-19 Michael Baake , Alan Haynes

The following is true in the Solovay model. 1. If $\leq$ is a Borel partial quasi-order on a Borel set $D$ of the reals, $X$ is a ROD subset of $D$, and $\leq$ restricted to $X$ is linear, then $X$ is countably cofinal in the sense of…

Logic · Mathematics 2018-08-16 Vladimir Kanovei

Billey-Postnikov (BP) decompositions govern when Schubert varieties $X(w)$ decompose as bundles of smaller Schubert varieties. We further develop the theory of BP decompositions and show that, in finite type, they can be recognized by…

Combinatorics · Mathematics 2025-12-10 Christian Gaetz , Yibo Gao

We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…

Logic · Mathematics 2018-12-06 Riccardo Camerlo , Alberto Marcone , Luca Motto Ros

We study the notion of a birational Chow-K\"unneth decomposition, which is essentially a decomposition of the integral birational motive of a variety. The existence of a birational Chow-K\"unneth decomposition is stably birationally…

Algebraic Geometry · Mathematics 2016-06-16 Mingmin Shen

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Number Theory · Mathematics 2011-10-20 Arnaud Bodin , Mireille Car