Search arXivSearch

arXiv · 1907.00116

Roots of Formal Power Series and New Theorems on Riordan Group Elements

Abstract

Elements of the Riordan group $\cal R$ over a field $\mathbb F$ of characteristic zero are infinite lower triangular matrices which are defined in terms of pairs of formal power series. We wish to bring to the forefront, as a tool in the theory of Riordan groups, the use of multiplicative roots $a(x)^\frac{1}{n}$ of elements $a(x)$ in the ring of formal power series over $\mathbb F$ . Using roots, we give a Normal Form for non-constant formal power series, we prove a surprising simple Composition-Cancellation Theorem and apply this to show that, for a major class of Riordan elements (i.e., for non-constant $g(x)$ and appropriate $F(x)$), only one of the two basic conditions for checking that $\big(g(x), \, F(x)\big)$ has order $n$ in the group $\cal R$ actually needs to be checked. Using all this, our main result is to generalize C. Marshall [Congressus Numerantium, 229 (2017), 343-351] and prove: Given non-constant $g(x)$ satisfying necessary conditions, there exists a unique $F(x)$, given by an explicit formula, such that $\big(g(x), \, F(x)\big)$ is an involution in $\cal R$. Finally, as examples, we apply this theorem to ``aerated" series $h(x) = g(x^q),\ q\ \text{odd}$, to find the unique $K(x)$ such that $\big(h(x), K(x)\big)$ is an involution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marshall M. Cohen. 2019-06-28. Roots of Formal Power Series and New Theorems on Riordan Group Elements. https://arxiv.org/abs/1907.00116

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO