English
Related papers

Related papers: Extremal set theory, cubic forms on $\mathbb{F}_2^…

200 papers

The union-closed sets conjecture states that in any nonempty union-closed family $\mathcal{F}$ of subsets of a finite set, there exists an element contained in at least a proportion $1/2$ of the sets of $\mathcal{F}$. Using the…

Combinatorics · Mathematics 2023-05-24 Lei Yu

A conjecture of Marton, widely known as the polynomial Freiman-Ruzsa conjecture, was recently proved by Gowers, Green, Manners and Tao for any bounded-torsion Abelian group $G$. In this paper we show a few simple modifications that improve…

Combinatorics · Mathematics 2024-04-16 Jyun-Jie Liao

Let $n > k > t \geq j \geq 1$ be integers. Let $X$ be an $n$-element set, ${X\choose k}$ the collection of its $k$-subsets. A family $\mathcal F \subset {X\choose k}$ is called $t$-intersecting if $|F \cap F'| \geq t$ for all $F, F' \in…

Combinatorics · Mathematics 2021-01-11 P. Frankl , G. O. H. Katona

A finite set $ S \subset \mathbb{R} $ is called a Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x \le y $ are distinct, and a weak Sidon set if all sums $ x+y $ with $ x,y \in S $ and $ x < y $ are distinct. For a finite set $ A…

Combinatorics · Mathematics 2026-03-09 Jie Ma , Quanyu Tang

We introduce a series of $\Z_2^n$-graded quasialgebras $\bbP_n(m)$ which generalizes Clifford algebras, higher octonions, and higher Cayley algebras. The constructed series of algebras and their minor perturbations are applied to contribute…

Quantum Algebra · Mathematics 2024-10-01 Ya-Qing Hu , Hua-Lin Huang , Chi Zhang

We consider the construction of maximal families of polynomials over the finite field $\mathbb{F}_q$, all having the same degree $n$ and a nonzero constant term, where the degree of the GCD of any two polynomials is $d$ with $1 \le d\le n$.…

Discrete Mathematics · Computer Science 2024-05-15 Maximilien Gadouleau , Luca Mariot , Federico Mazzone

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

Discrete Mathematics · Computer Science 2009-12-17 Otfried Cheong , Xavier Goaoc , Cyril Nicaud

Let $\mathcal{F}$ be a family of subsets of $[n]$. The diameter of $\mathcal{F}$ is the maximum size of symmetric differences among pairs of its members. Resolving a conjecture of Erd\H{o}s, Kleitman determined the maximum size of a family…

Combinatorics · Mathematics 2025-06-11 Yongjiang Wu , Yongtao Li , Lihua Feng , Jiuqiang Liu , Guihai Yu

Given a vector $\alpha = (\alpha_1, \ldots, \alpha_k) \in \mathbb{F}_2^k$, we say a collection of subsets $\mathcal{F}$ satisfies $\alpha$-intersection pattern modulo $2$ if all $i$-wise intersections consisting of $i$ distinct sets from…

Combinatorics · Mathematics 2025-03-27 Griffin Johnston , Jason O'Neill

In this paper, we investigate a problem concerning quartets, which are a particular type of tree on four leaves. Loosely speaking, a set of quartets is said to be `definitive' if it completely encapsulates the structure of some larger tree,…

Combinatorics · Mathematics 2011-01-28 Chris Dowden

In combinatorial group testing problems Questioner needs to find a special element $x \in [n]$ by testing subsets of $[n]$. Tapolcai et al. introduced a new model, where each element knows the answer for those queries that contain it and…

Discrete Mathematics · Computer Science 2018-01-29 Dániel Gerbner , Máté Vizer

We exhibit an infinite family of {\it triplets} of mutually unbiased bases (MUBs) in dimension 6. These triplets involve the Fourier family of Hadamard matrices, $F(a,b)$. However, in the main result of the paper we also prove that for any…

Quantum Physics · Physics 2015-05-13 P. Jaming , M. Matolcsi , P. Móra , F. Szöllősi , M. Weiner

In this paper we study those submonoids of $\mathbb{N}^d$ which a non-trivial pseudo-Frobenius set. In the affine case, we prove that they are the affine semigroups whose associated algebra over a field has maximal projective dimension…

Commutative Algebra · Mathematics 2019-03-27 J. I. García-García , I. Ojeda , J. C. Rosales , A. Vigneron-Tenorio

A classical result in additive combinatorics, which is a combination of Balog-Szemer\'edi-Gowers theorem and a variant of Freiman's theorem due to Ruzsa, says that if a subset $A$ of $\mathbb{F}_p^n$ contains at least $c |A|^3$ additive…

Combinatorics · Mathematics 2023-08-25 Luka Milićević

Let $G$ be an abelian group. A set $A \subset G$ is a \emph{$B_k^+$-set} if whenever $a_1 + \dots + a_k = b_1 + \dots + b_k$ with $a_i, b_j \in A$ there is an $i$ and a $j$ such that $a_i = b_j$. If $A$ is a $B_k$-set then it is also a…

Combinatorics · Mathematics 2013-06-21 Craig Timmons

We study the complexity of approximating complex zero sets of certain $n$-variate exponential sums. We show that the real part, $R$, of such a zero set can be approximated by the $(n-1)$-dimensional skeleton, $T$, of a polyhedral…

Algebraic Geometry · Mathematics 2021-04-22 Alperen Ergür , Grigoris Paouris , J. Maurice Rojas

The aim of this short note is to define the \it universal cubic fourfold \rm over certain loci of their moduli space. Then, we propose two methods to prove that it is unirational over the Hassett divisors $\mathcal{C}_d$, in the range…

Algebraic Geometry · Mathematics 2020-04-29 Hanine Awada , Michele Bolognesi

For integers $n\ge s\ge2$, let $e(n,s)$ denote the maximum size of a family $\F\subseteq2^{[n]}$ with no $s$ pairwise disjoint members. The problem of determining $e(n,s)$, now called the Erd\H{o}s--Kleitman problem, is the non-uniform…

Combinatorics · Mathematics 2026-05-13 Cheng Chi , Yan Wang

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

Number Theory · Mathematics 2024-11-12 Kevin O'Bryant
‹ Prev 1 8 9 10 Next ›