Elements of Finite Order in the Group of Formal Power Series Under Composition
Marshall M. Cohen (Morgan State University)

TL;DR
This paper studies elements of finite order in the group of formal power series under composition, proving conjugacy to linear terms and constructing elements of specific orders with unique coefficient sequences.
Contribution
It provides a characterization of finite order elements and a method to construct such elements with prescribed properties, including possibly new proofs.
Findings
Finite order elements are conjugate to their linear part.
Construction of order n elements given a primitive n-th root of unity.
Unique sequences of coefficients determine elements of a given finite order.
Abstract
We consider formal power series , with coefficients in a field of characteristic . These form a group under the operation of composition (= substitution). We prove (Theorem 1) that every element of finite order is conjugate to its linear term , and we characterize those elements which conjugate to . Then we investigate the construction of elements of order and prove (Theorem 2) that, given a primitive 'th root of unity and an arbitrary sequence there is a unique sequence such that the series has order . Sections 1 - 5 give an exposition of this classical subject, written for the 2005 - 2006 Morgan State University Combinatorics Seminar. We do not claim priority for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · semigroups and automata theory · Coding theory and cryptography
