English
Related papers

Related papers: Uniform sets with few progressions via colorings

200 papers

We use techniques from the study of the Falconer distance conjecture to explore conditions which guarantee largeness (in terms of bounded $L^2$ density/Lebesgue measure and Hausdorff measure) of the set of lengths of step-sizes of…

Classical Analysis and ODEs · Mathematics 2026-02-04 Marc Carnovale , Steven Senger

We study correlation bounds under pairwise independent distributions for functions with no large Fourier coefficients. Functions in which all Fourier coefficients are bounded by $\delta$ are called $\delta$-{\em uniform}. The search for…

Probability · Mathematics 2010-11-09 Per Austrin , Elchanan Mossel

A linear configuration is said to be common in $G$ if every 2-coloring of $G$ yields at least the number of monochromatic instances of a randomly chosen coloring. Saad and Wolf asked whether, analogously to a result by Thomason in graph…

Combinatorics · Mathematics 2021-09-13 Leo Versteegen

An old conjecture of Zs. Tuza says that for any graph $G$, the ratio of the minimum size, $\tau_3(G)$, of a set of edges meeting all triangles to the maximum size, $\nu_3(G)$, of an edge-disjoint triangle packing is at most 2. Here,…

Combinatorics · Mathematics 2018-07-31 Jacob D. Baron , Jeff Kahn

We introduce a new notion of sparsification, called \emph{strong sparsification}, in which constraints are not removed but variables can be merged. As our main result, we present a strong sparsification algorithm for 1-in-3-SAT. The…

Data Structures and Algorithms · Computer Science 2026-05-15 Benjamin Bedert , Tamio-Vesa Nakajima , Karolina Okrasa , Stanislav Živný

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

Combinatorics · Mathematics 2016-11-29 Shanshan Du , Hao Pan

A problem of recent interest has been to study how large subsets of the natural numbers can be while avoiding 3-term geometric progressions. Building on recent progress on this problem, we consider the analogous problem over quadratic…

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

We give an elementary, Fourier-free proof of Roth's theorem. The proof follows Roth's original density-increment strategy, but replaces the usual Fourier-analytic step with a direct combinatorial argument involving averages over…

Combinatorics · Mathematics 2026-05-20 Mark Lewko

Let k >= 2 and F be a linear k-uniform hypergraph with v vertices. We prove that if n is sufficiently large and v|n, then every quasirandom k-uniform hypergraph on n vertices with constant edge density and minimum degree $\Omega(n^{k-1})$…

Combinatorics · Mathematics 2014-02-18 John Lenz , Dhruv Mubayi

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…

Logic · Mathematics 2016-09-07 Tamara Hummel , Carl Jockusch

Two well studied Ramsey-theoretic problems consider subsets of the natural numbers which either contain no three elements in arithmetic progression, or in geometric progression. We study generalizations of this problem, by varying the kinds…

Let F be a finite union-closed family of sets whose largest set contains n elements. In \cite{Wojcik92}, Wojcik defined the density of F to be the ratio of the average set size of F to n and conjectured that the minimum density over all…

Combinatorics · Mathematics 2011-06-03 Igor Balla

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

Number Theory · Mathematics 2024-11-05 Michael T. Lacey , Hamed Mousavi , Yaghoub Rahimi , Manasa N. Vempati

A set $Y\subseteq\mathbb{R}^d$ that intersects every convex set of volume $1$ is called a Danzer set. It is not known whether there are Danzer sets in $\mathbb{R}^d$ with growth rate $O(T^d)$. We prove that natural candidates, such as…

Metric Geometry · Mathematics 2014-07-14 Yaar Solomon , Barak Weiss

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

As shown by Witten the N=1 supersymmetric gauged WZW model based on a group G has an extended N=2 supersymmetry if the gauged subgroup H is so chosen that G/H is Kahler. We extend Witten's result and prove that the N=1 supersymmetric gauged…

High Energy Physics - Theory · Physics 2011-02-09 Murat Gunaydin

Let A be a subset of $\F_p^n$, the $n$-dimensional linear space over the prime field $\F_p$ of size at least $\de N$ $(N=p^n)$, and let $S_v=P^{-1}(v)$ be the level set of a homogeneous polynomial map $P:\F_p^n\to\F_p^R$ of degree $d$, and…

Number Theory · Mathematics 2010-11-30 Brian Cook , Akos Magyar

Green, Tao and Ziegler prove ``Dense Model Theorems'' of the following form: if R is a (possibly very sparse) pseudorandom subset of set X, and D is a dense subset of R, then D may be modeled by a set M whose density inside X is…

Combinatorics · Mathematics 2008-06-04 Omer Reingold , Luca Trevisan , Madhur Tulsiani , Salil Vadhan

In this paper, we investigate the anti-Ramsey (more precisely, anti-van der Waerden) properties of arithmetic progressions. For positive integers $n$ and $k$, the expression $aw([n],k)$ denotes the smallest number of colors with which the…