English
Related papers

Related papers: A resolution of the Aharoni-Korman conjecture

200 papers

We show that under the assumption of a 24-term version of Fermat's Last Theorem, there exists an absolute constant c > 0 such that if S is a set of n > n_0 positive integers satisfying |S.S| < n^(1+c), then the sumset S.S satisfies |S+S| >>…

Combinatorics · Mathematics 2009-04-14 Ernie Croot , Derrick Hart

There is an old conjecture by Shermer \cite{sher} that in a polygon with $n$ vertices and $h$ holes, $\lfloor \dfrac{n+h}{3} \rfloor$ vertex guards are sufficient to guard the entire polygon. The conjecture is proved for $h=1$ by Shermer…

Computational Geometry · Computer Science 2021-02-23 Sharareh Alipour

We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance generalize naturally to this setting, and we focus on…

Combinatorics · Mathematics 2014-09-16 Joshua Cooper , Anna Kirkpatrick

To every poset P, Stanley (1986) associated two polytopes, the order polytope and the chain polytope, whose geometric properties reflect the combinatorial qualities of P. This construction allows for deep insights into combinatorics by way…

Combinatorics · Mathematics 2017-05-08 Thomas Chappell , Tobias Friedl , Raman Sanyal

We study new relations of the following statements with weak choice principles in ZF and ZFA. 1. There does not exist an infinite Hausdorff space X such that every infinite subset of X contains an infinite compact subset. 2. If a field has…

Logic · Mathematics 2023-06-16 Amitayu Banerjee

The Suslin hypothesis states that there are no nonseparable complete dense linear orderings without endpoints which have the countable chain condition. $\mathsf{ZF + AD^+ + V = L(\mathscr{P}(\mathbb{R}))}$ proves the Suslin hypothesis. In…

Logic · Mathematics 2018-03-23 William Chan , Stephen Jackson

We study test sets: subfamilies of sequences converging to a point P that still suffice to detect every discontinuity of real-valued functions at P. Ordered by inclusion, these test sets form a poset. Under natural hypotheses at P, we prove…

Combinatorics · Mathematics 2026-05-13 Gyuhyun Lim

A famous theorem of Dilworth asserts that any finite poset of width $k$ can be decomposed into $k$ chains. We study the following problem: given a Borel poset $P$ of finite width $k$, is it true that it can be decomposed into $k$ Borel…

Combinatorics · Mathematics 2020-04-07 Bartłomiej Bosek , Jarosław Grytczuk , Zbigniew Lonc

Given a poset $P$ we say a family $\mathcal{F}\subseteq P$ is centered if it is obtained by `taking sets as close to the middle layer as possible'. A poset $P$ is said to have the centeredness property if for any $M$, among all families of…

Combinatorics · Mathematics 2020-05-14 Jozsef Balogh , Sarka Petrickova , Adam Zsolt Wagner

Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C_Q in Q with the property that f restricted to C_Q is…

Data Structures and Algorithms · Computer Science 2013-04-23 Jaroslaw Blasiok , Marcin Kaminski

In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for…

Combinatorics · Mathematics 2023-09-15 Laura Colmenarejo , Felix Hutchins , Nicholas Mayers , Etienne Phillips

We provide precise asymptotics for the number of antichains in the poset $\{0,1,2\}^n$, answering a question of Sapozhenko. Finding improved estimates for this number was also a problem suggested by Noel, Scott, and Sudakov, who obtained…

Combinatorics · Mathematics 2026-01-13 Matthew Jenssen , Jinyoung Park , Michail Sarantis

Given a graded poset $P$, consider a chain decomposition $\mathcal{C}$ of $P$. If $|C_1|\le |C_2|$ implies that the set of the ranks of elements in $C_1$ is a subset of the ranks of elements in $C_2$ for any chains $C_1,C_2\in \mathcal{C}$,…

Combinatorics · Mathematics 2017-09-07 Yu-Lun Chang , Wei-Tian Li

We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finite poset (a reflexive, antisymmetric, and transitive directed…

Logic in Computer Science · Computer Science 2014-08-20 Simone Bova , Robert Ganian , Stefan Szeider

The order and chain polytopes are two 0/1-polytopes constructed from a finite poset. In this paper, we study the $f$-vectors of these polytopes. We investigate how the order and chain polytopes behave under disjoint unions and ordinal sums…

Combinatorics · Mathematics 2024-11-07 Ragnar Freij-Hollanti , Teemu Lundström

We prove an analogue of the classical Bateman-Horn conjecture on prime values of polynomials for the ring of polynomials over a large finite field. Namely, given non-associate, irreducible, separable and monic (in the variable $x$)…

Number Theory · Mathematics 2019-02-20 Alexei Entin

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We show that the order complex of the poset of all cosets of all proper subgroups of a finite group $G$ is never $\mathbb{F}_{2}$-acyclic and therefore never contractible. This settles a question of K. S. Brown.

Combinatorics · Mathematics 2016-04-01 John Shareshian , Russ Woodroofe

We consider two generalizations of Pollack's uncertainty principle for M\"obius inversion to locally finite posets. The first generalization was previously studied by Goh. Here, we provide a simplified sufficient criterion for the…

Combinatorics · Mathematics 2026-05-06 Anurag Sahay

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

Group Theory · Mathematics 2008-03-11 Günter Lettl , Zhi-Wei Sun