Oriol Serra, Gilles Zémor
We prove that there is a small but fixed positive integer e such that for every prime larger than a fixed integer, every subset S of the integers modulo p which satisfies |2S|<(2+e)|S| and 2(|2S|)-2|S|+2 < p is contained in an arithmetic progression of length |2S|-|S|+1. This is the first result of this nature which places no unnecessary restrictions on the size of S.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We consider the reduction of an elliptic curve defined over the rational numbers modulo primes in a given arithmetic progression and investigate how often the subgroup of rational points of this reduced curve is cyclic as a special case of Serre's Cyclicity Conjecture.
Let $f(x)$ be a nonconstant polynomial with integer coefficients and nonzero discriminant. We study the distribution modulo primes of the set of squarefree integers $d$ such that the curve $dy^2=f(x)$ has a nontrivial rational or integral point.
We study the average value of the divisor function $τ(n)$ for $n\le x$ with $n \equiv a \bmod q$. The divisor function is known to be evenly distributed over arithmetic progressions for all $q$ that are a little smaller than $x^{2/3}$. We show how to go past this barrier when $q=p^k$ for odd primes $p$ and any fixed integer $k\ge 7$.
We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In particular, we break the classical barrier $q \le x^{2/3}$ for such formulas, and generalise a recent result of R.~Khan (2015), making it uniform in $k$.
This paper has been withdrawn by the author due to an error in the proof of Theorem 6.
Rankin--Selberg coefficients in arithmetic progressions modulo prime powers
研究模素数幂的Rankin-Selberg系数分布，基于Ramanujan-Petersson猜想，证明系数具有特定分布水平。
Cyclicity and exponent of elliptic curves modulo $p$ in arithmetic progressions
本文研究算术级数中素数上椭圆曲线约化群的循环性与平均指数，证明 CM 情形的无条件渐近式并改进相关条件估计。
Koksma's equidistribution theorem from 1935 states that for Lebesgue almost every $α>1$, the fractional parts of the geometric progression $(α^{n})_{n\geq1}$ are equidistributed modulo one. In the present paper we sharpen this result by showing that for almost every $α>1$, the correlations of all finite orders and hence the normalized gaps of $(α^{n})_{n\geq1}$ mod 1 have a Poissonian limit distribution, thereby resolving a conjecture of the two first named authors. While an earlier approach used probabilistic methods in the form of martingale approximation, our reasoning in the present paper …
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 equal, and A + A must contain an arithmetic progression or a coset of a subgroup, either of which of size at least exp^[ c (log |A|)^{delta} ]. This extends analogous results obtained by Sanders and, respectively, by Croot, Laba and Sisask in the case where the group is that of the integers or a finite field.
We prove that there exists an absolute constant $c>0$ such that if an arithmetic progression $\cP$ modulo a prime number $p$ does not contain zero and has the cardinality less than $cp$, then it can not be represented as a product of two subsets of cardinality greater than 1, unless $\cP=-\cP$ or $\cP=\{-2r,r,4r\}$ for some residue $r$ modulo $p$.
Doubling modulo odd integers, generalizations, and unexpected occurrences
本文直接证明了奇数模加倍映射循环数的等式，并推广到乘以任意整数k的置换，同时综述了该映射在数学及洗牌、杂耍、音乐等领域的多种应用。
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 progression of size $|A+A|-|A|+1$, and (ii) if $|A-A|<2.6|A|-3$, then $A$ is contained in an arithmetic progression of size $|A-A|-|A|+1$. The improvement comes from using the properties of higher energies.
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992). We also estimate the smallest squarefull number in almost all residue classes modulo a prime $p$.
In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a subset of the field of residue classes modulo $p$ having small multiplicative doubling. We then use this estimate to show that the number of solutions of the congruence $$ x^n\equiv λ\pmod p; \quad x\in \N, \quad L<x<L+p/n, $$ is at most $p^{\frac{1}{3}-c}$ uniformly over positive integers $n, λ$ and $L$, for some absolute constant $c>0$. This implies, in part…
For $δ>0$ sufficiently small and $A\subset \mathbb{Z}^k$ with $|A+A|\le (2^k+δ)|A|$, we show either $A$ is covered by $m_k(δ)$ parallel hyperplanes, or satisfies $|\widehat{\operatorname{co}}(A)\setminus A|\le c_kδ|A|$, where $\widehat{\operatorname{co}}(A)$ is the smallest convex progression (convex set intersected with a sublattice) containing $A$. This generalizes the Freiman-Bilu $2^k$ theorem, Freiman's $3|A|-4$ theorem, and recent sharp stability results of the present authors for sumsets in $\mathbb{R}^k$ conjectured by Figalli and Jerison.
We prove that, if $x$ and $q\leqslant x^{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x^{1/3}$, that is congruent to $a$ modulo $q$.
Joint distributions of error terms for primes in arithmetic progressions modulo 11
本文给出了素数计数函数误差项联合分布的对数密度公式，并应用于模11情形，确定了残差对的相关性，深化了对Bays和Hudson现象的数学理解。
Sums of the singular series constants that appear in the Hardy--Littlewood $k$-tuples conjectures have long been studied in connection to the distribution of primes. We study constrained sums of singular series, where the sum is taken over sets whose elements are specified modulo $r$ or weighted by smooth functions. We show that the value of the sum is governed by incidences modulo $r$ of elements of the set in the case of arithmetic progressions and by pairings of the smooth functions in the case of weights. These sums shed light on sums of singular series in other formats.
In this paper, we obtain explicit formulas for the second moments for Hurwitz class numbers $H(4n-t^2)$ with $t$ running through a fixed congruence class modulo $3$.
Given a density t in (0,1], and a prime p, let S be any subset of F_p having at least tp elements, and having the least number of three-term arithmetic progressions mod p among all subsets of F_p with at least tp elements. Define N(t,p) to be 1/p^2 times the number of three-term arithmetic progressions in S modulo p. Note that N(t,p) does not depend on S -- it only depends on t and p. An old result of Varnavides shows that for fixed t, N(t,p) > c(t) > 0 for all primes p sufficiently large. But, does N(t,p) converge to a limit as p -> infinity? We prove that it does.
Let a be an integer and q a prime number. In this paper, we find an asymptotic formula for the number of positive integers n < x with the property that no divisor d > 1 of n lies in the arithmetic progression a modulo q.
We consider weighted averages of the number of representations of an even integer as a sum of two prime numbers, where each summand lies in a given arithmetic progression modulo a common integer $q$. Our result is uniform in a suitable range for $q$.
We determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-ε)|A|$, $ε>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than $ε^{-1}$ cosets of a finite subgroup. The bounds $3(1-ε)|A|$ and $ε^{-1}$ are best possible in the sense that none of them can be relaxed without tightened another one, and the estimate obtained for the size of the coset progression containing $A$ is sharp. In the case where the underlying group is infinite cyclic, our result reduces to the well-known Freiman's $(3n-3)$-…
On the acyclicity of reductions of elliptic curves modulo primes in arithmetic progressions
本文研究椭圆曲线模素数约化群的循环性，刻画了使同余于 $a\bmod n$ 的几乎所有素数对应约化群均非循环的等差数列，并回答了 Akbal 与 Güloğlu 的问题。
For any $ε>0$, there exists $q_0(ε)$ such for any $q\ge q_0(ε)$ and any invertible residue class $a$ modulo $q$, there exists a natural number that is congruent to $a$ modulo $q$ and that is the product of exactly three primes, all of which are below $q^{\frac{3}{2}+ε}$. If we restrict our attention to odd moduli $q$ that do not have prime factors congruent to 1 mod 4, we can find such primes below $q^{\frac{11}{8}+ε}$. If we further restrict our set of moduli to prime $q$ that are such that $(q-1,4\cdot7\cdot11\cdot17\cdot23\cdot29)=2$, we can find such primes below $q^{\frac{6}{5}+ε}$. Final…
We prove that for a positive integer $k$ the primes in certain kinds of intervals can not distribute too 'uniformly' among the reduced residue classes modulo $k$. Hereby, we prove a generalization of a conjecture of Recaman and establish our results in a much more general situation, in particular for prime ideals in number fields.
Refinements for primes in short arithmetic progressions
本文在假设零空域和平均零密度估计的基础上，改进了所有和几乎所有短算术等差数列中的素数定理误差项，特别是在Generalized Density Hypothesis假设下，对素数在特定区间内的分布进行了更精确的描述。
We prove upper bounds for the error term of the distribution of squarefree numbers up to $X$ in arithmetic progressions modulo $q$ making progress towards two well-known conjectures concerning this distribution and improving upon earlier results by Hooley. We make use of recent estimates for short exponential sums by Bourgain-Garaev and for exponential sums twisted by the Möbius function by Bourgain and Fouvry-Kowalski-Michel.
Alternating geometric progressions modulo one and Sturmian words
研究了模一的交替几何级数中，通过斯特姆词描述所有无理数ξ，使得序列(ξ(-b)^n)的像包含在长度为b^{-1}+b^{-2}-b^{-3}的区间内。
On some arithmetic conditions of recurrent sequences modulo prime p
研究K-斐波那契序列模素数p，估计集合和与积的基数，并提出估计m维递归集合加倍常数的方法。
Two dimensional arithmetic progressions avoiding squares
研究了二维算术进展中避免非零平方数的结构，证明其元素数量上限，并讨论了相关下界及与素数二次非剩余下界的关系。
Uniformly for small $q$ and $(a,q)=1$, we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to $a$ modulo $q$ and a square-free integer. Our method is based on the notion of local model developed by Ramaré and may be viewed as an abstract circle method.
Let $ξ$ and $m$ be integers satisfying $ξ\ne 0$ and $m\ge 3$. We show that for any given integers $a$ and $b$, $b \neq 0$, there are $\frac{φ(m)}{2}$ reduced residue classes modulo $m$ each containing infinitely many primes $p$ such that $a-bF_p(ξ) \ne 0$, where $F_p(ξ)=\sum_{n=0}^\infty n!ξ^n$ is the $p$-adic evaluation of Euler's factorial series at the point $ξ$.
Motivated by a question of Lovejoy \cite{lovejoy}, we show that three-colored Frobenius partition function $\c3$ and related arithmetic fuction $\cc3$ vanish modulo some powers of 5 in certain arithmetic progressions.
If we want to represent integers in base $m$, we need a set $A$ of digits, which needs to be a complete set of residues modulo $m$. When adding two integers with last digits $a_1, a_2 \in A$, we find the unique $a \in A$ such that $a_1 + a_2 \equiv a$ mod $m$, and call $(a_1 + a_2 -a)/m$ the carry. Carries occur also when addition is done modulo $m^2$, with $A$ chosen as a set of coset representatives for the cyclic group $\mathbb{Z}/m \mathbb{Z} \subseteq \mathbb{Z}/m^2\mathbb{Z}$. It is a natural to look for sets $A$ which minimize the number of different carries. In a recent paper, Diaconis…
We show that, in a restricted range, the divisor function of integers in residue classes modulo a prime follows a Gaussian distribution, and a similar result for Hecke eigenvalues of classical holomorphic cusp forms. Furthermore, we obtain the joint distribution of these arithmetic functions in two related residue classes. These results follow from asymptotic evaluations of the relevant moments, and depend crucially on results on the independence of monodromy groups related to products of Kloosterman sums.
Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a natural density. In this note this density is explicitly evaluated with an Euler product as result.
We give a comprehensive description of the sets $A$ in finite cyclic groups such that $|2A|<\frac94|A|$; namely, we show that any set with this property is densely contained in a (one-dimensional) coset progression. This improves earlier results of Deshouillers-Freiman and Balasubramanian-Pandey.
A new result on the divisor problem in arithmetic progressions modulo a prime power
本文在素数幂模数的算术级数中推导除数函数的渐近公式，通过改进参数突破经典的3/4障碍，扩展了模数范围，优于Liu等和Wu等的结果。
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+δ)t\mathbb{E}_x 1_A(a)$ is very close to an arithmetic progression. Here $p$ stands for a large prime and $δ,t$ are small real numbers. This shows that the Vosper theorem is stable in the case of a single set.
We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $α, β\le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^α$ are primes and $s \le m^β$ is a product of at most $\ell$ primes, represent all reduced residue classes modulo $m$. This is a relaxed version of the still open question of P. Erdos, A. M. Odlyzko and A. Sarkozy (1987), that corresponds to $k = \ell =1$ (that is, to products of two primes). In particular, we improve recent results of A. Walker (2016).
On $7^k$-regular partitions modulo powers of $7$
本研究探讨了无部分能被 $7^k$ 整除的分拆函数 $b_{7^k}(n)$ 的算术性质，通过构造生成函数，确立了一系列 Ramanujan 型同余。
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 positive natural density subset of primes $p$ not having $g$ as a $t$-near primitive root and prove a more difficult variant.
In this work we introduce the numerical constant, LOPI, N LOPI is congruent to LOPI mod 18, equal to the lowest odd partition identity in conjunction with the reduced residue system Modulo 18, a complete disjoint covering residue system when considered in its whole set of residues from 0 to 17. By convolution of specific LOPI Dirichlet linear progressions for each LOPI superset, the non-prime elements of the 6 reduced residue congruence classes mod 18 are generated sequentially and uniquely. Through set generation and complete composite number subset generation based on the pattern of sequenti…
Triple divisor type functions in arithmetic progressions to prime power moduli
本文研究非尖点GL_3自守形式Hecke特征值在素数幂模算术级数中的等分布，利用Kowalski-Lin-Michel和Milićević技术证明指数1/2+7/458-ε可取。
We study the average error term in the usual approximation to the number of $y$-friable integers congruent to $a$ modulo $q$, where $a\neq 0$ is a fixed integer. We show that in the range $\exp\{(\log\log x)^{5/3+\varepsilon}\} \leq y \leq x$ and on average over $q\leq x/M$ with $M\rightarrow \infty$ of moderate size, this average error term is asymptotic to $-|a|Ψ(x/|a|,y)/2x$. Previous results of this sort were obtained by the second author for reasonably dense sequences, however the sequence of $y$-friable integers studied in the current paper is thin, and required the use of different tech…
Conguences for Odd Unimodal Sequences and a Problem of Bringmann And Lovejoy
本文给出奇单峰与奇强单峰序列个数可被2、4整除的算术级数，解答了Bringmann和Lovejoy关于模4的奇强单峰序列对应算术级数存在性的问题。
A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to Sylvester's sequence, Giuga numbers, Znám's problem, the inheritance problem, and Curtiss's bound on solutions of a unit fraction equation. Here we show $K \equiv 6 \pmod{6^2}$ if $6\mid K$, and uncover a remarkable $7$-term arithmetic progression of residues modulo $6^2\cdot8$ in the sequence of known PPNs. On that basis, we pose a conjecture which leads to a cond…
Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression
本文提出一种Fourier优化框架，在GRH假设下改进了估计模素数的最小二次非剩余和算术级数中最小素数这两个数论经典问题的渐近界。
Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i {a term of} W,\, w_i\neq w_j{for} i\neq j\},$$ which is a particular kind of weighted restricted sumset. We show that $|W\odot S|\geq \min\{|G|-1,\,n\}$, that $W\odot S=G$ if $n\geq |G|+1$, and also characterize all sequences $S$ of length $|G|$ with $W\odot S\neq G$. This result then allows us to characterize when a linear equation $$a_1x_1+...+a_rx_r\equiv …
Let $a\geq 1, b\geq 0$ and $k\geq 2$ be any given integers. It has been proven that there exist infinitely many natural numbers $m$ such that sum of divisors of $m$ is a perfect $k$th power. We try to generalize this result when the values of $m$ belong to any given infinite arithmetic progression $an+b$. We prove if $a$ is relatively prime to $b$ and order of $b$ modulo $a$ is relatively prime to $k$ then there exist infinitely many natural numbers $n$ such that sum of divisors of $an+b$ is a perfect $k$th power. We also prove that, in general, either sum of divisors of $an+b$ is not a perfec…
We show that the multiple divisor functions of integers in invertible residue classes modulo a prime number, as well as the Fourier coefficients of GL(N) Maass cusp forms for all N larger than 2, satisfy a central limit theorem in a suitable range, generalizing the case N=2 treated by E. Fouvry, S. Ganguly, E. Kowalski and P. Michel. Such universal Gaussian behaviour relies on a deep equidistribution result of products of hyper-Kloosterman sums.
Improved Averaged Distribution of $d_3(n)$ in Prime Arithmetic Progressions
研究改进了在素数等差数列中$d_3(n)$的分布指数，利用Petrow-Young子凸性界将分布指数从2/3提升至8/11。
An inverse theorem on sets with rich additive structure modulo primes
本文研究了模素数下具有丰富加法结构集合的反向定理，证明了相关结构结果并改进了较大筛法界。
A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$ and for families of structured sets called chains. In this paper we extend the formula to sets of every dimension and prove it for sets composed of three segments, giving structural results for the extremal case. A weaker extension to sets composed of a bounded number of segments is also discussed.
We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) …
Assuming the generalized Riemann hypothesis, we give asymptotic bounds on the size of intervals that contain primes from a given arithmetic progression using the approach developed by Carneiro, Milinovich and Soundararajan [Comment. Math. Helv. 94, no. 3 (2019)]. For this we extend the Guinand-Weil explicit formula over all Dirichlet characters modulo $q \geq 3$, and we reduce the associated extremal problems to convex optimization problems that can be solved numerically via semidefinite programming.
In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes p<x that are congruent to a modulo d, for d^(1+delta)<x, is about pi(x)/phi(d). More precisely, we prove: Let 1\leq m<k be integers, let q be a prime power, and let f be a monic polynomial of degree k with coefficients in the finite field with q elements. Then there is a constant c(k) such that the number N of prime polynomials g=f+h with deg h \leq m satisfi…
A. Booker and C. Pomerance (2017) have shown that any residue class modulo a prime $p\ge 11$ can be represented by a positive $p$-smooth square-free integer $s = p^{O(\log p)}$ with all prime factors up to $p$ and conjectured that in fact one can find such $s$ with $s = p^{O(1)}$. Using bounds on double Kloosterman sums due to M. Z. Garaev (2010) we prove this conjecture in a stronger form $s \le p^{3/2 + o(1)}$ and also consider more general versions of this question replacing $p$-smoothness of $s$ by the stronger condition of $p^α$-smoothness. Using bounds on multiplicative character sums an…
The problem of looking for subsets of the natural numbers which contain no 3-term arithmetic progressions has a rich history. Roth's theorem famously shows that any such subset cannot have positive upper density. In contrast, Rankin in 1960 suggested looking at subsets without three-term geometric progressions, and constructed such a subset with density about 0.719. More recently, several authors have found upper bounds for the upper density of such sets. We significantly improve upon these bounds, and demonstrate a method of constructing sets with a greater upper density than Rankin's set. Th…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。