14, pages 505-584 of: Issac Woungang, Sudip Misra, S. Variable-length codes and finite automata. Béal, M.-P., Berstel, J., Marcus, B., et al.Discrete Applied Mathematics, 169, 15-29. Error-Correcting Codes: A Mathematical Introduction. On combinatorics and statistical mechanics. Planar lattice gases with nearest-neighbor exclusion. Minimum and maximum order of magnitude of the discrepancy of (na). Manuscript available electronically at arXiv:1406.0263. Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., and Tsuruta, K.A new characterization of maximal repetitions by Lyndon trees. World Scientific Publishing Co., Inc., River Edge, NJ. Advanced Series in Nonlinear Dynamics, vol. Positive Transfer Operators and Decay of Correlations. Manuscript available electronically at arXiv:1302.4302. Expansions in non-integer bases: lower order revisited. Manuscript available electronically at arXiv:0710.3001. Greedy and quasi-greedy expansions in non-integer bases. Finite repetition threshold for large alphabets. Badkobeh, G., Crochemore, M., and Rao, M.Bounded number of squares in infinite repetitionconstrained binary words. Fewest repetitions versus maximal-exponent powers in infinite binary words. Unique expansions in integer bases with extended alphabets. Simulation of effective subshifts by two-dimensional subshifts. Assem, I., Reutenauer, C., and Smith, D.Friezes and a construction of the Euclidean cluster variables. (A modern approach.) Cambridge University Press. Discrete and Continuous Dynamical Systems, 34(11), 4389-4418. Journal of Modern Dynamics (JMD), 4, 611-629. Veech surfaces with nonperiodic directions in the trace field. Topology and statistics of formulae of arithmetics. Optimal superprimitivity testing for strings. Apostolico, A., Farach, M., and Iliopoulos, C.Optimal off-line detection of repetitions in a string. Efficient detection of quasiperiodicities in strings. Pages 236-248 of: Structures in Logic and Computer Science. Of periods, quasiperiods, repetitions and covers. Pages 91-100 of: Brlek, S., and Reutenauer, C. Palindromes and pseudo-palindromes in episturmian and pseudo-episturmian infinite words. Random Structures and Algorithms, 21, 336-346. Alon, N., Grytczuk, J., Haluszczak, M., and Riordan, O.Periodicity, repetitions, and orbits of an automatic sequence. Allouche, J.-P., Rampersad, N., and Shallit, J.Extremal infinite overlap-free binary words. (Theory, applications, generalizations.) Cambridge University Press. (eds.), Sequences and Their Applications, Proceedings of SETA '98. Pages 1-16 of: Ding, C., Helleseth, T., and Niederreiter, H. The ubiquitous Prouhet-Thue-Morse sequence. The Komornik-Loreti constant is transcendental. Agrawal, M., Kayal, N., and Saxena, N.Equivalence of topological Markov shifts. Topological entropy and equivalence of dynamical systems. Encyclopedia of Mathematics and its Applications, vol. (eds.), Combinatorics, Automata, and Number Theory. Transcendence and Diophantine approximation. The number of ternary words avoiding abelian cubes grows exponentially. A cyclic binary morphism avoiding Abelian fourth powers. It will also interest biologists using text algorithms. The book will appeal to graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, tilings and stringology. Each topic is presented in a way that links it to the main themes, but then they are also extended to repetitions in words, similarity relations, cellular automata, friezes and Dynkin diagrams. Topics include combinatorics on words, pattern avoidance, graph theory, tilings and theory of computation, multidimensional subshifts, discrete dynamical systems, ergodic theory, numeration systems, dynamical arithmetics, automata theory and synchronised words, analytic combinatorics, continued fractions and probabilistic models. They explain the important concepts, providing a clear exposition of some recent results, and emphasise the emerging connections between these different fields. Internationally recognised researchers look at developing trends in combinatorics with applications in the study of words and in symbolic dynamics.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |