English
Related papers

Related papers: Arithmetic progressions in multiplicative groups o…

200 papers

Let G=SL_3(Z/pZ), p a prime. Let A be a set of generators of G. Then A grows under the group operation. To be precise: denote by |S| the number of elements of a finite set S. Assume |A| < |G|^{1-\epsilon} for some \epsilon>0. Then |A\cdot…

Group Theory · Mathematics 2009-06-08 H. A. Helfgott

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

Dynamical Systems · Mathematics 2025-01-10 Hanfeng Li , Klaus Schmidt

We show that there exists a positive constant C such that the following holds: Given an infinite arithmetic progression A of real numbers and a sufficiently large integer n (depending on A), there needs at least Cn geometric progressions to…

Number Theory · Mathematics 2014-09-18 Carlo Sanna

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

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

Number Theory · Mathematics 2020-10-14 William D. Banks

Let $F_p$ be the field of a prime order $p$. Then for any positive integer $n>1$, for any $\epsilon>0$, and for any subset $A$ of $F_p$, every element of $F_p$ can be represented as a sum of $N$ elements, each of them is a product of $n$…

Number Theory · Mathematics 2007-05-23 A. A. Glibichuk , S. V. Konyagin

We solve the enumeration of the set $\textrm{AP}(n)$ of partitions of a positive integer $n$ in which the nondecreasing sequence of parts forms an arithmetic progression. In particular, we establish a formula for the number of nondecreasing…

Number Theory · Mathematics 2022-06-13 F. Javier de Vega

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

Number Theory · Mathematics 2021-01-22 Matteo Bordignon

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

Number Theory · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

We prove that every set $A\subset\mathbb{Z}/p\mathbb{Z}$ with $\mathbb{E}_x\min(1_A*1_A(x),t)\le(2+\delta)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $\delta,t$ are small real…

Combinatorics · Mathematics 2015-06-02 Przemysław Mazur

Let $p\geq 5$ be a prime number. Let $\mathsf{E}/\mathbb{Q}$ be an elliptic curve with good ordinary reduction at $p$. Let $K$ be an imaginary quadratic field where $p$ splits, and such that the generalized Heegner hypothesis holds. Under…

Number Theory · Mathematics 2025-04-16 Debanjana Kundu , Antonio Lei

H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…

Combinatorics · Mathematics 2024-08-22 Dibyendu De , Pintu Debnath

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

Number Theory · Mathematics 2010-04-08 Janos Pintz

One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…

Number Theory · Mathematics 2025-09-30 Sarah Peluse

If $a$ and $b$ are integers with $b>a>1$, we completely characterize ``long'' arithmetic progressions in the sumsets of the geometric progressions $1, a, a^2, a^3, \ldots$ and $1, b, b^2, b^3, \ldots$. Our proofs utilize recent applications…

Number Theory · Mathematics 2025-12-04 Michael A. Bennett

Pillai showed that any sequence of consecutive integers with at most 16 terms possesses one term that is relatively prime to all the others. We give a new proof of a slight generalization of this result to arithmetic progressions of…

Number Theory · Mathematics 2013-05-31 Sudhir R. Ghorpade , Samrith Ram

We consider the multiplicative structure of sets of the form AA+1, where where A is a large, finite set of real numbers. In particular, we show that the additively shifted product set, AA+1 must have a large part outside of any generalized…

Combinatorics · Mathematics 2012-05-23 Steven Senger

We explicitly present expansions of the complex field which are models of the theories of green points in the multiplicative group case and in the case of an elliptic curve without complex multiplication defined over $\mathbb{R}$. In fact,…

Logic · Mathematics 2014-01-15 Juan Diego Caycedo , Boris Zilber

The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…

Combinatorics · Mathematics 2021-07-01 Borys Kuca

We define a sequence of functions, namely tame cuts, in the Fourier algebra $A(G)$ of a locally compact group $G$, that satisfies certain convergence and growth conditions. This new consideration allows us to give a group admitting a…

Functional Analysis · Mathematics 2021-10-28 Bat-Od Battseren