Related papers: Sums of generalized polygonal numbers of almost pr…

Motivated by coding applications,two enumeration problems are considered: the number of distinct divisors of a degree-m polynomial over F = GF(q), and the number of ways a polynomial can be written as a product of two polynomials of degree…

We prove a generalization of the author's work to show that any subset of the primes which is `well-distributed' in arithmetic progressions contains many primes which are close together. Moreover, our bounds hold with some uniformity in the…

We express some general type of infinite series such as $$ \sum^\infty_{n=1}\frac{F(H_n^{(m)}(z),H_n^{(2m)}(z),\ldots,H_n^{(\ell m)}(z))} {(n+z)^{s_1}(n+1+z)^{s_2}\cdots (n+k-1+z)^{s_k}}, $$ where $F(x_1,\ldots,x_\ell)\in\mathbb…

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

Given an integer $k\ge2$, let $\omega_k(n)$ denote the number of primes that divide $n$ with multiplicity exactly $k$. We compute the density $e_{k,m}$ of those integers $n$ for which $\omega_k(n)=m$ for every integer $m\ge0$. We also show…

In this paper, we consider representations of integers as sums of generalized heptagonal numbers with a prescribed number of repeats of each heptagonal number appearing in the sum. In particular, we investigate the classification of such…

Given a pair of distinct non-CM normalized eigenforms having integer Fourier coefficients $a_1 (n)$ and $a_2(n)$, we count positive integers $n$ with $(a_1(n), a_2(n))=1$ and make a conjecture about the density of the set of primes $p$ for…

Let $x$ be a positive integer. We give an asymptotic result for $\omega(\operatorname{lcm}(m,n))$ summed over all positive integers $m$ and $n$ with $mn \le x$. This answers an open question posed in a recent paper.

We show for each positive integer $a$ that, if $\cM$ is a minor-closed class of matroids not containing all rank-$(a+1)$ uniform matroids, then there exists an integer $n$ such that either every rank-$r$ matroid in $\cM$ can be covered by…

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Let $A$ be a set in an abelian group $G$. For integers $h,r \geq 1$ the generalized $h$-fold sumset, denoted by $h^{(r)}A$, is the set of sums of $h$ elements of $A$, where each element appears in the sum at most $r$ times. If…

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1,…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

We prove new upper bounds on the number of representations of rational numbers $\frac{m}{n}$ as a sum of $4$ unit fractions, giving five different regions, depending on the size of $m$ in terms of $n$. In particular, we improve the most…

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…