Related papers: On the Gap sequence and the Gilbreath conjecture
The well known Three Gap Theorem states that there are at most three gap sizes in the sequence of fractional parts $\{\alpha n\}_{n<N}$ . It is known that if one averages over {\alpha}, the distribution becomes continuous. We present an…
Nous rappelons l'historique de la demonstration de la conjecture des fibres de Seifert, ainsi que ses motivations et ses diverses generalisations. ----- We recall the history of the proof of the Seibert fiber space conjecture, as well as…
Let w be a factor of Fibonacci sequence F=x_1x_2..., then it appears in the sequence infinitely many times. Let w_p be the p-th appearance of w and v_{w,p} be the gap between w_p and w_{p+1}. In this paper, we discuss the structure of the…
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.…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
Consider a variant of the graph diameter of a polyhedron where each step in a walk between two vertices travels maximally in a circuit direction instead of along incident edges. Here circuit directions are non-trivial solutions to…
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the positions to which p is mapped to) satisfy given gap…
In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which sequences…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…
An interesting open problem in number theory asks whether it is possible to walk to infinity on primes, where each term in the sequence has one more digit than the previous. In this paper, we study its variation where we walk on the…
We propose trace logic, an instance of many-sorted first-order logic, to automate the partial correctness verification of programs containing loops. Trace logic generalizes semantics of program locations and captures loop semantics by…
Let $P,Q$ be longest paths in a simple graph. We analyze the possible connections between the components of $P\cup Q\setminus (V(P)\cap V(Q))$ and introduce the notion of a bi-traceable graph. We use the results for all the possible…
An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…
The Collatz and $abc$ conjectures, both well known and thoroughly studied, appear to be largely unrelated at first sight. We show that assuming the $abc$ conjecture true is helpful to improve the lower bound of integers initiating a…
Linear-constraint loops are programs whose transition relation is specified by a system of linear inequalities. The termination problem asks, given a loop, whether it admits an infinite computation. Decidability of termination remains open…
The parity conjecture has a long and distinguished history. It gives a way of predicting the existence of points of infinite order on elliptic curves without having to construct them, and is responsible for a wide range of unexplained…
Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…
This is an introductory article to the theory of multiple gaps.