Related papers: The Three Gap Theorem (Steinhauss Conjecture)
We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…
Three points uniformly selected on the unit circle form a triangle containing a point $X$ at distance $r \in [0; 1]$ from its center with probability $P(r) = \frac{1}{4} - \frac{3}{2 \pi^2}\textrm{Li}_2(r^2)$, where $\textrm{Li}_2$ is the…
In this paper, we prove a conjecture by Aas and Linusson on the two-point correlations of adjacent particles in a continuous multispecies TASEP on a ring (AIHPD, 2018). We use the theory of multiline queues as devised by Ferrari and Martin…
We present a concise self-contained inversive geometry solution of the three-circle problem of Steiner of constructing a circle that intersects each of the three given circles at one of the three given angles.
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A,B,C such that A is congruent to B (i.e., there is an isometry of the sphere which sends A to B), B is congruent to…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
By combining Tur\'an's proof of Fabry's gap theorem with a gap theorem of P. Sz\"usz we obtain a gap theorem which is more general then both these theorems.
Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…
Let $X$ be a finite sequence of length $m\geq 1$ in $\mathbb{Z}/n\mathbb{Z}$. The \textit{derived sequence} $\partial X$ of $X$ is the sequence of length $m-1$ obtained by pairwise adding consecutive terms of $X$. The collection of iterated…
If $P$ is a point inside $\triangle ABC$, then the cevians through $P$ divide $\triangle ABC$ into six small triangles. We give theorems about the relationships between the radii of the circumcircles of these triangles. We also state some…
In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…
We consider Steinhaus cake dividing game.
Steinitz's theorem states that if the origin belongs to the interior of the convex hull of a set $Q \subset \mathbb{R}^d$, then there are at most $2d$ points $Q^\prime$ of $Q$ whose convex hull contains the origin in the interior.…
It is conjectured that if a finite set of points in the plane contains many collinear triples then there is some structure in the set. We are going to show that under some combinatorial conditions such pointsets contain special…
We give an optimal version of the classical ``three-gap theorem'' on the fractional parts of $n \theta$, in the case where $\theta$ is an irrational number that is badly approximable. As a consequence, we deduce a version of Kronecker's…
The "n! conjecture" of Garsia and Haiman has inspired mathematicians for nearly two decades, even after Haiman published a proof in 2001. Kumar and Funch Thomsen proved in 2003 that in order to prove the conjecture for all partitions, it…
The famous Gallai's Conjecture states that any connected graph with n vertices has a path decomposition containing at most (n+1)/2 paths. In this note, we explore graphs generated from removing edges from complete graphs. We first provide…