Related papers: A concise geometric proof of the three distance th…

In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…

Let $V$ be an $n$-dimensional vector space over the finite field consisting of $q$ elements and let $\Gamma_{k}(V)$ be the Grassmann graph formed by $k$-dimensional subspaces of $V$, $1<k<n-1$. Denote by $\Gamma(n,k)_{q}$ the restriction of…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

The Ulam sequence, described by Stanislaw Ulam in the 1960s, starts $1,2$ and then iteratively adds the smallest integer that can be uniquely written as the sum of two distinct earlier terms: this gives $1,2,3,4,6,8,11,\dots$. Already in…

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. The metric theory of minimal gaps for the sequence $\{\alpha a_n \text{ mod }1, 1\leq n \leq N\}$ as $N \to \infty$ was initiated by Rudnick, who established that the…

In this work, the relativistic phenomena of Lorentz-Fitzgerald contraction and time dilation are derived using a modified distance formula that is appropriate for discrete space. This new distance formula is different than the Pythagorean…

We give a triplet of short proofs, each of which answers a question raised by Erd\H{o}s. The first concerns the small prime factors of $\binom{n}{k}$, the second concerns whether an additive basis $A$ can always be split into pieces $A_1$…

Let $\alpha$ be a real number greater than $1$. We establish an effective lower bound for the distance between an integral power of $\alpha$ and its nearest integer.

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

Following earlier results of Sondow, we propose another criterion of irrationality for Euler's constant $\gamma$. It involves similar linear combinations of logarithm numbers $L\_{n,m}$. To prove that $\gamma$ is irrational, it suffices to…

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

The Conjecture of Hadwiger implies that the Hadwiger number $h$ times the independence number $\alpha$ of a graph is at least the number of vertices $n$ of the graph. In 1982 Duchet and Meyniel proved a weak version of the inequality,…

We show geometrically that $\sqrt n$ is irrational for $n=3,5,7$ by adapting Tennenbaum's geometric proof that $\sqrt 2$ is irrational. We also show that this method cannot be used to prove the irrationality of $\sqrt n$ for a bigger $n$.

Here is a square problem: in a unit square, is there a point with four rational distances to the vertices? A probability argument suggests a negative answer. This paper proves several special cases of the square problem: if the point sits…

Given a symmetric exchange of three intervals, we provide a detailed description of the return times to a subinterval and the corresponding itineraries. We apply our results to morphisms fixing words coding non-degenerate three interval…

Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…

Distances are pervasive in machine learning. They serve as similarity measures, loss functions, and learning targets; it is said that a good distance measure solves a task. When defining distances, the triangle inequality has proven to be a…

We consider the problem of partitioning a line segment into two subsets, so that $n$ finite measures all have the same ratio of values for the subsets. Letting $\alpha\in[0,1]$ denote the desired ratio, this generalises the PPA-complete…

Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this…