Automata and finite order elements in the Nottingham group (Q2132478)

The Nottingham group over a finite prime field \(\mathbb{F}_p\) comprises the formal power series \(a\in\mathbb{F}_p[[t]]\) of the form \(a(t)=t+c_2t^2+\cdots\) under the binary operation of substitution. Explicit constructions of elements of finite order have been carried out only for elements of order \(p\) and elements of order \(4\) in the case \(p=2\). Here finite automata are used to characterize the elements of order \(p^n\) (in terms of their sequence of coefficients) for various values of \(p^n\). Behind this work is Christol's characterization of power series that are algebraic over \(\mathbb{F}_p(t)\) as those whose coefficient sequence is the output of an appropriate finite automata [\textit{G. Christol}, Theor. Comput. Sci. 9, 141--145 (1979; Zbl 0402.68044); \textit{G. Christol} et al., Bull. Soc. Math. Fr. 108, 401--419 (1980; Zbl 0472.10035)]. The approach is to use a totally ramified cyclic extension of \(\mathbb{F}_p((z))\) of degree \(p^n\) generated by elements algebraic over \(\mathbb{F}_p(z)\). Such a field is isomorphic to \(\mathbb{F}_p((t))\), so each generator of the Galois group of the extension defines an element of order \(p^n\). To arrive at explicit descriptions it is necessary to express a uniformizer of the extension field which maps to \(t\) as a rational function of the generators over \(\mathbb{F}_p((z))\), then find a polynomial with coefficients in \(\mathbb{F}_p(t)\) with a root given by the image of \(t\) under a generator of the Galois group. With an explicit form of Christol's theorem, this then gives a finite automaton generating the coefficients of an element of order \(p^n\) in the Nottingham group. This approach allows for the construction of several new finite-order elements.