English

Elements of Finite Order in the Riordan Group and Their Eigenvectors

Combinatorics 2019-02-07 v4

Abstract

We consider elements of finite order in the Riordan group R\cal R over a field of characteristic 00. Viewing R\cal R as a semi-direct product of groups of formal power series, we solve, for all n2n \geq 2, two foundational questions posed by L. Shapiro for the case n=2n = 2 (`involutions'): Given a formal power series F(x)F(x) of finite compositional order and an integer n2n\geq 2, Theorem 1 states, exactly which g(x)g(x) make (g(x),F(x))\big(g(x), F(x)\big) a Riordan element of order nn. Theorem 2 classifies finite-order Riordan group elements up to conjugation in R\cal R. Viewing R\cal R as a group of infinite lower triangular matrices, we interpret Theorem 1 in terms of existence of eigenvectors and Theorem 2 as a normal form for finite order Riordan arrays under similarity. These lead to Theorem 3, a formula for all eigenvectors of finite order Riordan arrays; and we show how this can lead to interesting combinatorial identities. We then relate our work to papers of Cheon and Kim which motivated this paper and we solve the Open question which they posed. Finally, this circle of ideas gives a new proof of C. Marshall's theorem, which finds the unique F(x)F(x), given bi-invertible g(x)g(x), such that (g(x),F(x))\big(g(x), F(x)) is an involution.

Keywords

Cite

@article{arxiv.1806.06432,
  title  = {Elements of Finite Order in the Riordan Group and Their Eigenvectors},
  author = {Marshall M. Cohen},
  journal= {arXiv preprint arXiv:1806.06432},
  year   = {2019}
}

Comments

25 pages. Version 4 corrects the statement of Example 5.6 in the case when $n$ is odd, and adjusts the last four lines of the proof accordingly