English
Related papers

Related papers: Helson's conjecture for smooth numbers

200 papers

Let $X^N$ be a family of $N\times N$ independent GUE random matrices, $Z^N$ a family of deterministic matrices, $P$ a self-adjoint non-commutative polynomial, that is for any $N$, $P(X^N)$ is self-adjoint, $f$ a smooth function. We prove…

Probability · Mathematics 2022-12-08 Felix Parraud

Let $P^+(n)$ denote the largest prime factor of the integer $n$ and $P_y^+(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$. In this paper, firstly we show that the triple consecutive integers with the two…

Number Theory · Mathematics 2018-04-11 Zhiwei Wang

The general Poisson summation formula of harmonic analysis and analytic number theory can be regarded as a quadrature formula with remainder. The purpose of this investigation is to give estimates for this remainder based on the classical…

Numerical Analysis · Mathematics 2016-05-05 Paul L. Butzer , Gerhard Schmeisser , Rudolf L. Stens

We provide an asymptotic estimate for certain sums over k-free integers with small prime factors. These sums depend upon a complex parameter \alpha and involve a smooth cut-off f. They are a variation of several classical number-theoretical…

Number Theory · Mathematics 2013-10-07 Francesco Cellarosi

Let $E$ be an elliptic curve defined over $\mathbb{Q}$ and without complex multiplication. For a prime $p$ of good reduction for $E$, we write $\#E_p(\mathbb{F}_p) = p + 1 - a_p(E)$ for the number of $\mathbb{F}_p$-rational points of the…

Number Theory · Mathematics 2022-07-19 Alina Carmen Cojocaru , McKinley Meyer

Let $S = \{p_1,\dots,p_r\}$ be a finite set of distinct primes, let $\Psi_S(X)$ be the number of $S$-smooth integers not exceeding $X$, and let $F_S(X)$ be the maximum size of a subset of $M(S) \cap [1,X]$ containing no set $\{n,p_1…

Number Theory · Mathematics 2026-04-20 Nikola Veselinov

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).…

Number Theory · Mathematics 2019-03-11 Marc Munsch , Igor E. Shparlinski , Kam Hung Yau

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…

Number Theory · Mathematics 2019-05-02 Kam Hung Yau

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

Number Theory · Mathematics 2013-01-08 William D. Banks , Greg Martin

We show that both primes and smooth numbers are equidistributed in arithmetic progressions to moduli up to $x^{5/8 - o(1)}$, using triply-well-factorable weights for the primes (we also get improvements for the well-factorable linear sieve…

Number Theory · Mathematics 2025-07-01 Alexandru Pascadi

We obtain new mean value theorems for exponential sums with very smooth numbers, which provide a power saving against the trivial bound in region where previous bounds do not apply.

Number Theory · Mathematics 2025-06-30 F. Majeed , Igor E. Shparlinski

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of…

Number Theory · Mathematics 2025-12-19 Petr Kucheriaviy

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

Number Theory · Mathematics 2021-02-10 Sungjin Kim

This paper is motivated by the following question in sieve theory. Given a subset $X\subset [N]$ and $\alpha\in (0,1/2)$. Suppose that $|X\pmod p|\leq (\alpha+o(1))p$ for every prime $p$. How large can $X$ be? On the one hand, we have the…

Number Theory · Mathematics 2014-09-26 Xuancheng Shao

We have developed a heuristic showing that in the Dirichlet divisor problem for the almost all $n \in \mathbb{N}^{+}$: $$ R(n) \leq O(\psi(n)n^{\frac{1}{4}}) $$ where $$ R(n) = \Big\lvert \sum_{x=1}^{n}\Big\lfloor\frac{n}{x}\Big\rfloor -…

Number Theory · Mathematics 2021-10-04 Dmitry S. Pyatin

A well-known conjecture in analytic number theory states that for every pair of sets $X,Y\subset\mathbb{Z}/p\mathbb{Z}$, each of size at least $\log ^C p$ (for some constant $C$) we have that the number of pairs $(x,y)\in X\times Y$ such…

Combinatorics · Mathematics 2015-12-18 Rudi Mrazović

We prove a conjecture of Teissier asserting that if $f$ has an isolated singularity at $P$ and $H$ is a smooth hypersurface through $P$, then $\widetilde{\alpha}_P(f)\geq \widetilde{\alpha}_P(f\vert_H)+\frac{1}{\theta_P(f)+1}$, where…

Algebraic Geometry · Mathematics 2021-12-24 Bradley Dirks , Mircea Mustata

An asymptotic formula for the number of $n \le x$ such that $n$ does not divide $P(n)!$ is given, where P(n) is the largest prime factor of $n$.

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić

For $X(n)$ a Rademacher or Steinhaus random multiplicative function, we consider the random polynomials $$ P_N(\theta) = \frac1{\sqrt{N}} \sum_{n\leq N} X(n) e(n\theta), $$ and show that the $2k$-th moments on the unit circle $$ \int_0^1…

Number Theory · Mathematics 2023-11-23 Jacques Benatar , Alon Nishry , Brad Rodgers