Related papers: On the Guy-Kelly Conjecture for the No-Three-In-Li…

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

The Kullback-Leibler (KL) divergence is not a proper distance metric and does not satisfy the triangle inequality, posing theoretical challenges in certain practical applications. Existing work has demonstrated that KL divergence between…

We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…

We consider three graphs, $G_{7,3}$, $G_{7,4}$, and $G_{7,6}$, related to Keller's conjecture in dimension 7. The conjecture is false for this dimension if and only if at least one of the graphs contains a clique of size $2^7 = 128$. We…

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations $G(k)$ and a related double sequence $G(k,m)$. Exact expressions for these are derived, and we…

The gonality conjecture, proved by Ein--Lazarsfeld, asserts that the gonality of a nonsingular projective curve of genus $g$ can be detected from its syzygies in the embedding given by a line bundle of sufficiently large degree. An…

In 1847, Kirkman proved that there exists a Steiner triple system on $n$ vertices (equivalently a triangle decomposition of the edges of $K_n$) whenever $n$ satisfies the necessary divisibility conditions (namely $n\equiv 1,3 \mod 6$). In…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

O. H. Keller conjectured in 1930 that in any tiling of $\Bbb R^n$ by unit $n$-cubes there exist two of them having a complete facet in common. O. Perron proved this conjecture for $n\le 6$. We show that for all $n\ge 10$ there exists a…

This paper is devoted to the Lin-Ni conjecture for a semi-linear elliptic equation with a super-linear, sub-critical nonlinearity and homogeneous Neumann boundary conditions. We establish a new rigidity result, that is, we prove that the…

In Ellenberg and Gijswijt's groundbreaking work, the authors show that a subset of $\mathbb{Z}_3^{n}$ with no arithmetic progression of length 3 must be of size at most $2.755^n$ (no prior upper bound was known of $(3-\epsilon)^n)$), and…

Given any positive integer n, we prove the existence of infinitely many right triangles with area n and side lengths in certain number fields. This generalizes the famous congruent number problem. The proof allows the explicit construction…

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

In 1998, Bremner conjectured that elliptic curves over the rationals having long sequences of distinct rational points whose $x$-coordinates are in arithmetic progression, have large rank. This was proved some years ago in a strong form as…

Consider the $(2+1)$D Discrete Gaussian (ZGFF, integer-valued Gaussian free field) model in an $L\times L$ box above a hard floor. Bricmont, El-Mellouki and Fr\"ohlich (1986) established that, at low enough temperature, this random surface…

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…

In a recent work, Keusch proved the so-called 1-2-3 Conjecture, raised by Karo\'nski, {\L}uczak, and Thomason in 2004: for every connected graph different from $K_2$, we can assign labels~$1,2,3$ to the edges so that no two adjacent…

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…