Related papers: Two explicit divisor sums

Let $\tau_k(n)$ be the $k$-th divisor function. In this paper, we derive an asymptotic formula for the sum $$ \sum_{1\leq n_1,n_2, \dots, n_{\ell}\leq X^{\frac{1}{r}} \atop 1\leq n_{\ell+1}\le X^{\frac{1}{s}}}\tau_k(n_1^r+n_2^r+\dots…

A function $f:[n_1]\times\dots\times[n_d]\to\mathbb{F}_2$ is a direct sum if it is of the form $f\left(a_1,\dots,a_d\right) = f_1(a_1)\oplus\dots \oplus f_d (a_d),$ for some $d$ functions $f_i:[n_i]\to\mathbb{F}_2$ for all $i=1,\dots, d$,…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

Given an endomorphism f of projective space, we exhibit explicit bounds on the difference between the naive height of a divisor and its canonical height relative to f.

We give an upper bound on the number of extensions of a fixed number field of prescribed degree and discriminant less than X; these bounds improve on work of Schmidt. We also prove various related results, such as lower bounds for the…

We refine Lagrange's four-square theorem in new ways by imposing some restrictions involving powers of two (including $1$). For example, we show that each $n=1,2,3,\ldots$ can be written as $x^2+y^2+z^2+w^2$ $(x,y,z,w\in\mathbb…

We consider the upper bound of Piltz divisor problem over number fields. Piltz divisor problem is known as a generalization of the Dirichlet divisor problem. We deal with this problem over number fields and improve the error term of this…

Every integer greater than two can be expressed as the sum of a prime and a square-free number. Expanding on recent work, we provide explicit and asymptotic results when divisibility conditions are imposed on the square-free number. For…

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

For a positive integer $n$, let $\sigma(n)$ denote the sum of the positive divisors of $n$. Let $d$ be a proper divisor of $n$. We call $n$ a deficient-perfect number if $\sigma(n)=2n-d$. In this paper, we show that the only odd…

A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - \sigma$, where $\sigma$ is the number of letters used in…

In 2014, as part of a larger study of overpartitions with restrictions of the overlined parts based on residue classes, Munagi and Sellers defined $d_2(n)$ as the number of overpartitions of weight $n$ wherein only even parts can be…

Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

We fill the gaps in A. Gica's determination of all the odd positive integers $d$ for which the number of distinct prime divisors of $f_d(x)=d+x^2$ is less than or equal to $2$ for all the positive and odd integers $x\leq\sqrt{d}$. We also…

We give an upper bound for the exponential $\sum_{m=1}^M \exp( 2i\pi f (m))$ in terms of $M$ and $\lambda$, where $\lambda$ is a small positive number which denotes the size of the fourth derivative of the real valued function $f$. The…

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…

We present sharp bounds for $\sum_{i=1}^n \alpha_i x_i - \prod_{i=1}^n x_i^{\alpha_i}$ in terms of the variance of the vector $(x_1^{1/2},...,x_n^{1/2})$.

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…

We consider a class of double exponential sums studied in a paper of Sinai and Ulcigrai. They proved a linear bound for these sums along the sequence of denominators in the continued fraction expansion of $\alpha$, provided $\alpha$ is…