English
Related papers

Related papers: Marshall Hall's Conjecture and Gaps Between Intege…

200 papers

We establish a congruence formula between $p$-adic logarithms of Heegner points for two elliptic curves with the same mod $p$ Galois representation. As a first application, we use the congruence formula when $p=2$ to explicitly construct…

Number Theory · Mathematics 2017-11-29 Daniel Kriz , Chao Li

A positive integer $m$ is called a Hall number if any finite group of order precisely divisible by $m$ has a Hall subgroup of order $m$. We prove that, except for the obvious examples, the three integers $12$, $24$ and $60$ are the only…

Group Theory · Mathematics 2024-08-07 Zheng Guo , Yong Hu , Cai Heng Li

The Harary-Hill Conjecture states that for $n\geq 3$ every drawing of $K_n$ has at least \begin{align*} H(n) :=…

Computational Geometry · Computer Science 2018-07-12 Petra Mutzel , Lutz Oettershagen

A Heffter array $H(n;k)$ is an $n\times n$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…

Combinatorics · Mathematics 2018-08-09 Nicholas J. Cavenagh , Jeff Dinitz , Diane Donovan , Sule Yazıcı

It is shown that there are finitely many perfect powers in an elliptic divisibility sequence whose first term is divisible by 2 or 3. For Mordell curves the same conclusion is shown to hold if the first term is greater than 1. Examples of…

Number Theory · Mathematics 2011-01-20 Jonathan Reynolds

Let $E/\mathbb{Q}$ be an elliptic curve. We say that $E$ has a near coincidence of level $(n,m)$ if $m \mid n$ and $\mathbb{Q}(E[n]) = \mathbb{Q}(E[m],\zeta_{n})$. We classify near coincidences of prime power level and use this result to…

Number Theory · Mathematics 2026-03-25 Harris Daniels , Jeremy Rouse

We initiate the study of Ramsey numbers of trails. Let $k \geq 2$ be a positive integer. The Ramsey number of trails with $k$ vertices is defined as the the smallest number $n$ such that for every graph $H$ with $n$ vertices, $H$ or the…

Discrete Mathematics · Computer Science 2022-09-14 Masatoshi Osumi

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least…

Combinatorics · Mathematics 2026-05-08 Ritesh Goenka , Kenneth Moore

We consider elliptic curves defined by an equation of the form $y^2=x^3+f(t)$, where $f\in k[t]$ has coefficients in a perfect field $k$ of characteristic not $2$ or $3$. By performing $2$ and $3$-descent, we obtain, under suitable…

Algebraic Geometry · Mathematics 2024-01-15 Jean Gillibert , Emmanuel Hallouin , Aaron Levin

Given n general points p_1, p_2,..., p_n \in P^r, it is natural to ask whether there is a curve of given degree d and genus g passing through them; by counting dimensions a natural conjecture is that such a curve exists if and only if \[n…

Algebraic Geometry · Mathematics 2019-04-29 Eric Larson

We prove that, when elliptic curves $E/\mathbb{Q}$ are ordered by height, the average number of integral points $\#|E(\mathbb{Z})|$ is bounded, and in fact is less than $66$ (and at most $\frac{8}{9}$ on the minimalist conjecture). By…

Number Theory · Mathematics 2015-02-11 Levent Alpoge

This paper studies the theory of linear analog error correction coding. Since classical concepts of minimum Hamming distance and minimum Euclidean distance fail in the analog context, a new metric, termed the "minimum (squared Euclidean)…

Information Theory · Computer Science 2011-05-10 Kai Xie , Jing , Li

Given an $n\times n$ matrix with integer entries in the range $[-h,h]$, how close can two of its distinct eigenvalues be? The best previously known examples have a minimum gap of $h^{-O(n)}$. Here we give an explicit construction of…

Combinatorics · Mathematics 2023-06-14 Aaron Abrams , Zeph Landau , Jamie Pommersheim , Nikhil Srivastava

Under the assumption of infinitely many Siegel zeroes $s$ with $Re(s)>1-\frac{1}{(\log q)^{R}}$ for a sufficiently large value of $R$, we prove that there exist infinitely many $m$-tuples of primes that are $\ll e^{1.9828m}$ apart. This…

Number Theory · Mathematics 2024-03-06 Thomas Wright

The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…

For elliptic curves given by the equation $E_{a}: y^{2}=x^{3}+ax$, we establish the best-possible version of Lang's conjecture on the lower bound of the canonical height of non-torsion points along with best-possible upper and lower bounds…

Number Theory · Mathematics 2013-07-18 Paul Voutier , Minoru Yabuta

A positive integer $n$ is called a tiling number if the equilateral triangle can be dissected into $nk^2$ congruent triangles for some integer $k$. An integer $n>3$ is tiling number if and only if at least one of the elliptic curves…

Number Theory · Mathematics 2024-05-21 Keqin Feng , Qiuyue Liu , Jinzhao Pan , Ye Tian

We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…

Metric Geometry · Mathematics 2025-08-12 Alexey Kroshnin , Tianyu Ma , Eugene Stepanov

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

Let $\mathbb{K}$ be an algebraically closed field. In this paper, we consider the class of smooth plane curves of degree $n+1>3$ over $\mathbb{K}$, containing three points, $P_1,P_2,$ and $P_3$, such that $nP_1+P_2$, $nP_2+P_3$, and…

Number Theory · Mathematics 2021-07-20 Herivelto Borges , Gregory Duran