Related papers: A lower bound for the variance of generalized divi…

We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…

We obtain global explicit numerical bounds, with best possible constants, for the differences $\frac{1}{n}\sum_{k\leq n}\omega(k)-\log\log n$ and$ \frac{1}{n}\sum_{k\leq n}\Omega(k)-\log\log n$, where $\omega(k)$ and $\Omega(k)$ refer to…

We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree $n$ in $n^2$ variables such that any homogeneous depth 4 arithmetic circuit…

We consider very general "random integers" and (attempt to) prove that many multiplicative and additive functions of such integers have limiting distributions. These integers include, for instance, the curvatures of Apollonian circle…

The convergence of double Fourier series of functions of bounded partial $\Lambda$-variation is investigated. The sufficient and necessary conditions on the sequence $\Lambda=\{\lambda_n\}$ are found for the convergence of Fourier series of…

Based on the~method of subordinating functions we prove bounds for the minimal error of approximations of $n$-fold convolutions of probability measures by free infinitely divisible probability measures.

Jacobsthal's function was recently generalised for the case of paired progressions. It was proven that a specific bound of this function is sufficient for the truth of Goldbach's conjecture and of the prime pairs conjecture as well. We…

We use the Petrow-Young [10] subconvexity bound for Dirichlet $L$-functions to show that $d_4(n)$ has exponent of distribution $4/7$ when we allow an average over $a$ mod $q$, thereby giving an equidistribution result for $d_4(n)$ which…

We use some properties of orthogonal polynomials to provide a class of upper/lower variance bounds for a function $g(X)$ of an absolutely continuous random variable $X$, in terms of the derivatives of $g$ up to some order. The new bounds…

We construct explicitly Pad\'e approximations of the second kind for a special class of G-functions. These are then applied to prove a Baker-type lower bound for linear forms in the p-adic values of these functions. Moreover, we consider…

We consider some second order quasilinear partial differential inequalities for real valued functions on the unit ball and find conditions under which there is a lower bound for the supremum of nonnegative solutions that do not vanish at…

Let $f: \mathbb{N}^2 \mapsto \mathbb{C}$ be an arithmetic function of two variables. We study the existence of the limit: \[\displaystyle \lim_{x \to \infty} \frac{1}{x^2 (\log x)^{k-1}} \sum_{n_1 , n_2 \le x} f (n_1, n_2) \] where $k$ is a…

We prove inequalities involving greatest common divisors of functions at integral points with respect to numerically parallel divisors, generalizing a result of Wang and Yasufuku (after work of Bugeaud-Corvaja-Zannier, Corvaja-Zannier, and…

In this paper, we propose a new covering technique localized for the trajectories of SGD. This localization provides an algorithm-specific complexity measured by the covering number, which can have dimension-independent cardinality in…

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

In this paper, a $k$-th generalized modulus of smoothness is defined based on an asymmetric operator of generalized translation and a theorem is proved about the coincidence of class of functions defined by this modulus and a class of…

We use an old elementary arithmetic argument to find new upper and lower bounds for Sylvester's denumerant function. These bounds are tight enough to get the asymptotic behavior of the denumerant.

We give a lower bound for the degree of an irreducible factor of a given polynomial. This improves and generalizes the results obtained in [4, On the irreducible factors of a polynomial, Proc. Amer. Math. Soc., 148 (2020] 1429 -- 1437].