Complexity of sequences defined by billiard in the cube

From MaRDI portal
Publication:4288853

DOI10.24033/bsmf.2220zbMath0791.58034OpenAlexW2089093075MaRDI QIDQ4288853

Christian Mauduit, Pierre Arnoux, Jun-ichi Tamura, Iekata Shiokawa

Publication date: 26 May 1994

Published in: Bulletin de la Société mathématique de France (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=BSMF_1994__122_1_1_0




Related Items

Kinetic equation for soliton gas: integrable reductionsCanonical positions for the factors in paperfolding sequences\(m\)-balanced words: A generalization of balanced wordsAssigning multiple job types to parallel specialized serversThe subword complexity of a class of infinite binary wordsBilliard complexity in the hypercubeA geometrical characterization of factors of multidimensional billiard words and some applicationsSystems of conservation laws with third-order Hamiltonian structuresOn the structure of bispecial Sturmian wordsComplexity of cutting words on regular tilingsComplexity of trajectories in rectangular billiardsCertain sequences making a partition of the set of positive integersMinoration of the complexity function associated to a translation on the torusComplexité de suites définies par des billards rationnelsMinimal Complexities for Infinite Words Written with d LettersConstructing partial words with subword complexities not achievable by full wordsClassification of rotations on the torus \(\mathbb T^2\)Sturmian jungle (or garden?) on multiliteral alphabetsCombinatorial properties of sequences defined by the billiard in the tesselation trianglesDiscrete segments of \(\mathbb{Z}^3\) constructed by synchronization of wordsALGORITHMIC COMBINATORICS ON PARTIAL WORDSPalindromic factors of billiard words*-Sturmian words and complexityAsymptotic behavior in a heap model with two piecesOn smooth sets of integersDirectional complexity of the hypercubic billiardCombinatorics on patterns of a bidimensional Sturmian sequenceStatistics of patterns in typical cut and project setsFine and Wilf's theorem for three periods and a generalization of Sturmian wordsA Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information



Cites Work