English
Related papers

Related papers: Formalizing the Solution to the Cap Set Problem

200 papers

We introduce the forward limit set $\Lambda$ of a semigroup $S$ generated by a family of substitutions of a finite alphabet, which typically coincides with the set of all possible s-adic limits of that family. We provide several alternative…

Dynamical Systems · Mathematics 2023-11-08 Ibai Aedo , Uwe Grimm , Ian Short

Suppose that the $d$-dimensional unit cube $Q$ is the union of three disjoint "simple" sets $E$, $F$ and $G$ and that the volumes of $E$ and $F$ are both greater than half the volume of $G$. Does this imply that, for some cube $W$ contained…

Functional Analysis · Mathematics 2019-12-10 Michael Cwikel

Based on a factorization of an input covariance matrix, we define a mild generalization of an upper bound of Nikolov (2015) and Li and Xie (2020) for the NP-Hard constrained maximum-entropy sampling problem (CMESP). We demonstrate that this…

Optimization and Control · Mathematics 2022-07-11 Zhongzhu Chen , Marcia Fampa , Jon Lee

For $g \geq 2$ and $h \geq 3$, we give small improvements on the maximum size of a $B_h[g]$-set contained in the interval $\{1,2, \dots , N \}$. In particular, we show that a $B_3[g]$-set in $\{1,2, \dots , N \}$ has at most $(14.3 g…

Combinatorics · Mathematics 2016-04-05 Craig Timmons

We introduce a finite-bound extension of a partition equinumerosity result which was orignally proposed as a problem by Andrews and Deutsch in 2016, and given a generalized form in 2018 by Smoot and Yang. We also give a simple bijective…

Combinatorics · Mathematics 2023-12-18 Michael J. Schlosser , Nicolas Allen Smoot

The Hasse Weil bound restricts the number of points of a curve which are defined over a finite field; if the number of points meets this bound, the curve is called maximal. Giulietti and Korchmaros introduced a curve C_3 which is maximal…

Number Theory · Mathematics 2016-01-15 Robert Guralnick , Beth Malmskog , Rachel Pries

Let $X$ be any subset of the interval $[-1,1]$. A subset $I$ of the unit sphere in $R^n$ will be called \emph{$X$-avoiding} if $<u,v >\notin X$ for any $u,v \in I$. The problem of determining the maximum surface measure of a $\{ 0…

Combinatorics · Mathematics 2015-02-26 Evan DeCorte , Oleg Pikhurko

In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such…

Formal Languages and Automata Theory · Computer Science 2013-04-15 Shuo Tan , Jeffrey Shallit

For a prime $p$, a restricted arithmetic progression in $\mathbb{F}_p^n$ is a triplet of vectors $x, x+a, x+2a$ in which the common difference $a$ is a non-zero element from $\{0,1,2\}^n$. What is the size of the largest $A\subseteq…

Combinatorics · Mathematics 2024-12-23 Amey Bhangale , Subhash Khot , Dor Minzer

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

Computational Geometry · Computer Science 2007-05-23 Kenneth L. Clarkson , Kasturi Varadarajan

Error-correcting codes resilient to synchronization errors such as insertions and deletions are known as insdel codes. Due to their important applications in DNA storage and computational biology, insdel codes have recently become a focal…

Combinatorics · Mathematics 2024-08-21 Xiangliang Kong , Itzhak Tamo , Hengjia Wei

In this paper, we study the following classical question of extremal set theory: what is the maximum size of a family of subsets of $[n]$ such that no $s$ sets from the family are pairwise disjoint? This problem was first posed by Erd\H os…

Combinatorics · Mathematics 2018-08-06 Peter Frankl , Andrey Kupavskii

Let $\mathscr{P}_\mathbb{Q}=\{ \alpha^n \; : \; \alpha \in \mathbb{Q}, \; n \ge 2\}$ be the set of rational perfect powers, and let $S \subseteq \mathscr{P}_\mathbb{Q}$ be a finite subset. We prove the existence of a polynomial $f_S \in…

Number Theory · Mathematics 2024-11-01 Katerina Santicola

Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivalently, the problem is to decide whether a particular type of…

Quantum Physics · Physics 2014-09-19 Sergey Bravyi , Cristopher Moore , Alexander Russell

In this paper, we deal with a class of semilinear elliptic equation in a bounded domain $\Omega\subset\mathbb{R}^N$, $N\geq 3$, with $C\sp{1,1}$ boundary. Using a new fixed point result of the Krasnoselskii's type for the sum of two…

Analysis of PDEs · Mathematics 2007-05-23 Cleon S. Barroso

For a prime power $q$ and a positive integer $n$, we say a subspace $U$ of ${\mathbb{F}_q^n}$ is {\em cyclically covering} if the union of the cyclic shifts of $U$ is equal to $\mathbb{F}_q^n$. We investigate the problem of determining the…

Combinatorics · Mathematics 2019-05-30 Peter Cameron , David Ellis , William Raynaud

A subset $A$ of the integers is a $B_k[g]$ set if the number of multisets from $A$ that sum to any fixed integer is at most $g$. Let $F_{k,g}(n)$ denote the maximum size of a $B_k[g]$ set in $\{1,\dots, n\}$. In this paper we improve the…

Combinatorics · Mathematics 2021-06-21 Griffin Johnston , Michael Tait , Craig Timmons

An arc is a subset of $\mathbb F_q^2$ which does not contain any collinear triples. Let $A(q,k)$ denote the number of arcs in $\mathbb F_q^2$ with cardinality $k$. This paper is primarily concerned with estimating the size of $A(q,k)$ when…

Combinatorics · Mathematics 2020-10-13 Oliver Roche-Newton , Audie Warren

A well-known result of Bollob\'as says that if $\{(A_i, B_i)\}_{i=1}^m$ is a set pair system such that $|A_i| \le a$ and $|B_i| \le b$ for $1 \le i \le m$, and $A_i \cap B_j \ne \emptyset$ if and only if $i \ne j$, then $m \le {a+b \choose…

Combinatorics · Mathematics 2020-11-03 Ron Holzman

For each natural number $d$, we introduce the concept of a $d$-cap in $\mathbb{F}_3^n$. A subset of $\mathbb{F}_3^n$ is called a $d$-cap if, for each $k = 1, 2, \dots, d$, no $k+2$ of the points lie on a $k$-dimensional flat. This…

Combinatorics · Mathematics 2020-10-14 Yixuan Huang , Michael Tait , Robert Won