2016/04/14 by Julien Roques · 6 citations
Computer Science · Mathematics · #semigroups and automata theory #Coding theory and cryptography #Advanced Combinatorial Mathematics
paper · pdf · doi:10.1090/tran/6945
In the last years, a number of authors have studied the algebraic relations between the generating series of automatic sequences. It turns out that these series are solutions of Mahler type equations. This paper is mainly concerned with the difference Galois groups of Mahler type equations (these groups reflect the algebraic relations between the solutions of the equations). In particular, we study in detail the equations of order <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="2"> <mml:semantics> <mml:mn>2</mml:mn> <mml:annotation encoding="application/x-tex">2</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and compute the difference Galois groups of classical equations related to the Baum-Sweet and to the Rudin-Shapiro automatic sequences.