English
Related papers

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

200 papers

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…

Data Structures and Algorithms · Computer Science 2020-06-22 Sebastian Berndt , Klaus Jansen , Kim-Manuel Klein

We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…

Number Theory · Mathematics 2017-03-21 Fabio Roman

We show that the total number of non-torsion integral points on the elliptic curves $\mathcal{E}_D:y^2=x^3-D^2x$, where $D$ ranges over positive squarefree integers less than $N$, is $O( N(\log N)^{-1/4+\epsilon})$. The proof involves a…

Number Theory · Mathematics 2024-09-17 Stephanie Chan

Let $\mathbf X$ be a random matrix whose pairs of entries $X_{jk}$ and $X_{kj}$ are correlated and vectors $ (X_{jk},X_{kj})$, for $1\le j<k\le n$, are mutually independent. Assume that the diagonal entries are independent from off-diagonal…

Probability · Mathematics 2013-09-24 Friedrich Götze , Alexey Naumov , Alexander Tikhomirov

Consider a smooth, geometrically irreducible, projective curve of genus $g \ge 2$ defined over a number field of degree $d \ge 1$. It has at most finitely many rational points by the Mordell Conjecture, a theorem of Faltings. We show that…

Number Theory · Mathematics 2021-04-02 Vesselin Dimitrov , Ziyang Gao , Philipp Habegger

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

Let $k\geq2$ be an integer. The aim of this paper is to investigate the distribution of $k$-full integers between three successive $k$-th powers. More precisely, for any integers $\ell,m\ge0$, we establish the explicit asymptotic density…

Number Theory · Mathematics 2026-02-19 Shusei Narumi , Yohei Tachiya

We first introduce the Hamming distance between two strings. Then, we apply this concept to the representations of whole numbers in base n for all positive integers n > 2. We claim that a simple formula exists for the sum of all Hamming…

Discrete Mathematics · Computer Science 2012-05-01 Anunay Kulshrestha

This paper is intended as a sequel to a paper arXiv:0803.2636 written by four of the coauthors here. In the paper, they proved a stronger form of the Erd\H{o}s-Mirksy conjecture which states that there are infinitely many positive integers…

In 2008, Chen and Chv\'atal conjectured that in every finite metric space of $n$ points, there are at least $n$ distinct lines, or the whole set of points is a line. This is a generalization of a classical result in the Euclidean plane. The…

Combinatorics · Mathematics 2025-12-16 Martín Matamala , Luciano Villarroel-Sepúlveda

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

Discrete Mathematics · Computer Science 2014-07-10 Ronan Le Bras , Carla P. Gomes , Bart Selman

We use an invariant-theoretic method to compute certain twists of the modular curves X(n) for n=7,9,11. Searching for rational points on these twists enables us to find non-trivial pairs of n-congruent elliptic curves over Q, i.e. pairs of…

Number Theory · Mathematics 2011-05-10 Tom Fisher

In the multiway cut problem, we are given an undirected graph with non-negative edge weights and a collection of $k$ terminal nodes, and the goal is to partition the node set of the graph into $k$ non-empty parts each containing exactly one…

Data Structures and Algorithms · Computer Science 2018-11-22 Kristóf Bérczi , Karthekeyan Chandrasekaran , Tamás Király , Vivek Madan

We consider the minimum number of lines $h_n$ and $p_n$ needed to intersect or pierce, respectively, all the cells of the $n \times n$ chessboard. Determining these values can also be interpreted as a strengthening of the classical plank…

Combinatorics · Mathematics 2023-07-31 Gergely Ambrus , Imre Bárány , Péter Frankl , Dániel Varga

A point (x1, x2) with coordinates in a subfield of R of transcendence degree one over Q, with 1, x1, x2 linearly independent over Q, may have a uniform exponent of approximation by elements of Q^2 that is strictly larger than the lower…

Number Theory · Mathematics 2012-05-22 Damien Roy

We construct a set of $2^n$ points in $\mathbb{R}^n$ such that all pairwise Manhattan distances are odd integers, which improves the recent linear lower bound of Golovanov, Kupavskii and Sagdeev. In contrast to the Euclidean and maximum…

Combinatorics · Mathematics 2024-10-25 Alberto Espuny Díaz , Emma Hogan , Freddie Illingworth , Lukas Michel , Julien Portier , Jun Yan

We prove that the existence of infinitely many $(m_k, n_k) \in \mathbb{N}^2$ such that the difference of harmonic numbers $H_{m_k} - H_{n_k}$ approximates 1 well $$ \lim_{k \rightarrow \infty} \left| \sum_{\ell = n}^{m_k} \frac{1}{\ell} - 1…

Combinatorics · Mathematics 2024-06-13 Jeck Lim , Stefan Steinerberger

We prove that a positive proportion of squarefree integers are congruent numbers such that the canonical height of the lowest non-torsion rational point on the corresponding elliptic curve satisfies a strong lower bound.

Number Theory · Mathematics 2018-02-21 Pierre Le Boudec

Let E be an elliptic curve over Q, and let n=>1. The central object of study of this article is the division field Q(E[n]) that results by adjoining to Q the coordinates of all n-torsion points on E(Q). In particular, we classify all curves…

Number Theory · Mathematics 2021-06-21 Enrique Gonzalez-Jimenez , Alvaro Lozano-Robledo

In 1946 Erd\H os asked for the maximum number of unit distances, $u(n)$, among $n$ points in the plane. He showed that $u(n)> n^{1+c/\log\log n}$ and conjectured that this was the true magnitude. The best known upper bound is…

Combinatorics · Mathematics 2014-04-22 Ryan Schwartz , József Solymosi , Frank de Zeeuw
‹ Prev 1 4 5 6 7 8 10 Next ›