A Euclidean Algorithm for Binary Cycles with Minimal Variance

by   Luca Ghezzi, et al.
University of Bologna

The problem is considered of arranging symbols around a cycle, in such a way that distances between different instances of a same symbol be as uniformly distributed as possible. A sequence of moments is defined for cycles, similarly to the well-known praxis in statistics and including mean and variance. Mean is seen to be invariant under permutations of the cycle. In the case of a binary alphabet of symbols, a fast, constructive, sequencing algorithm is introduced, strongly resembling the celebrated Euclidean method for greatest common divisor computation, and the cycle returned is characterized in terms of symbol distances. A minimal variance condition is proved, and the proposed Euclidean algorithm is proved to satisfy it, thus being optimal. Applications to productive systems and information processing are briefly discussed.


page 1

page 2

page 3

page 4


Comparison of Latitude Distribution and Evolution of Even and Odd Sunspot Cycles

We study the latitudinal distribution and evolution of sunspot areas fro...

Extending de Bruijn sequences to larger alphabets

A circular de Bruijn sequence of order n in an alphabet of k symbols is ...

On Cycles of Generalized Collatz Sequences

We explore the cycles and convergence of Generalized Collatz Sequence, w...

On the central levels problem

The central levels problem asserts that the subgraph of the (2m+1)-dimen...

The Shadows of a Cycle Cannot All Be Paths

A "shadow" of a subset S of Euclidean space is an orthogonal projection ...

A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

A binary modified de Bruijn sequence is an infinite and periodic binary ...

Please sign up or login with your details

Forgot password? Click here to reset