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

In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…

For each $n \geq 2$, $l \geq 3$, let ${ES}_L (l,n)$ be the minimum $N$ such that every family of $N$-lines in the plane contains either $l$ concurrent lines or $n$ lines in convex position. In this papar, we give the upper and lower bounds…

We contribute to the Malle conjecture on the number N (K, G, y) of finite Galois extensions E of some number field K of finite group G and of discriminant of norm |N K/Q (d E)| $\le$ y. We prove the lower bound part of the conjecture for…

Is it possible to distinguish algebraic from transcendental real numbers by considering the $b$-ary expansion in some base $b\ge2$? In 1950, \'E. Borel suggested that the answer is no and that for any real irrational algebraic number $x$…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

In this paper we establish well posedness of the Neumann problem with boundary data in $L^2$ or the Sobolev space $\dot W^2_{-1}$, in the half space, for linear elliptic differential operators with coefficients that are constant in the…

In 1991, Edelsbrunner and Tan gave an O(n^2) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin…

A given six dimensional vector represents a 3D straight line in Plucker coordinates if its coordinates satisfy the Klein quadric constraint. In many problems aiming to find the Plucker coordinates of lines, noise in the data and other…

For $E_{b}: y^{2}=x^{3}+b$, we establish Lang's conjecture on a lower bound for the canonical height of non-torsion points along with upper and lower bounds for the difference between the canonical and logarithmic height. In many cases, our…

Guth and Katz proved that, as conjectured by Elekes and Sharir, $m$ lines in 3-space have at most constant times $ m^{3/2}$ intersection points, aside from some obvious counter examples. We give an explicit bound for the constant, using the…

We provide the proof of a previously announced result that resolves the following problem posed by A.~A.~Kirillov. Let $T$ be a presentation of a group $\mathcal{G}$ by bounded linear operators in a Banach space $G$ and $E\subset G$ be a…

Between his arrival in Frankfurt in $1922$ and and his proof of his famous finiteness theorem for integral points in $1929$, Siegel had no publications. He did, however, write a letter to Mordell in $1926$ in which he explained a proof of…

Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.}…

We prove upper and lower bounds for the number of lines in general position that are rich in a Cartesian product point set. This disproves a conjecture of Solymosi and improves work of Elekes, Borenstein and Croot, and Amirkhanyan, Bush,…

We establish a precise correspondence between the ABC Conjecture and N=4 super-Yang-Mills theory. This is achieved by combining three ingredients: (i) Elkies' method of mapping ABC-triples to elliptic curves in his demonstration that ABC…

In arXiv:2212.14023 a decomposition of Gaussian measures on finite-dimensional spaces was introduced, which turned out to be a central technical tool to improve currently known bounds on a long standing conjecture in statistical mechanics…

Currently, the best upper bounds on the number of rational points on an absolutely irreducible, smooth, projective algebraic curve of genus g defined over a finite field F_q come either from Serre's refinement of the Weil bound if the genus…

A graph $G=(V(G), E(G))$ is supereulerian if it has a spanning Eulerian subgraph. Let $\ell(G)$ be the maximum number of edges of spanning Eulerian subgraphs of a supereulerian graph $G$. In $1996$, Catlin conjectured that if $G$ is a…

This is an informal paper presenting historical results around the recent paper of the author about Lang's Conjecture and torsion of elliptic curves. This paper also discusses a few aspects of the proof.

A famous theorem of Kirkman says that there exists a Steiner triple system of order $n$ if and only if $n\equiv 1,3\mod{6}$. In 1973, Erd\H{o}s conjectured that one can find so-called `sparse' Steiner triple systems. Roughly speaking, the…