Jean-Marc Deshouillers, Vsevolod F. Lev
Improving upon earlier results of Freiman and the present authors, we show that if $p$ is a sufficiently large prime and $A$ is a sum-free subset of the group of order $p$, such that $n:=|A|>0.318p$, then $A$ is contained in a dilation of the interval $[n,p-n]\pmod p$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for fixed $m$ and $a, b$ coprime to $m$, any positive even $n \equiv a + b \bmod m$ outside of a finite exceptional set is expected to be a sum of two primes $p$ and $q$ with $p \equiv a \bmod m$, $q \equiv b \bmod m$. We make conjectures about the growth of these exceptional sets.
On the Mazur--Tate refined conjecture for the anticyclotomic tower at inert primes
本文针对$p\geq5$为惰性素数且椭圆曲线在该处超奇异约化的情形，利用Burungale--Büyükboduk--Lei的结果，证明了虚二次域反圆塔上的弱Mazur--Tate精细猜想。
We derive a refined conjecture for the variance of Gaussian primes across sectors, with a power saving error term, by applying the L-functions Ratios Conjecture. We observe a bifurcation point in the main term, consistent with the Random Matrix Theory (RMT) heuristic previously proposed by Rudnick and Waxman. Our model also identifies a second bifurcation point, undetected by the RMT model, that emerges upon taking into account lower order terms. For sufficiently small sectors, we moreover prove an unconditional result that is consistent with our conjecture down to lower order terms.
Quasi-modularity in MacMahon partition variants and prime detection
本文在 Craig、van Ittersum 和 Ono 的工作基础上，进一步揭示了 MacMahon 分拆函数及其变体的拟模性质，并给出了新的素数检测表达式。
We prove a refinement of the results of Gross and Zagier on prime factorizations of singular moduli.
The reverse Goldbach problem and a refined Zsiflaw--Legeis theorem
本文研究反素数的加法理论，证明了大奇数可以表示为素数与两个反素数之和，以及大奇数可以表示为两个素数与一个反素数之和，并证明几乎所有的偶数可以表示为一个素数与一个反素数之和，同时所有大整数可以表示为一个反素数与一个平方自由数之和。
On refined nonvanishing conjectures by Kurihara and Kolyvagin
本文拓展了Kurihara和Kolyvagin的精细非消失猜想，通过重新表述Iwasawa主猜想并利用Selmer复形行列式，提出新的方法计算Galois上同调中特定元素的p-可除性指数。
In this paper, we use a recent method given by Rudnev, Shakan, and Shkredov (2018) to improve results on sum-product type problems due to Pham and Mojarrad (2018).
We present an elementary inductive proof which Euler could have obtained, for the corresponding result as the title indicates, had he refined a bit his proof for Fermat's assertion on representing primes as two squares.
We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d. We introduce a method to compute upper bounds for g(a_1,a_2,a_3), which seem to grow considerably slower than previously known bounds. Our computations are based on a formula for the restricted partition function, which involves Dedekind-Rademacher sums, and the reciprocity law for these sums.
For $n=1,2,3,\ldots$ let $S_n$ be the sum of the first $n$ primes. We mainly show that the sequence $a_n=\root n\of{S_n/n}\ (n=1,2,3,\ldots)$ is strictly decreasing, and moreover the sequence $a_{n+1}/a_n\ (n=10,11,\ldots)$ is strictly increasing. We also formulate similar conjectures involving twin primes or partitions of integers.
We extend the refined version of the Chabauty-Coleman bound on the number of rational points on a curve of genus g>1 to the case of bad reduction.
Refined Chabauty--Kim computations for the thrice-punctured line over $\mathbb{Z}[1/6]$
针对 $\mathbb{Z}[1/6]$ 上的三穿孔直线，本文构造新的 Coleman 函数并给出精细 Chabauty–Kim 轨迹计算算法，在所有 $p<10{,}000$ 的辅助素数下验证了 Kim 猜想。
Refined sum formulas for finite multiple zeta values of level two
本文针对第二层级有限多重zeta值建立了两类精细求和公式，包括一个显式求和公式和一个Ohno--Zagier型关系，并由此推导出固定权重、深度及特殊高度的求和公式。
We prove upper bounds for the mean square of the remainder in the prime geodesic theorem, for every cofinite Fuchsian group, which improve on average on the best known pointwise bounds. The proof relies on the Selberg trace formula. For the modular group we prove a refined upper bound by using the Kuznetsov trace formula.
Let $p\geq 5$ be a prime number, $\mathbb{F}$ a finite field of characteristic $p$ and let $\barχ$ be the mod-$p$ cyclotomic character. Let $\barρ:\operatorname{G}_{\mathbb{Q}}\rightarrow \operatorname{GL}_2(\mathbb{F})$ be a Galois representation such that the local representation $\barρ_{\restriction \operatorname{G}_{\mathbb{Q}_p}}$ is flat and irreducible. Further, assume that $\operatorname{det}\barρ=\barχ$. The celebrated theorem of Khare and Wintenberger asserts that if $\barρ$ satisfies some natural conditions, there exists a normalized Hecke-eigencuspform $f=\sum_{n\geq 1} a_n q^n$ an…
Congruence obstructions in the refined Koblitz conjecture
本文分类了非CM椭圆曲线的本原同余障碍，证明其仅出现在有限级别，并借助模210伽罗瓦像判定Koblitz–Zywina常数正性，同时在GRH下给出最小素因子的下界。
In this paper we use refined approximations for Chebyshev's $\vartheta$-function to establish new explicit estimates for the prime counting function $π(x)$, which improve the current best estimates for large values of $x$. As an application we find an upper bound for the number $H_0$ which is defined to be the smallest positive integer so that Ramanujan's prime counting inequality holds for every $x \geq H_0$.
We obtain a nontrivial bound for cancellations between the Kloosterman sums modulo a large prime power with a prime argument running over very short interval, which in turn is based on a new estimate on bilinear sums of Kloosterman sums. These results are analogues of those obtained by various authors for Kloosterman sums modulo a prime. However the underlying technique is different and allows us to obtain nontrivial results starting from much shorter ranges.
The main results extend to sums over primes in a short interval earlier estimates by the author for "long" Weyl sums over primes.
If A/K is an abelian variety over a number field and P and Q are rational points, the original support conjecture asserted that if the order of Q (mod p) divides the order of P (mod p) for almost all primes p of K, then Q is obtained from P by applying an endomorphism of A. This is now known to be untrue. In this note we prove that it is not even true modulo the torsion of A.
We obtain the triple correlations for a truncated divisor sum related to primes. We also obtain the mixed correlations for this divisor sum when it is summed over the primes, and give some applications to primes in short intervals.
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
Assuming the Riemann Hypothesis we prove that the interval $[N, N + H]$ contains an integer which is a sum of a prime and two squares of primes provided that $H \ge C (\log N)^{4}$, where $C > 0$ is an effective constant.
We obtain the general k-correlations for a short divisor sum related to primes.
We know that any prime number of form $4s+1$ can be written as a sum of two perfect square numbers. As a consequence of Goldbach's weak conjecture, any number great than $10$ can be represented as a sum of four primes. We are motivated to consider an equation with some constraints about digital sum for the four primes. And we conclude that the square root of the digital sum of the four primes will greater than $4$ and will not be a multiple of $3$ if the equation has solutions. In the proof, we give the method of determining whether a number is a perfect square.
In this paper we prove a weighted sum formula for multiple harmonic sums modulo primes, thereby proving a weighted sum formula for finite multiple zeta values. Our proof utilizes difference equations for the generating series of multiple harmonic sums. We also conjecture several weighted sum formulas of similar flavor for finite multiple zeta values.
We prove two estimates for averages of sums of Kloosterman fractions over primes. The first of these improves previous results of Fouvry-Shparlinski and Baker.
We prove that every integer greater than two may be written as the sum of a prime and a square-free number.
Some explicit results on the sum of a prime and an almost prime
本文受 Rényi 经典结果启发，显式证明了每个不小于 4 的偶数可表示为一个素数与一个至多含 395 个素因子的殆素数之和，并在广义黎曼假设下将素因子数改进到 31。
On sums of two primes and six Fibonacci numbers
该研究运用圆法证明，足够大的正整数可表示为两个素数与六个斐波那契数之和、两个素数与七个卢卡斯数之和，还可表示为两个素数、三个斐波那契数与三个卢卡斯数之和。
Let $f$ be a cuspidal newform and $p \geq 3$ a prime such that the associated $p$-adic Galois representation has large image. We establish a new and refined "Birch and Swinnerton-Dyer type" formula for Bloch-Kato Selmer groups of the central critical twist of $f$ via Kolyvagin derivatives of $L$-values instead of complex analytic or $p$-adic variation of $L$-values only under the Iwasawa main conjecture localized at the augmentation ideal. Our formula determines the exact rank and module structure of the Selmer groups and is insensitive to weight, the local behavior of $f$ at $p$, and analytic…
We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.
In this paper we establish a general asymptotic formula for the sum of the first $n$ prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin. Further we prove a series of results concerning Mandl's inequality on the sum of the first $n$ prime numbers. We use these results to find new explicit estimates for the sum of the first $n$ prime numbers, which improve the currently best known estimates.
In this paper we establish a general asymptotic formula for the sum of the first n prime numbers, which leads to a generalization of the most accurate asymptotic formula given by Massias and Robin in 1996.
We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).
We show that the set of the numbers that are the sum of a prime and a Fibonacci number has positive lower asymptotic density.
We obtain a simple relations for the Newman sum over multiples of a prime with a primitive or semiprimitive root 2. We consider the case of p=17 as well.
An asymptotic formula for the sum of the first n primes is derived. This result improves the previous results of P. Dusart. Using this asymptotic expansion, we prove the conjectures of R. Mandl and G. Robin on the upper and the lower bound of the sum of the first n primes respectively.
We prove explicit upper bounds for weighted sums over prime numbers in arithmetic progressions with slowly varying weight functions. The results generalize the well-known Brun-Titchmarsh inequality.
The congruences for Jacobi sums of some lower orders has been treated by many authors in the literature. In this paper we establish the congruences for Jacobi sums of order 2l^2 with odd prime l. These congruences are useful to obtain algebraic and arithmetic characterizations for Jacobi sums of order 2l^2 .
The set of integers which can be written as the sum of four prime cubes has lower density at least $0.009664$. This improves earlier bounds of $0.003125$ by Ren and $0.005776$ by Liu.
We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.
It is known that the sum of the reciprocal of integers, $\sum_n (1/n)$, and the sum of the reciprocal of primes, $\sum_n (1/p_n)$, both diverge. Here, we study a series made from primes that sums exactly to 1. We also show this sum is simply related to an infinite product over primes. We then generalize the form of the series (and its related product), extending this idea to other number theoretic sets such as twin primes. Evaluating a product made from twin primes gives a new mathematical constant.
In this paper, we prove some extensions of recent results given by Shkredov and Shparlinski on multiple character sums for some general families of polynomials over prime fields. The energies of polynomials in two and three variables are our main ingredients.
Bounds for moments of quadratic Dirichlet character sums of prime moduli
本文在广义黎曼假设下，先对模8p的二次Dirichlet L-函数平移矩建立精确上界，再据此证明素数模二次Dirichlet特征和矩的界。
If n is a positive integer, let h(n) denote the maximal value of the product of distinct primes whose sum does not exceed n. We give some properties of this function h and describe an algorithm able to compute h(n) for large values of n.
A Density Theorem for Higher Order Sums of Prime Numbers
该研究证明下密度严格大于1/2的素数子集可表所有充分大偶数为其4个素数之和，还推广到k≥4个加项及k≥4个不同素数子集的情形，以初等组合引理为核心新贡献，延伸了此前的两、三素数和相关研究。
Almost primes and primes that are sums of two squares plus 1
该研究用向量筛框架（含半线性筛、线性筛）得出满足p-1为两平方和且p+2素因子个数有界的素数p≤x的下界。
We will generalize the combinatorial algorithms for computing $π(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.
For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where $\text{Kl}_2(p;q)$ denotes a normalised Kloosterman sum with modulus $q$. This is a sparse analogue of a recent theorem due to Blomer, Fouvry, Kowalski, Michel and Milićević showing cancellation amongst sums of Kloosterman sums over primes in short intervals. We use an optimisation argument inspired by Fouvry, Kowalski and Michel. Our argument compares three different bo…
A sharp asymptotic formula for the sum of reciprocals of $π(n)$ is derived, where $π(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivić and L. Panaitopol.
Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best possible.
A Positive Lower Bound for the Sum of Log-Reciprocal Twin Prime Products via Weighted Sieve
本文通过改进加权筛法，证明了孪生素数乘积对数倒数之和的正下界，从而推导出孪生素数对的无限性。
Computational results on sums of a prime with squares or cubes
本文通过计算验证了素数加两个平方数或立方数的表示猜想，证明了特定范围内所有整数均可表示，并利用椭圆曲线整点方法实现。
Refined applications of Kato's Euler systems for modular forms
本文探讨了Kato欧拉系统在高权模形式中的精细应用，证明了Mazur-Tate猜想并给出岩泽主猜想的新解释，同时涉及对BSD猜想的应用。
In this paper, I proved that $$N=p_1+p_2+2p_3, p_1\sim N/2, p_2\sim N/2, p_3=o(N),$$ where $N$ is a large even number, and $p_i\ (i=1,2,3)$ are odd primes.
We apply the methods of Fukaya, Kato and Sharifi to refine Mazur's study of the Eisenstein ideal. Given prime numbers $N$ and $p\geq 5$ such that $p\mid φ(N)$, we study the quotient of the cohomology group of modular curve $X_{0}(N)$ by the square of the Eisenstein ideal. We study two invariants $b,c$ attached to this quotient and compute $c$. We propose a conjecture about the invariant $b$ which relates the structure of the ray class group of conductor $N$ to the modular symbols of $X_{0}(N)$. Assuming this conjecture, We compute the invariant $b$.
We develop a new method for studying sums of Kloosterman sums related to the spectral exponential sum. As a corollary, we obtain a new proof of the estimate of Soundararajan and Young for the error term in the prime geodesic theorem.
We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{π^2}{12} \frac{x^2}{\log x},$$ which holds as well for the function sopf$(n)$ (OEIS A008472) that just gives the sum of distinct prime factors of $n$. This asymptotic formula was already stated by R. Jakimcyuk \cite{rj12} which was brought to our attention after the completion of the first version of this manuscript.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。