Related papers: On the number of $k$th powers inside arithmetic pr…

In this note we show that every tournament on $n$ vertices contains the $k$-th power of a directed path of length $n/2^{6k+7}$, which improves upon the recent bound of Scott and Kor\'{a}ndi of $n/2^{2^{3k}}$. By doing so, we get an inverse…

This note deals with the relationship between the total number of $k$-walks in a graph, and the sum of the $k$-th powers of its vertex degrees. In particular, it is shown that the the number of all $k$-walks is upper bounded by the sum of…

We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

We show that there is a positive constant $c$ such that any graph on vertex set $[n]$ with at most $c n^2/k^2 \log k$ edges contains an independent set of order $k$ whose vertices form an arithmetic progression. We also present applications…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

Let $K$ be a multiquadratic extension of $\mathbb{Q}$ and let $\text{Cl}^{+}(K)$ be its narrow class group. Recently, the authors \cite{KP} gave a bound for $|\text{Cl}^{+}(K)[2]|$ only in terms of the degree of $K$ and the number of…

We study the arithmetic (geometric) progressions in the $x$-coordinates of quadratic points on smooth projective planar curves defined over a number field $k$. Unless the curve is hyperelliptic, we prove that these progressions must be…

In a recent paper the authors studied the denominators of polynomials that represent power sums by Bernoulli's formula. Here we extend our results to power sums of arithmetic progressions. In particular, we obtain a simple explicit…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

A geometric-arithmetic progression of primes is a set of $k$ primes (denoted by GAP-$k$) of the form $p_1 r^j + j d$ for fixed $p_1$, $r$ and $d$ and consecutive $j$, {\it i.e}, $\{p_1, \, p_1 r + d, \, p_1 r^2 + 2 d, \, p_1 r^3 + 3 d,…

We find sharp upper bounds for the multiplicities and the numerical values of all the distinct eigenvalues on a surface of revolution diffeomorphic to the sphere.

Let $f : \mathbf{N} \rightarrow \mathbf{C}$ be a bounded multiplicative function. Let $a$ be a fixed integer (say $a = 1$). Then $f$ is well-distributed on the progression $n \equiv a \pmod{q} \subset \{1,\dots, X\}$, for almost all primes…

Recently, several strong limit theorems for the oscillation moduli of the empirical process have been given in the iid-case. We show that, with very slight differences, those strong results are also obtained for some representation of the…

We demonstrate the existence of $K$-multimagic squares of order $N$ consisting of distinct integers whenever $N>2 K(K+1)$. This improves upon our earlier result in which we only required $N+1$ distinct integers. Additionally, we present a…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

We show that infinitely many three-term arithmetic progressions $N, N+d, N+2d$ of powerful numbers exist with $d = 2\sqrt{N} + 1$. We further conjecture that infinitely many of these progressions consist of three consecutive terms in the…

The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice. Theoretically, however, the best known upper bound on its…

We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently known unconditionally. In particular, we derive…

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.