English
Related papers

Related papers: Sunflower Bound with a Sub-Logarithmic Base

200 papers

Robust sunflowers are a generalization of combinatorial sunflowers that have applications in monotone circuit complexity, DNF sparsification, randomness extractors, and recent advances on the Erd\H{o}s-Rado sunflower conjecture. The recent…

Computational Complexity · Computer Science 2022-08-08 Bruno Pasqualotto Cavalar , Mrinal Kumar , Benjamin Rossman

In S. 1 we deal with amalgamation bases, e.g., we define when an a.e.c. $k$ has $(\lambda,\kappa)$-amalgamation which means "many" M in $K^k_\lambda$ are amalgamation bases. We then consider what happens for the class of lf groups. In S. 2…

Logic · Mathematics 2019-01-29 Saharon Shelah

A sunflower is a collection of sets $\{U_1,\ldots, U_n\}$ such that the pairwise intersection $U_i\cap U_j$ is the same for all choices of distinct $i$ and $j$. We study sunflowers of convex open sets in $\mathbb R^d$, and provide a…

Combinatorics · Mathematics 2022-07-19 R. Amzi Jeffs

In this article, we investigate the cardinality of Groebner bases under various monomial orderings. We identify a family of polynomials F and a criterion such that the reduced Groebner basis of F is double exponential in cardinality with…

Combinatorics · Mathematics 2026-01-22 Archana S Morye , Sreenanda S B , Prakash Saivasan

Let $k>1$, and let $\mathcal{F}$ be a family of $2n+k-3$ non-empty sets of edges in a bipartite graph. If the union of every $k$ members of $\mathcal{F}$ contains a matching of size $n$, then there exists an $\mathcal{F}$-rainbow matching…

Combinatorics · Mathematics 2021-12-30 Ron Aharoni , Joseph Briggs , Minho Cho , Jinha Kim

Let $\Sigma$ be Laurent phenomenon (LP) seed of rank $n$, $\mathcal{A}(\Sigma)$, $\mathcal{U}(\Sigma)$ and $\mathcal{L}(\Sigma)$ be its corresponding Laurent phenomenon algebra, upper bound and lower bound respectively. We prove that each…

Rings and Algebras · Mathematics 2022-01-11 Qiuning Du , Fang Li

For fixed $k$ we prove exponential lower bounds on the equilateral number of subspaces of $\ell_{\infty}^n$ of codimension $k$. In particular, we show that if the unit ball of a normed space of dimension $n$ is a centrally symmetric…

Combinatorics · Mathematics 2020-05-12 Nora Frankl

Let ${\mathcal{M} = (M_i \colon i\in K)}$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the following Cantor-Bernstein-type result: If there is a…

Combinatorics · Mathematics 2024-05-27 Joshua Erde , Pascal Gollin , Attila Joó , Paul Knappe , Max Pitz

The hyperbolic (and more generally, Lorentzian) Kac-Moody (KM) Lie algebras $\cA$ of rank $r+2 > 2$ are shown to have a rich structure of indefinite KM subalgebras which can be described by specifying a subset of positive real roots of…

Quantum Algebra · Mathematics 2007-05-23 Alex J. Feingold , Hermann Nicolai

Let $F$ be a family of pseudo-disks in the plane, and $P$ be a finite subset of $F$. Consider the hypergraph $H(P,F)$ whose vertices are the pseudo-disks in $P$ and the edges are all subsets of $P$ of the form $\{D \in P \mid D \cap S \neq…

Computational Geometry · Computer Science 2018-02-27 Boris Aronov , Anirudh Donakonda , Esther Ezra , Rom Pinchasi

Let $\mathcal{F}$ be a family of $k$-sized subsets of $[n]$ that does not contain $s$ pairwise disjoint subsets. The Erd\H{o}s Matching Conjecture, a celebrated and long-standing open problem in extremal combinatorics, asserts the maximum…

Combinatorics · Mathematics 2026-03-11 Tapas Kumar Mishra

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

The Union-Closed Sets Conjecture, also known as Frankl's conjecture, asks whether, for any union-closed set family $\mathcal{F}$ with $m$ sets, there is an element that lies in at least $\frac{1}{2}\cdot m$ sets in $\mathcal{F}$. In 2022,…

Combinatorics · Mathematics 2024-12-10 Saintan Wu

Let $G = (V, E)$ be a graph without an isolated vertex. A set $D\subseteq V(G)$ is a $k$-distance paired domination set of $G$ if $D$ is a $k$-distance dominating set of $G$ and the induced subgraph $\langle D \rangle$ has a perfect…

Combinatorics · Mathematics 2019-07-03 Tanveer Iqbal , Syed Ahtsham Ul Haq Bokhary

For every irrational real $\alpha$, let $M(\alpha) = \sup_{n\geq 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or $\infty$, if unbounded). The $2$-adic Littlewood conjecture (2LC) can be stated as…

Number Theory · Mathematics 2025-08-13 Dinis Vitorino , Ingrid Vukusic

It is known that, for any $k$-list assignment $L$ of a graph $G$, the number of $L$-list colorings of $G$ is at least the number of the proper $k$-colorings of $G$ when $k>(m-1)/\ln(1+\sqrt{2})$. In this paper, we extend the Whitney's…

Combinatorics · Mathematics 2022-07-13 Sumin Huang , Jianguo Qian , Wei Wang

Two subsets $A,B$ of an $n$-element ground set $X$ are said to be \emph{crossing}, if none of the four sets $A\cap B$, $A\setminus B$, $B\setminus A$ and $X\setminus(A\cup B)$ are empty. It was conjectured by Karzanov and Lomonosov forty…

Combinatorics · Mathematics 2017-04-10 Andrey Kupavskii , János Pach , István Tomon

For every integer $k \geq 3$ we construct a $k$-gonal curve $C$ along with a very ample divisor of degree $2g + k - 1$ (where $g$ is the genus of $C$) to which the vanishing statement from the Green-Lazarsfeld gonality conjecture does not…

Algebraic Geometry · Mathematics 2017-04-12 Wouter Castryck

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

A function $f: \mathbb{F}_2^n \rightarrow \{0,1\}$ is triangle-free if there are no $x_1,x_2,x_3 \in \mathbb{F}_2^n$ satisfying $x_1+x_2+x_3=0$ and $f(x_1)=f(x_2)=f(x_3)=1$. In testing triangle-freeness, the goal is to distinguish with high…

Data Structures and Algorithms · Computer Science 2014-11-19 Ishay Haviv , Ning Xie