Related papers: Numerically explicit estimates for the distributio…

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

The aim of this paper is to study distributional properties of integers without large or small prime factors. Define an integer to be $[y',y]$-smooth if all of its prime factors belong to the interval $[y',y]$. We identify suitable weights…

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

Hildebrand proved that the smooth approximation for the number $\Psi(x,y)$ of $y$-friable integers not exceeding $x$ holds for $y>(\log x)^{2+\varepsilon}$ under the Riemann hypothesis and conjectured that it fails when $y\leqslant (\log…

Let $\Psi(x,y)$ count the number of positive integers $n\le x$ such that every prime divisor of $n$ is at most $y$. Given inputs $x$ and $y$, what is the best way to estimate $\Psi(x,y)$? We address this problem in three ways: with a new…

A classical result due to Frank and Seiringer asserts that for $1\leq p<\frac Ns$, there exists a sharp constant $\mathcal{C}_{N,s,p}>0$ such that $$…

We study the asymptotic behavior of the Oleinik's solution to the steady Prandtl equation when the outer flow $U(x)=1$. Serrin proved that the Oleinik's solution converges to the famous Blasius solution $\bar u$ in $L^\infty_y$ sense as…

Let $\Phi(N)$ denote the number of products of matrices $[ \begin{smallmatrix} 1 & 1 \\ 0 & 1 \end{smallmatrix}]$ and $[ \begin{smallmatrix} 1 & 0 \\ 1 & 1 \end{smallmatrix} ]$ of trace equal to $N$, and $\Psi(N)=\sum_{n=3}^N \Phi(n)$ be…

For an ergodic Brownian diffusion with invariant measure $\nu$, we consider a sequence of empirical distributions ($\nu$n) n$\ge$1 associated with an approximation scheme with decreasing time step ($\gamma$n) n$\ge$1 along an adapted…

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Given a smooth closed Riemannian manifold $(M,g)$ of dimension $N \ge 3$, we derive sharp quantitative stability estimates for nonnegative functions near the solution set of the Yamabe problem on $(M,g)$. The seminal work of Struwe (1984)…

Typically, one expects that there are around x\prod_{p\not\in P, p <= x} (1-1/p) integers up to x, all of whose prime factors come from the set P. Of course for some choices of P one may get rather more integers, and for some choices of P…

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ with $x,y,z$ positive integers. The \emph{Erd\H{o}s-Straus conjecture} asserts that…

The $i$-tuply $y$-densely divisible numbers were introduced by a Polymath project, as a weaker condition on the moduli than $y$-smoothness, in distribution estimates for primes in arithmetic progressions. We obtain the order of magnitude of…

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Let $(u_n)_{n \ge 0}$ be a nondegenerate Lucas sequence and $g_u(n)$ be the arithmetic function defined by $\gcd(n, u_n).$ Recent studies have investigated the distributional characteristics of $g_u$. Numerous results have been proven based…

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

Let $\mathcal I_n$ and $\mathcal J_n$ denote the set of involutions and fixed-point free involutions of $\{1, \dots, n\}$, respectively, and let $\text{des}(\pi)$ denote the number of descents of the permutation $\pi$. We prove a conjecture…

The order and disorder of binary representations of the natural numbers < 2^8 is measured using the BiEntropy function. Significant differences are detected between the primes and the non primes. The BiEntropic prime density is shown to be…