Uniformly balanced words with linear complexity and prescribed letter frequencies

@inproceedings{Berth2011UniformlyBW,
  title={Uniformly balanced words with linear complexity and prescribed letter frequencies},
  author={Val{\'e}rie Berth{\'e} and S{\'e}bastien Labb{\'e}},
  booktitle={Words},
  year={2011}
}
We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by the given d-uple. This paper investigates a construction method for such words based on the use of mixed multidimensional continued fraction algorithms. 

Figures and Tables from this paper

On the structure of bispecial Sturmian words

  • G. Fici
  • Mathematics
    J. Comput. Syst. Sci.
  • 2014

Generation of Digital Planes Using Generalized Continued-Fractions Algorithms

This work proposes a pair of hybrid continued fractions algorithms and shows geometrical properties of the digital planes constructed from them and generalizes the recursive construction of digital lines to dimension three.

Sturmian Canons

In this paper, a Sturmian word of irrational slope a with a hierarchical periodicity of p gives rise to p-tuple canons, the voices and relations of which are determined by the terms of the continued fraction expansion of a.

Mathematics and Computation in Music

The model is used as a convenient universe for drawing gestures – continuous paths between pc-sets on a particular cross-section of the most general torus of phases, representing pc- sets by the phases of the third and fifth coefficients.

Discrete Geometry for Computer Imagery

With such tools, the presented methods achieve multigrid convergent estimators of volume, moments and area in Z, of normals, curvature and curvature tensor in Z and Z, and of covariance measure and normals in Z even with Hausdorff noise.

S-adic expansions related to continued fractions

We consider S-adic expansions associated with continued fraction algorithms, where an S-adic expansion corresponds to an infinite composition of substitutions. Recall that a substitution is a

GENERALIZATION OF SUMS OF FRACTION PARTS AND THEIR APPLICATIONS TO NUMBER THEORY

In the paper a new multidimensional generalization of fraction part func-tion is introduced. We obtain a formula which express the number of points from the orbit of irrational shift

Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm

It is proved that these words have a factor complexity pn with lim sup pn/n<3, which provides a proof for the convergence of the associated algorithm by unique ergodicity.

References

SHOWING 1-10 OF 32 REFERENCES

Balances for fixed points of primitive substitutions

The number of steps in a finite JACOBI algorithm

Let x=(x1,...,xn) be a rational point and denote by L(x) the length of thefinite JACOBI algorithm associated with x. Let b(x) be the minimal common denominator of x. Then L(x)=const, log b(x) is true

Tilings associated with beta-numeration and substitutions.

This paper surveys different constructions and properties of some multiple tilings (that is, finite-to-one coverings) of the space that can be associated with beta-numeration and substitutions. It is

Linearly recurrent subshifts have a finite number of non-periodic subshift factors

  • F. Durand
  • Mathematics
    Ergodic Theory and Dynamical Systems
  • 2000
A minimal subshift $(X,T)$ is linearly recurrent (LR) if there exists a constant $K$ so that for each clopen set $U$ generated by a finite word, $u$, the return time to $U$, with respect to $T$, is

An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines

A dual viewpoint is introduced on these objects in order to measure the quality of approximation of these discrete segments with respect to the corresponding Euclidean segment and to relate the authors' discrete segments to finite patches that generate arithmetic discrete planes in a periodic way.

Complexity of sequences defined by billiard in the cube

— We prove a conjecture of Gérard Rauzy related to the structure of billiard trajectories in the cube : let us associate to any such trajectory the sequence with values in {1,2,3} given by coding 1

Complementing and Exactly Covering Sequences

Balanced Words

to 'An ABCDE' s World'. It is 'balanced' is not itself a CONTRAR I L Yare. (In this balanced.) So, what is a letters of a word (using A=l, of letters in the word, the of that word which, in the

Corrigendum and addendum to ‘Linearly recurrent subshifts have a finite number of non-periodic factors’

  • F. Durand
  • Mathematics
    Ergodic Theory and Dynamical Systems
  • 2003
We prove that a subshift (X,T) is linearly recurrent if and only if it is a primitive and proper S-adic subshift. This corrects Proposition 6 in F. Durand (Ergod. Th. &: Dynam. Sys.20 (2000),

Complexity of trajectories in rectangular billiards

To a trajectory of the billiard in a cube we assign its symbolic trajectory-the sequence of numbers of coordinate planes, to which the faces met by the trajectory are parallel. The complexity of the