English
Related papers

Related papers: On two conjectures concerning squarefree numbers i…

200 papers

We give asymptotic formulas for some average values of the Euler function on shifted smooth numbers. The result is based on various estimates on the distribution of smooth numbers in arithmetic progressions which are due to A. Granville and…

Number Theory · Mathematics 2008-10-08 Stefanie S. Loiperdinger , Igor E. Shparlinski

Let $n \geq 1$ be a squarefree integer, and let $M$, $A$ be two groups of order $n$. Using our previous results on the enumeration of Hopf-Galois structures on Galois extensions of fields of squarefree degree, we determine the number of…

Rings and Algebras · Mathematics 2019-10-22 Ali A. Alabdali , Nigel P. Byott

We obtain several asymptotic formulas for the sum of the divisor function $\tau(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…

Number Theory · Mathematics 2018-11-26 Bryce Kerr , Igor E. Shparlinski

We study mod-$\varphi$ convergence of several probability distributions on the set of positive integers that involve Stirling numbers of both kinds and, as a consequence, derive various limit theorems for these distributions. We also derive…

Probability · Mathematics 2023-01-18 Zakhar Kabluchko , Alexander Marynych , Helmut Pitters

Consider the Fourier expansions of two elements of a given space of modular forms. How many leading coefficients must agree in order to guarantee that the two expansions are the same? Sturm gave an upper bound for modular forms of a given…

Number Theory · Mathematics 2013-04-09 Sam Chow , Alexandru Ghitza

Assuming the Riemann Hypothesis, we derive explicit bounds for the error terms in short interval analogues of the prime number theorem and Mertens' theorems using a smoothing argument. Our results improve upon previous bounds in both…

Number Theory · Mathematics 2025-10-30 Ethan Simpson Lee

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…

Number Theory · Mathematics 2015-06-11 Régis de la Bretèche , Daniel Fiorilli

We obtained the probabilities for the values of the M\"obius function for arbitrary numbers and found that the asymptotic densities of the squarefree integers among the odd and even numbers are $8/\pi^2$ and $4/\pi^2$, respectively. It is…

General Mathematics · Mathematics 2010-02-09 R. M. Abrarov , S. M. Abrarov

Using Katz's equidistribution framework, we show that for any squarefree polynomial $f \in \mathbb{F}_q[t]$ of degree $n \ge 2$, every residue class modulo $f$ can be represented as a product of two monic irreducible polynomials of degree…

Number Theory · Mathematics 2025-11-11 Likun Xie

Gau\ss (1823) proved a sharp upper bound on the probability that a random variable falls outside a symmetric interval around zero when its distribution is unimodal with mode at zero. For the class of all distributions with mean at zero,…

Probability · Mathematics 2022-10-11 Roxana A. Ion , Chris A. J. Klaassen , Edwin R. van den Heuvel

A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…

Numerical Analysis · Mathematics 2008-10-16 Marco Caminati

A positive integer n is called r-free if n is not divisible by the r-th power of a prime. Generalizing earlier work of Orr, we provide an upper bound of Bombieri-Vinogradov type for the r-free numbers in arithmetic progressions.

Number Theory · Mathematics 2013-09-27 Jason Gibson

We develop a general method for lower bounding the variance of sequences in arithmetic progressions mod $q$, summed over all $q \leq Q$, building on previous work of Liu, Perelli, Hooley, and others. The proofs lower bound the variance by…

Number Theory · Mathematics 2016-02-08 Adam J. Harper , Kannan Soundararajan

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

Number Theory · Mathematics 2016-01-27 Nikos Frantzikinakis , Bernard Host

We attempt to investigate a two-dimensional Gauss-Kuzmin theorem for R\'enyi-type continued fraction expansions. More precisely speaking, our focus is to obtain specific lower and upper bounds for the error term considered which imply the…

Number Theory · Mathematics 2020-04-13 Gabriela Ileana Sebe , Dan Lascu

We revisit a recent bound of I. Shparlinski and T. P. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to…

Number Theory · Mathematics 2020-04-28 Valentin Blomer , Étienne Fouvry , Emmanuel Kowalski , Philippe Michel , Djordje Milićević

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

Number Theory · Mathematics 2022-06-15 Marco Aymone , Caio Bueno , Kevin Medeiros

We present a limit theorem describing the behavior of a probabilistic model for square-free numbers. The limiting distribution has a density that comes from the Dickman-De Bruijn function and is constant on the interval $[0,1]$. We also…

Probability · Mathematics 2010-10-18 Francesco Cellarosi , Yakov G. Sinai

We study a multiplicative function analogue of Linnik's problem on the least prime in an arithmetic progression. Let $h\colon \mathbb{N}\to\mathbb{R}\setminus\{0\}$ be a multiplicative function, and let $a \pmod q$ be a reduced residue…

Number Theory · Mathematics 2026-05-28 Kaisa Matomäki , Joni Teräväinen

We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…

Number Theory · Mathematics 2023-05-04 Dor Elboim , Ofir Gorodetsky