Related papers: Improved Bounds for the Index Conjecture in Zero-S…

We make progress on a conjecture of Cilleruelo on the growth of the least common multiple of consecutive values of an irreducible polynomial $f$ on the additional hypothesis that the polynomial be even. This strengthens earlier work of…

A sequence in an additively written abelian group is called zero-free if each of its nonempty subsequences has sum different from the zero element of the group. The article determines the structure of the zero-free sequences with lengths…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

Let $m>2$ and $q>0$ be integers with $m$ even or $q$ odd. We show the supercongruence $$\sum_{k=0}^{p-1}(-1)^{km}\binom{p/m-q}{k}^m\equiv0\pmod{p^3}.$$ for any prime $p>mq$. This confirms a conjecture of Sun.

It is conjectured that the sum $$ S_r(n)=\sum_{k=1}^{n} \frac{k}{k+r}\binom{n}{k} $$ for positive integers $r,n$ is never integral. This has been shown for $r\le 22$. In this note we study the problem in the ``$n$ aspect" showing that the…

In 1976 Martin Gardner posed the following problem: ``What is the smallest number of [queens] you can put on an [$n \times n$ chessboard] such that no [queen] can be added without creating three in a row, a column, or a diagonal?'' The work…

The Mertens function is defined as $M(x) = \sum_{n \leq x} \mu(n)$, where $\mu(n)$ is the M\"obius function. The Mertens conjecture states $|M(x)/\sqrt{x}| < 1$ for $x > 1$, which was proven false in 1985 by showing $\liminf M(x)/\sqrt{x} <…

A famous conjecture of Graham asserts that every set $A \subseteq \mathbb{Z}_p \setminus \{0\}$ can be ordered so that all partial sums are distinct. Although this conjecture was recently proved for sufficiently large primes by Pham and…

We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

A length $n$ cosine sum is an expression of the form $\cos a_1\theta + \cdots + \cos a_n\theta$ where $a_1 < \cdots < a_n$ are positive integers, and a length $n$ Newman polynomial is an expression of the form $z^{a_1} + \cdots + z^{a_n}$…

Direct sum theorems state that the cost of solving $k$ instances of a problem is at least $\Omega(k)$ times the cost of solving a single instance. We prove the first such results in the randomised parity decision tree model. We show that a…

More than twenty years ago, Manickam, Mikl\'{o}s, and Singhi conjectured that for any integers $n, k$ satisfying $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum…

Let $\lambda$ denote the Liouville function. A well known conjecture of Chowla asserts that for any distinct natural numbers $h_1,\dots,h_k$, one has $\sum_{1 \leq n \leq X} \lambda(n+h_1) \dotsm \lambda(n+h_k) = o(X)$ as $X \to \infty$.…

This paper presents a lower bound for optimizing a finite sum of $n$ functions, where each function is $L$-smooth and the sum is $\mu$-strongly convex. We show that no algorithm can reach an error $\epsilon$ in minimizing all functions from…

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

In 2017, motivated by a supercongruence conjectured by Kimoto and Wakayama and confirmed by Long, Osburn and Swisher, Z.-W. Sun introduced the sequence of polynomials: $$…

This note considers reciprocal of primes in binary representation and shows that the conjecture that 0s exceed 1s in most cases continues to hold for primes less one million. The conjecture has also been tested for ternary representation…

For any positive integer $n$, let $f(n)$ denote the number of solutions to the Diophantine equation $\frac{4}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$ with $x,y,z$ positive integers. The \emph{Erd\H{o}s-Straus conjecture} asserts that…

Barry Simon conjectured in 2005 that the Szeg\H{o} matrices, associated with Verblunsky coefficients $\{\alpha_n\}_{n\in\mathbb{Z}_+}$ obeying $\sum_{n = 0}^\infty n^\gamma |\alpha_n|^2 < \infty$ for some $\gamma \in (0,1)$, are bounded for…