Related papers: The frequency problem of the three gap theorem
The famous Posa conjecture states that every graph of minimum degree at least 2n/3 contains the square of a Hamilton cycle. This has been proved for large n by Koml\'os, Sark\"ozy and Szemer\'edi. Here we prove that if p > n^{-1/2+\eps},…
``Transition frequencies'' of a system containing an arbitrary number of bubbles levitated in a liquid are discussed. Using a linear coupled-oscillator model, it is shown theoretically that when the system contains $N$ bubbles of different…
In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…
The three-body problem (3BP) poses a longstanding challenge in physics and celestial mechanics. Despite the impossibility of obtaining general analytical solutions, statistical theories have been developed based on the ergodic principle.…
Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…
We prove a vertex domination conjecture of Erd\H os, Faudree, Gould, Gy\'arf\'as, Rousseau, and Schelp, that for every n-vertex complete graph with edges coloured using three colours there exists a set of at most three vertices which have…
We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$; that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$ occurs…
Assuming the Riemann Hypothesis, we show that infinitely often consecutive non-trivial zeros of the Riemann zeta-function differ by at most 0.5155 times the average spacing and infinitely often they differ by at least 2.69 times the average…
In this paper we recall a non-standard construction of the Borel sigma-algebra B in [0,1] and construct a family of measures (in particular, Lebesgue measure) in B by a completely non-topological method. This approach, that goes back to…
A positive integer is called an $E_j$-number if it is the product of $j$ distinct primes. We prove that there are infinitely many triples of $E_2$-numbers within a gap size of $32$ and infinitely many triples of $E_3$-numbers within a gap…
We present a general approach to proving the existence of spectral gaps and asynchronous exponential growth for growth-fragmentation semigroups in moment spaces $L^{1}(\mathbb{R}_{+};\ x^{\alpha }dx)$ and $L^{1}(\mathbb{R} _{+};\ \left(…
The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…
The square peg problem asks whether every continuous curve in the plane that starts and ends at the same point without self-intersecting contains four distinct corners of some square. Toeplitz conjectured in 1911 that this is indeed the…
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
The Jeffreys-Lindley paradox stands as the most profound divergence between frequentist and Bayesian approaches to hypothesis testing. Yet despite more than six decades of discussion, this paradox remains frequently misunderstood--even in…
For any configuration of pebbles on the nodes of a graph, a pebbling move replaces two pebbles on one node by one pebble on an adjacent node. A cover pebbling is a move sequence ending with no empty nodes. The number of pebbles needed for a…
We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…
The occupancy fraction of a graph is a (normalized) measure on the size of independent sets under the hard-core model, depending on a variable (fugacity) $\lambda.$ We present a criterion for finding the graph with minimum occupancy…
We consider the problem of determining Weierstrass gaps and pure Weierstrass gaps at several points. Using the notion of relative maximality in generalized Weierstrass semigroups due to Delgado \cite{D}, we present a description of these…
A generic uniformly distributed sequence $(x_n)_{n \in \mathbb{N}}$ in $[0,1)$ possesses Poissonian pair correlations (PPC). Vice versa, it has been proven that a sequence with PPC is uniformly distributed. Grepstad and Larcher gave an…