English
Related papers

Related papers: On the Decay of the Fourier Transform and Three Te…

200 papers

Suppose that f : F_p^n -> [0,1] has expected value t in [p^(-n/9),1] (so, the density t can be quite low!). Furthermore, suppose that support(f) has no three-term arithmetic progressions. Then, we develop non-trivial lower bounds for f_j,…

Combinatorics · Mathematics 2007-07-11 Ernie Croot

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

Given a subset of the integers of zero density, we define the weaker notion of fractional density of such a set. It is shown how this notion corresponds to that of the Hausdorff dimension of a compact subset of the reals. We then show that…

Number Theory · Mathematics 2010-07-14 Paul Potgieter

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Arithmetic progressions of length $3$ may be found in compact subsets of the reals that satisfy certain Fourier -- as well as Hausdorff -- dimensional requirements. It has been shown that a very similar result holds in the integers under…

Classical Analysis and ODEs · Mathematics 2021-04-20 Paul Potgieter

In this paper we prove: If 0 < d < 1, and p is a sufficiently large prime, then if S is a subset of Z/pZ having the least number of three-term arithmetic progressions among all subsets of Z/pZ having at least dp elements, then S has an…

Number Theory · Mathematics 2007-05-23 Ernie Croot

Fix a prime p and a density 0 < d <= 1. Among all functions f : F_p -> [0,1], what can one say about those which assign minimal weight to three-term arithmetic progressions -- that is, the sum of f(a)f(a+x)f(a+2x) is minimal as we sum over…

Combinatorics · Mathematics 2008-02-19 Ernie Croot

We show that subsets of $\mathbb{F}_q^{\infty}$ of large Fourier dimension must contain three-term arithmetic progressions. This contrasts with a construction of Shmerkin of a subset of $\mathbb{R}$ of Fourier dimension $1$ with no…

Classical Analysis and ODEs · Mathematics 2020-03-04 Robert Fraser

We prove new lower bounds on the maximum size of sets $A\subseteq \mathbb{F}_p^n$ or $A\subseteq \mathbb{Z}_m^n$ not containing three-term arithmetic progressions (consisting of three distinct points). More specifically, we prove that for…

Combinatorics · Mathematics 2024-01-24 Christian Elsholtz , Laura Proske , Lisa Sauermann

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Combinatorics · Mathematics 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

Assuming the well-known conjecture that [x,x+x^t] contains a prime for t > 0 and x sufficiently large, we prove: For 0 < r < 1, there exists 0 < s < r < 1, 0 < d < 1, and infinitely many primes q such that if S is a subset of Z/qZ having…

Number Theory · Mathematics 2007-05-23 Ernie Croot

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three term arithmetic progressions, in the sense that all sufficiently large subsets contain at least one such…

Combinatorics · Mathematics 2020-09-17 Cosmin Pohoata , Oliver Roche-Newton

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

Number Theory · Mathematics 2013-08-06 Renling Jin

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Number Theory · Mathematics 2024-10-30 Zander Kelley , Raghu Meka

It is shown that if three distinct values of a meromorphic function f:C^n -> P^1 of hyper-order strictly less than 2/3 have forward invariant pre-images with respect to a translation t:C^n -> C^n, t(z)=z+c, then f is a periodic function…

Complex Variables · Mathematics 2013-07-15 Risto Korhonen

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

Suppose that G is an abelian group and A is a finite subset of G containing no three-term arithmetic progressions. We show that |A+A| >> |A|(log |A|)^{1/3-\epsilon} for all \epsilon>0.

Number Theory · Mathematics 2010-04-02 Tom Sanders

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

Combinatorics · Mathematics 2016-02-24 Kevin Henriot

In this note we compare two measures of the complexity of a class $\mathcal F$ of Boolean functions studied in (unconditional) pseudorandomness: $\mathcal F$'s ability to distinguish between biased and uniform coins (the coin problem), and…

Computational Complexity · Computer Science 2020-09-01 Rohit Agrawal
‹ Prev 1 2 3 10 Next ›