English
Related papers

Related papers: A resolution of the Aharoni-Korman conjecture

200 papers

Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…

Combinatorics · Mathematics 2025-01-27 Irfan Alam

We prove that every finite poset has a directed cut with at least one half of the poset's pairwise order relations. The bound is tight. Also, the largest directed cut in a poset can be found in linear time.

Combinatorics · Mathematics 2025-07-17 Nati Linial , Ori Shoshani

We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…

Logic in Computer Science · Computer Science 2014-05-13 Simone Bova , Robert Ganian , Stefan Szeider

A family ${\mathcal A} \subset {\mathcal P} [n]$ is said to be an antichain if $A \not \subset B$ for all distinct $A,B \in {\mathcal A}$. A classic result of Sperner shows that such families satisfy $|{\mathcal A}| \leq \binom {n}{\lfloor…

Combinatorics · Mathematics 2015-03-23 Eoin Long

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Data Structures and Algorithms · Computer Science 2023-04-11 Prateek Bhakta , Ben Cousins , Matthew Fahrbach , Dana Randall

A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…

Combinatorics · Mathematics 2022-07-27 Balázs Keszegh , Nathan Lemons , Ryan R. Martin , Dömötör Pálvölgyi , Balázs Patkós

Using Casorati determinants of Charlier polynomials, we construct for each finite set $F$ of positive integers a sequence of polynomials $r_n^F$, $n\in \sigma_F$, which are eigenfunction of a second order difference operator, where…

Classical Analysis and ODEs · Mathematics 2014-09-17 Antonio J. Duran

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Group Theory · Mathematics 2025-10-22 Peter J. Cameron , Hiranya Kishore Dey

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

We introduce the property ``$F$-linked'' of subsets of posets for a given free filter $F$ on the natural numbers, and define the properties ``$\mu$-$F$-linked'' and ``$\theta$-$F$-Knaster'' for posets in a natural way. We show that…

Logic · Mathematics 2020-07-07 Jörg Brendle , Miguel A. Cardona , Diego A. Mejía

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

Number Theory · Mathematics 2025-10-09 Thomas F. Bloom

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

Combinatorics · Mathematics 2025-12-03 Cory H. Colbert

Inverse limits, unlike direct limits, can in general be void, [1]. The existence of fixed points for arbitrary mappings $T : X \longrightarrow X$ is conjectured to be equivalent with the fact that related direct limits of all finite…

General Mathematics · Mathematics 2007-09-05 Elemer E Rosinger

Kahn and Kim (J. Comput. Sci., 1995) have shown that for a finite poset $P$, the entropy of the incomparability graph of $P$ (normalized by multiplying by the order of $P$) and the base-$2$ logarithm of the number of linear extensions of…

Combinatorics · Mathematics 2014-12-04 Samuel Fiorini , Selim Rexhep

We study the difference between the number of facets of the order polytope and the chain polytope of a poset. Hibi and Li classified posets where the gap is exactly zero. We describe the bounds on this gap using the new notion of crossing…

Combinatorics · Mathematics 2024-05-29 Binaya Bhandari , Debra Cunningham , Grace Morrell , SuHo Oh , Paxton Smith

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

A well-known result of R. Pol states that a Banach space $X$ has property ($\mathcal{C}$) of Corson if and only if every point in the weak*-closure of any convex set $C \subseteq B_{X^*}$ is actually in the weak*-closure of a countable…

Functional Analysis · Mathematics 2023-03-06 Gonzalo Martínez-Cervantes , Alejandro Poveda

Aharoni and Ziv conjectured that if $ M $ and $ N $ are finitary matroids on $ E $, then a certain ``Hall-like'' condition is sufficient to guarantee the existence of an $ M $-independent spanning set of $ N $. We show that their condition…

Combinatorics · Mathematics 2024-03-13 Attila Joó

A subset $A$ of $\mathbb{Z}^n$ is called a weak antichain if it does not contain two elements $x$ and $y$ satisfying $x_i<y_i$ for all $i$. Engel, Mitsis, Pelekis and Reiher showed that for any weak antichain $A$, the sum of the sizes of…

Combinatorics · Mathematics 2020-03-20 Barnabás Janzer