English
Related papers

Related papers: New Bounds on cap sets

200 papers

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

A subset $\mathcal{C}\subseteq\{0,1,2\}^n$ is said to be a $\textit{trifferent}$ code (of block length $n$) if for every three distinct codewords $x,y, z \in \mathcal{C}$, there is a coordinate $i\in \{1,2,\ldots,n\}$ where they all differ,…

Information Theory · Computer Science 2024-02-06 Siddharth Bhandari , Abhishek Khetan

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

Combinatorics · Mathematics 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

We prove that perfect $3$-hash linear codes in $\mathbb{F}_{3}^{n}$ must have dimension at most $ \left(\frac{1}{4}-\epsilon\right)n$ for some absolute constant $\epsilon > 0$.

Information Theory · Computer Science 2021-05-21 Cosmin Pohoata , Dmitriy Zakharov

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

Combinatorics · Mathematics 2013-02-19 Alain Plagne , Anne de Roton

Let $S$ and $T$ be subsets of $\mathbf{F}_q^n$. We show there are subsets $S'$ of $S$ and $T'$ of $T$ such that $S+T$ is the union of $S+T'$ and $S'+T$, with $|S'| + |T'|$ bounded by $c^n$ with $c < q$. The proof relies on the method of…

Combinatorics · Mathematics 2017-09-08 Jordan S. Ellenberg

For $p$ being a large prime number, and $A \subset \mathbb{F}_p$ we prove the following: $(i)$ If $A(A+A)$ does not cover all nonzero residues in $\mathbb{F}_p$, then $|A| < p/8 + o(p)$. $(ii)$ If $A$ is both sum-free and satisfies $A =…

Number Theory · Mathematics 2023-02-09 Aliaksei Semchankau

Let $V$ be a complex nonsingular projective 3-fold of general type. We prove $P_{12}(V)>0$ and $P_{24}(V)>1$ (which answers an open problem of J. Kollar and S. Mori). We also prove that the canonical volume has an universal lower bound…

Algebraic Geometry · Mathematics 2007-10-25 Jungkai A. Chen , Meng Chen

Let $G$ be a finite group, and let $r_{3}(G)$ represent the size of the largest subset of $G$ without non-trivial three-term progressions. In a recent breakthrough, Croot, Lev and Pach proved that $r_{3}(C_{4}^{n}) \leqslant (3.61)^{n}$,…

Combinatorics · Mathematics 2018-05-16 Fedor Petrov , Cosmin Pohoata

Let $\mathcal{C}\subseteq[0,1]$ be a Cantor set. In the classical $\mathcal{C}\pm\mathcal{C}$ problems, modifying the ``size'' of $\mathcal{C}$ has a magnified effect on $\mathcal{C}\pm\mathcal{C}$. However, any gain in $\mathcal{C}$…

Classical Analysis and ODEs · Mathematics 2026-03-23 Piotr Nowakowski , Cheng-Han Pan

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Combinatorics · Mathematics 2025-10-06 Ritesh Goenka , Kenneth Moore , Ethan Patrick White

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

It was recently realized that the three-dimensional O($N$) model possesses an extraordinary boundary universality class for a finite range of $N \ge 2$. For a given $N$, the existence and universal properties of this class are predicted to…

Statistical Mechanics · Physics 2022-05-31 Francesco Parisen Toldin , Max A. Metlitski

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Metric Geometry · Mathematics 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

We consider the following conjecture (from Huang, et al): Let $\Delta^+$ denote the upper half disc in $\mathbb{C}$ and let $\gamma = ( - 1, 1)$ (viewed as an interval in the real axis in $\mathbb{C}$). Assume that $F$ is a holomorphic…

Complex Variables · Mathematics 2015-08-13 Abtin Daghighi , Steven G. Krantz

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…

Statistical Mechanics · Physics 2017-05-16 Ralph Kenna , Bertrand Berche

We use results on inclusions of free products and extensions of completely positive maps to determine the maximal $C^*$-envelope for upper triangular $3 \times 3$ matrices. We consider these same results in the context of larger upper…

Operator Algebras · Mathematics 2023-08-14 Benton L. Duncan

We give a proof of universality in the bulk of spectrum of unitary matrix models, assuming that the potential is globally $C^{2}$ and locally $C^{3}$ function. The proof is based on the determinant formulas for correlation functions in…

Mathematical Physics · Physics 2013-07-01 Mihail Poplavskyi

We prove that if $A_0$ and $A_1$ are compact convex sets contained in a convex $n$-gon with vertices $g_1, \dots, g_n$, and $n$ is strictly greater than the number of common supporting lines of $A_0$ and $A_1$, then there exist $i \in…

Combinatorics · Mathematics 2025-12-18 Yiming Song

We study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = \rho \cdot (n\!-\!1)$, $\rho \in [0,1]$, i.e., a radius that is a constant…

Information Theory · Computer Science 2017-04-21 Moshe Schwartz , Pascal O. Vontobel
‹ Prev 1 4 5 6 7 8 10 Next ›