Related papers: Marshall Hall's Conjecture and Gaps Between Intege…
This article presents a comprehensive data-scientific investigation into the arithmetic statistics of congruent number elliptic curves, leveraging a dataset of square-free integers up to $3$ million. We analyze the Mordell-Weil ranks,…
The n-th hull of a union of curves in R^3 is the set of points with the property: Any plane passing through the point intersects the curves at least 2n times. The hull number u(L) of a link L is defined as the minimum number of non-empty…
Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $|x_i - x_j| \leq 1$ for all $1 \leq i,j \leq n$. We show that the ratio of the number of ``neighbors''…
Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…
We study two variants of the notion of holes formed by planar simple random walk of time duration $2n$ and the areas associated with them. We prove in both cases that the number of holes of area greater than $A(n)$, where $\{A(n)\}$ is an…
We study arithmetic progressions of squares over quadratic extensions of number fields. Using a method inspired by an approach of Mordell, we characterize such progressions as quadratic points on a genus $5$ curve. Specifically, we…
We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…
Infinitely many elliptic curves over ${\bf Q}$ have a Galois-stable cyclic subgroup of order 4. Such subgroups come in pairs, which intersect in their subgroups of order 2. Let $N_i(X)$ denote the number of elliptic curves over ${\bf Q}$…
In this paper we establish an improved bound for the number of incidences between a set $P$ of $m$ points and a set $H$ of $n$ planes in $\mathbb R^3$, provided that the points lie on a two-dimensional nonlinear irreducible algebraic…
We generalize the lemmas of Thomas Kretschmer to arbitrary number fields, and apply them with a 2-descent argument to obtain bounds for families of elliptic curves over certain imaginary quadratic number fields with class number 1. One such…
An elliptic curve $E$ over $\mathbb{Q}$ is said to be good if $N_{E}^{6}<\max\!\left\{ \left\vert c_{4}^{3}\right\vert ,c_{6}^{2}\right\} $ where $N_{E}$ is the conductor of $E$ and $c_{4}$ and $c_{6}$ are the invariants associated to a…
It is conjectured since long that for any convex body $P\subset \mathbb{R}^n$ there exists a point in its interior which belongs to at least $2n$ normals from different points on the boundary of $P$. The conjecture is known to be true for…
Combining the Hardy-Littlewood k-tuple conjecture with a heuristic application of extreme-value statistics, we propose a family of estimator formulas for predicting maximal gaps between prime k-tuples. Computations show that the estimator…
The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…
We develop a technique that can be applied to provide improved upper bounds for two important questions in linear integer optimization. - Proximity bounds: Given an optimal vertex solution for the linear relaxation, how far away is the…
Let $k \in \mathbb{N}$ and suppose we are given $k$ integers $1 \leq a_1, \dots, a_k \leq n$. If $\sqrt{a_1} + \dots + \sqrt{a_k}$ is not an integer, how close can it be to one? When $k=1$, the distance to the nearest integer is $\gtrsim…
We establish sharp lower and upper bounds for the number of integral points near dilations of a space curve with nowhere vanishing torsion.
For any family of elliptic curves over the rational numbers with fixed $j$-invariant, we prove that the existence of a long sequence of rational points whose $x$-coordinates form a non-trivial arithmetic progression implies that the…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
We give a fairly elementary and simple proof that shows that the number of incidences between $m$ points and $n$ lines in ${\mathbb R}^3$, so that no plane contains more than $s$ lines, is $$ O\left(m^{1/2}n^{3/4}+ m^{2/3}n^{1/3}s^{1/3} + m…