English
Related papers

Related papers: Uniform sets with few progressions via colorings

200 papers

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

Combinatorics · Mathematics 2007-05-23 Terence Tao

We analyze the Fourier growth, i.e. the $L_1$ Fourier weight at level $k$ (denoted $L_{1,k}$), of various well-studied classes of "structured" $\mathbb{F}_2$-polynomials. This study is motivated by applications in pseudorandomness, in…

Computational Complexity · Computer Science 2024-10-15 Jarosław Błasiok , Peter Ivanov , Yaonan Jin , Chin Ho Lee , Rocco A. Servedio , Emanuele Viola

We show that the Consensus Division theorem implies lower bounds on the chromatic number of Kneser hypergraphs, offering a novel proof for a result of Alon, Frankl, and Lov\'{a}sz (Trans. Amer. Math. Soc., 1986) and for its generalization…

Computational Complexity · Computer Science 2024-11-25 Ishay Haviv

Several recent papers have considered the Ramsey-theoretic problem of how large a subset of integers can be without containing any 3-term geometric progressions. This problem has also recently been generalized to number fields, determining…

Number Theory · Mathematics 2016-01-22 Megumi Asada , Eva Fourakis , Sarah Manski , Nathan McNew , Steven J. Miller , Gwyneth Moreland

For a closed subset $K$ of a compact metric space $A$ possessing an $\alpha$-regular measure $\mu$ with $\mu(K)>0$, we prove that whenever $s>\alpha$, any sequence of weighted minimal Riesz $s$-energy configurations…

Mathematical Physics · Physics 2011-11-23 D. P. Hardin , E. B. Saff , J. T. Whitehouse

The Ramsey number $r_k(s,n)$ is the minimum $N$ such that for every red-blue coloring of the $k$-tuples of $\{1,\ldots, N\}$, there are $s$ integers such that every $k$-tuple among them is red, or $n$ integers such that every $k$-tuple…

Combinatorics · Mathematics 2018-01-17 Dhruv Mubayi , Andrew Suk

We provide estimates for the dimensions of sets in $\mathbb{R}$ which uniformly avoid finite arithmetic progressions. More precisely, we say $F$ uniformly avoids arithmetic progressions of length $k \geq 3$ if there is an $\epsilon>0$ such…

Classical Analysis and ODEs · Mathematics 2021-03-26 Jonathan M. Fraser , Kota Saito , Han Yu

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

Combinatorics · Mathematics 2025-10-17 C. Terry , J. Wolf

This paper generalizes the results of [13] and then provides an interesting example. We construct a family of $W$-like maps $\{W_a\}$ with a turning fixed point having slope $s_1$ on one side and $-s_2$ on the other. Each $W_a$ has an…

Dynamical Systems · Mathematics 2013-10-18 Zhenyang Li

For positive integers $n, k, q, p$, let $A_k(n; q, p)$ be the largest integer $N$ such that there exists an edge coloring of $K_N^{(k)}$ with $q$ colors that does not contain a tight monotone path of length $n$ that consists of at most $p$…

Combinatorics · Mathematics 2026-05-13 Jigang Choi , Hyunwoo Lee

We prove that random $\mathbb{Z}$-homomorphisms on weakly expanding bipartite graphs exhibit a strong "flatness" phenomenon. Extending prior work of Peled, Samotij, and Yehudayoff for expanders, we first show that on any bipartite $(n, d,…

Combinatorics · Mathematics 2026-04-06 Dingding Dong , Jinyoung Park

Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…

Classical Analysis and ODEs · Mathematics 2013-06-11 Izabella Laba , Malabika Pramanik

We study convergence properties of sparse averages of partial sums of Fourier series of continuous functions. By sparse averages, we are considering an increasing sequences of integers $n_0 < n_1 < n_2 < ...$ and looking at…

Classical Analysis and ODEs · Mathematics 2019-03-19 Ethan Goolish , Robert S. Strichartz

Given a positive integer $N$ and real number $\alpha\in [0, 1]$, let $m(\alpha,N)$ denote the minimum, over all sets $A\subset \mathbb{Z}/N\mathbb{Z}$ of size at least $\alpha N$, of the normalized count of 3-term arithmetic progressions…

Combinatorics · Mathematics 2014-09-11 Pablo Candela , Olof Sisask

For integers $m$ and $n$, we study the problem of finding good lower bounds for the size of progression-free sets in $(\mathbb{Z}_{m}^{n},+)$. Let $r_{k}(\mathbb{Z}_{m}^{n})$ denote the maximal size of a subset of $\mathbb{Z}_{m}^{n}$…

Number Theory · Mathematics 2023-01-02 Christian Elsholtz , Benjamin Klahn , Gabriel F. Lipnik

Liu, Pach and S\'andor recently characterized all polynomials $p(z)$ such that the equation $x+y=p(z)$ is $2$-Ramsey, that is, any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic solutions for $x+y=p(z)$. In this paper,…

Combinatorics · Mathematics 2024-04-02 Jaehoon Kim , Hong Liu , Péter Pál Pach

Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free…

Number Theory · Mathematics 2017-07-19 Xiaoyu He

Hyperuniformity is a property of certain heteroneous media in which density fluctuations in the long wavelength range decay to zero. In reciprocal space this behavior translates into a decay of Fourier intensities in the range near small…

Applied Physics · Physics 2023-09-08 Mario Lázaro , Luis M. García-Raffi

We describe in this paper additively left stable sets, i.e. sets satisfying $\left((A+A)-\inf(A)\right)\cap[\inf(A),\sup(A)]=A$ (meaning that $A-\inf(A)$ is stable by addition with itself on its convex hull), when $A$ is a finite subset of…

Number Theory · Mathematics 2025-01-13 Paul Péringuey , Anne de Roton

A set of integers is called sum-free if it contains no triple $(x,y,z)$ of not necessarily distinct elements with $x+y=z$. In this paper, we provide a structural characterisation of sum-free subsets of $\{1,2,\ldots,n\}$ of density at least…

Combinatorics · Mathematics 2018-08-14 Tuan Tran
‹ Prev 1 4 5 6 7 8 10 Next ›