中文
相关论文

相关论文: Long Arithmetic Progressions in Critical Sets

200 篇论文

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…

组合数学 · 数学 2024-08-22 Dibyendu De , Pintu Debnath

Let G=SL_n. Let K=Z/pZ, p a prime. Let A\subset G(K) generate G(K). Suppose that |A|<p^{n+1-\delta}, delta>0. Then |A A A|>>|A|^{1+\epsilon}, where epsilon>0 and the implied constant depend only on n and delta.

群论 · 数学 2010-09-13 Nick Gill , Harald Andres Helfgott

In this paper we present some new results about unlike powers in arithmetic progression. We prove among other things that for given $k\geq 4$ and $L\geq 3$ there are only finitely many arithmetic progressions of the form…

数论 · 数学 2007-05-23 N. Bruin , K. Gyory , L. Hajdu , Sz. Tengely

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

数论 · 数学 2019-11-13 Pieter Moree , Min Sha

Suppose that A is a subset of {1,...,N} such that the difference between any two elements of A is never one less than a prime. We show that |A| = O(N exp(-c(log N)^{1/4})) for some absolute c>0.

经典分析与常微分方程 · 数学 2010-04-02 Imre Z. Ruzsa , Tom Sanders

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

数论 · 数学 2024-06-19 Christian Elsholtz , Zach Hunter , Laura Proske , Lisa Sauermann

We show that for each positive integer $a$ there exist only finitely many prime numbers $p$ such that $a$ appears an odd number of times in the period of continued fraction of $\sqrt{p}$ or $\sqrt{2p}$. We also prove that if $p$ is a prime…

数论 · 数学 2023-09-04 Vítězslav Kala , Piotr Miska

We show that the set defined by digit restrictions contains arbitrarily long arithmetic progressions if and only if its Assouad dimension is one. Moreover, we show that for any $0\le s\le 1$, there exists some set on $\mathbb{R}$ with…

经典分析与常微分方程 · 数学 2018-07-03 Jinjun Li , Min Wu , Ying Xiong

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…

经典分析与常微分方程 · 数学 2020-03-04 Robert Fraser

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…

组合数学 · 数学 2024-11-06 Jop Briët , Davi Castro-Silva

Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…

数论 · 数学 2019-05-21 Menny Aka

We improve the lower bound on the number of permutations of {1,2,...,n} in which no 3-term arithmetic progression occurs as a subsequence, and derive lower bounds on the upper and lower densities of subsets of the positive integers that can…

组合数学 · 数学 2010-04-13 Timothy D. LeSaulnier , Sujith Vijay

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

数论 · 数学 2017-05-17 A. J. Irving

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

数论 · 数学 2019-06-14 Luka Rimanic , Julia Wolf

Suppose that $A \subset \{1,\dots, N\}$ has no two elements differing by $p-1$, $p$ prime. Then $|A| \ll N^{1 - c}$.

数论 · 数学 2023-08-24 Ben Green

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…

数论 · 数学 2015-07-10 Ernie Croot , Neil Lyall , Alex Rice

By Maynard's theorem and the subsequent improvements by the Polymath Project, there exists a positive integer $b\leq 246$ such that there are infinitely many primes $p$ such that $p+b$ is also prime. Let $P_1,...,P_t\in \mathbb{Z}[y]$ with…

数论 · 数学 2026-03-24 Andrew Lott , Nagendar Reddy Ponagandla

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…

数论 · 数学 2013-05-31 Sudhir R. Ghorpade , Samrith Ram

Bourgain and Chang recently showed that any subset of $\mathbb{F}_p$ of density $\gg p^{-1/15}$ contains a nontrivial progression $x,x+y,x+y^2$. We answer a question of theirs by proving that if $P_1,P_2\in\mathbb{Z}[y]$ are linearly…

数论 · 数学 2023-01-09 Sarah Peluse

Improving upon the results of Freiman and Candela-Serra-Spiegel, we show that for a non-empty subset $A\subseteq\mathbb F_p$ with $p$ prime and $|A|<0.0045p$, (i) if $|A+A|<2.59|A|-3$ and $|A|>100$, then $A$ is contained in an arithmetic…

数论 · 数学 2019-12-10 Vsevolod F. Lev , Ilya D. Shkredov