Related papers: Gaps between divisible terms in $a^2 (a^2 + 1)$

Suppose that G is an abelian group and A is a finite subset of G containing no three-term arithmetic progressions. We show that |A+A| >> |A|(log |A|)^{1/3-\epsilon} for all \epsilon>0.

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

Fix a subset $I\subseteq \mathbb R_{>0}$ such that $\gamma=\inf\{ \sum_{i}n_ib_i-1>0 \mid n_i\in \mathbb Z_{\geq 0}, b_i\in I \}>0$. We give a explicit upper bound $\ell(\gamma)\in O(1/\gamma^2)$ as $\gamma\to 0$, such that for any smooth…

I gave a geometric proof of Vojta's 1 + epsilon conjecture. Some gaps in the published paper were spotted and kindly pointed out to me by Paul Vojta. These were addressed in "Erratum".

Let $p_n$ denotes the $n$-th prime. We prove that $$\max_{p_{n+1} \leq X} (p_{n+1}-p_n) \gg \frac{\log X \log \log X\log\log\log\log X}{\log \log \log X}$$ for sufficiently large $X$, improving upon recent bounds of the first three and…

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

A 1971 conjecture of Graham (later repeated by Erd\H{o}s and Graham) asserts that every set $A \subseteq \mathbb{F}_p \setminus \{0\}$ has an ordering whose partial sums are all distinct. We prove this conjecture for sets of size $|A|…

Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…

In this paper we give alternate proofs of some well-known matrix inequalities. In particular, we show that under certain conditions the inequality holds \begin{align}\sum \limits_{\lambda_i\in \mathrm{Spec}(ab^{T})}\mathrm{min}\{\log…

A conjecture of Armstrong states that if $\gcd (a, b) = 1$, then the average size of an $(a, b)$-core partition is $(a - 1)(b - 1)(a + b + 1) / 24$. Recently, Stanley and Zanello used a recursive argument to verify this conjecture when $a =…

Remark.9 in Bose-Dasgupta-Rubin (2002) review states that when a non-negative integer-valued infinitely divisible law has an atom at unity then its support cannot have any gaps. Here one has two questions. (i) Why there are no gaps and (ii)…

In this note, we study the relationship between the variational gap and the variance of the (log) likelihood ratio. We show that the gap can be upper bounded by some form of dispersion measure of the likelihood ratio, which suggests the…

Suppose that $A$ is a finite, nonempty subset of a cyclic group of either infinite or prime order. We show that if the difference set $A-A$ is ``not too large'', then there is a nonzero group element with at least as many as…

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic…

In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).

In this paper we study the problem of long gaps between values of binary quadratic forms. Let $D_{1}$, $D_{2},\ldots ,D_{r}$ be negative integers and $(s_{n})_{n=1}^{\infty}$ be the sequence of all the numbers representable by any binary…

In a recent work [JNT \textbf{129}, 2154 (2009)], Gun and co-workers have claimed that the number $\,\log{\Gamma(x)} + \log{\Gamma(1-x)}\,$, $x$ being a rational number between $0$ and $1$, is transcendental with at most \emph{one} possible…

The Three Gap Theorem states that for any $\alpha \in \mathbb{R}$ and $N \in \mathbb{N}$, the fractional parts of $\{ 0\alpha, 1\alpha, \dots, (N - 1)\alpha \}$ partition the unit circle into gaps of at most three distinct lengths. We prove…

We develop machinery to explicitly determine, in many instances, when the difference $x^2-y^n$ is divisible only by powers of a given fixed prime. This combines a wide variety of techniques from Diophantine approximation (bounds for linear…