Self-Inverse Sheffer Sequences and Riordan Involutions

Discrete Applied Mathematics 159 (2011) 1290–1292

Contents lists available at ScienceDirect

Discrete Applied Mathematics

journal homepage: www.elsevier.com/locate/dam

Note Self-inverse Sheffer sequences and Riordan involutions

Ana Luzón a,∗, Manuel A. Morón b a Departamento de Matemática Aplicada a los Recursos Naturales, E.T. Superior de Ingenieros de Montes, Universidad Politécnica de Madrid, 28040-Madrid, Spain b Departamento de Geometria y Topologia, Facultad de Matematicas, Universidad Complutense de Madrid, 28040- Madrid, Spain article info a b s t r a c t

Article history: In this short note, we focus on self-inverse Sheffer sequences and involutions in the Riordan Received 23 October 2009 group. We translate the results of Brown and Kuczma on self-inverse sequences of Sheffer Received in revised form 7 December 2010 polynomials to describe all involutions in the Riordan group. Accepted 25 March 2011 © 2011 Elsevier B.V. All rights reserved. Available online 8 May 2011

Keywords: Riordan group Involution Self-inverse Sheffer sequence

Very recently, first in [7] and later in [17], see also [12], a very close relation has been established between the Sheffer group and the Riordan group; see [15,16]. In fact, there is a natural isomorphism between both groups. This means that the group properties can be translated from one group to the other equivalently. One of those properties is the structure of their finite subgroups. In this short note, we focus on self-inverse Sheffer sequences and involutions in the Riordan group. They determine the corresponding subgroups of order 2. In fact, we translate the results of Brown and Kuczma [2] on self-inverse sequences of Sheffer polynomials to describe all involutions in the Riordan group. Although the translation is almost automatic, we think that it is still interesting to point it out, because of the relations to some problems about involutions in the Riordan group posed in [14] that motivated the paper [3] and that have recently been solved in [5]; see also [6,4]. In [8], the authors give some properties of the so-called A and Z sequences of any Riordan involution. There are also some related results on pages 2264–2265 of [11]. In a sense, we want to point out that some aspects of Shapiro’s problem were solved, even before it was posed, if we reinterpret it in terms of Sheffer sequences. In this paper, K always represents a field of characteristic zero and N is the set of natural numbers including 0. The notation used herein for Riordan arrays is that introduced in [10]; see also [11]. The natural translation from our notation to the classical notation is given by the formula

 f (t) t  T (f |g) = , (1) g(t) g(t) with g(0) ̸= 0. Up to the inconvenience that produces the fact that we call, following [1], a generalized Appell sequence associated = ∑ n to Hadamard invertible series h(x) n≥0 hnx simply the sequence obtained by multiplying by hn the n-term of the polynomial sequence named in the same way in [2], we have the following obvious result. The notation used below is that

∗ Corresponding author. Tel.: +34 913 366 399; fax: +34 915 439 557. E-mail addresses: [email protected] (A. Luzón), [email protected] (M.A. Morón).

x used in [12], the operation group ♯h is the umbral composition as is also described in [7] for the particular case h(x) = e , and ⋆ represents the Hadamard product of series.

= ∑ n Proposition 1. Let N be a natural number. Suppose a polynomial sequence of Riordan type (pn(x))n∈N and let h(x) n≥0 hnx ̸= ∀ ∈ h = be a series with hn 0 n N. Consider the Hadamard h-weighted sequence (pn(x)) (pn(x) ⋆ h(x)). Then, the N-fold umbral h N = composition, by means of ♯h, of the sequence (pn(x)) is the neutral element in (Rh, ♯h) if and only if D I in the Riordan group, = = ∑n k where D (dn,k) is the Riordan matrix given by pn(x) k=0 dn,kx .

n Remark 2. Note that the sequence en(x) = hnx is the neutral element in (Rh, ♯h). We now translate the results in [2] on self-inverse Sheffer sequences into Riordan involutions. In particular, using the results in Section 3 of [2], we can give a procedure to compute all the elements T (f | g) of the Riordan group such that T 2(f | g) = T (1 | 1) = I. First, if we impose g = 1, then T 2(f | g) = T (1 | 1) if and only if f = 1 or f = −1. To construct the remaining cases we proceed in the following way. = ∑ n ̸= | Choose any series φ n≥0 φnx with φ0 0. Consider the Riordan matrix T (1 φ). As a consequence of the results in [9], we get that T (1 | A) = T −1(1 | φ), where A is the so-called A-sequence of T (1 | φ); see [16,13]. It is clear that   x x = x  x  = x, that is, x is the inverse for the composition of the series x . Following [2], we take A φ φ A A φ x g =  . (2) x − x A φ = ∑ 2k−1 Choose now any odd power series u k≥1 u2k−1x , and take   ±x x u φ f =   e . (3) x − x A φ Consequently, we have the following.

Proposition 3. Any Riordan involution different from the identity I = T (1 | 1) and from −I = T (−1 | 1) is of the form T (f | g) for f and g satisfying (3) and (2), respectively. We want to point out that the pair of series f and g above is far from being univocally determined by φ and u. For example, consider the following.

Proposition 4. Let = ∑ xn be a series with ̸= 0. Suppose that x is the compositional inverse of x (equivalently that φ n≥0 φn φ0 A φ x A is the A-sequence of T (1 | φ)). Suppose also that g =   . Then g = −1 if and only if φ(x) = φ(−x) (i.e., φ is even). x − x A φ = − x Proof. Note that φ(x) φ( x) if and only if the series φ is odd. If is even, then x is odd. Since x is the compositional inverse of an odd power series, x is odd itself. Consequently, φ φ A A   − g = −1. On the other hand, if g = −1, then x − x = −x. Composing the right-hand side by x , we have x −x = x = A φ A A ( ) A(−x) − x . This implies that x is odd, and then is even. A(x) φ φ As we proved on page 2265 of [11], the Riordan matrices T (±1 | αx − 1) are involutions for any α ̸= 0. Now, we are going to recover this result using the construction above. In fact, we will get a more general class of Riordan involutions. Let α ̸= 0, and take αx φ(x) = . log(1 − αx) Consequently, αx A(x) = . 1 − eαx This implies that x g =   = αx − 1. x − x A φ We know that, if   u 1 log(1−αx) f = ±(αx − 1)e α , 1292 A. Luzón, M.A. Morón / Discrete Applied Mathematics 159 (2011) 1290–1292 then T (f | g) is an involution when u is an odd series. In particular, if u(x) = −αx, then we obtain that T (±1 | αx − 1) is a Riordan involution. From this point of view we have the following. The fact that the Pascal triangle is a pseudo-involution (see [3]) is equivalent to the fact that the classical family of Laguerre polynomials is self-inverse (see [2]).

Remark 5. Theorem 4.3 in [8] gives the expressions of the A-sequence and the Z-sequence of any Riordan involution. Using this theorem and the description of the involutions given in Proposition 3 above, we get that, if T (f˜|g˜) is an involution and A˜   u x ˜ x ˜ ±xe φ ˜ x and Z are the corresponding A-sequence and Z-sequence, respectively, then g˜(x) =   , f (x) =   , A(x) =   x − x x − x x − x A φ A φ A φ   u x ˜ δ±e φ and Z(x) =   , where φ is a series with φ(0) ̸= 0, A is the A-sequence of T (1|φ), and u is any odd power series. So the x − x A φ     u x   non-trivial Riordan involutions in the classical notation are ±e φ x − x , or equivalently ±eu(ω(x)) −1 − x , , A φ ( , ω ( ω( ))) where ω is any power series invertible for the composition operation. Moreover, using Theorem 4.3 in [8], we obtain − u(ω(x)) A˜(x) = x and Z˜(x) = ± 1 e . ω−1(−ω(x)) ω−1(−ω(x))    The results in Theorem 4.3 in [8] are also reflected in the formula T −1(f | g) = T g0 (A − xZ) A , which appears f0  in [9]. If T (f |g) is an involution, then f = g0 (A − xZ) and g = A. Using (1), the last equality converts to A(t) = t . Since f0 h(t) f0 g0 δ−d(t) δ = = d0,0, and using (1) again, we convert f = (A − xZ) into Z(t) = . g0 f0 h(t)

Acknowledgments

The first author was partially supported by DGES grant MICINN-FIS2008-04921-C02-02. The second author was partially supported by DGES grant MTM-2009-07030.

References

[1] R.P. Boas, R.C. Buck, Polynomial Expansions of Analytic Functions, Springer-Verlag, 1964. [2] J.W. Brown, M. Kuczma, Self-inverse Sheffer sequences, SIAM J. Math. Anal. 7 (3) (1976) 723–726. [3] N.T. Cameron, A. Nkwanta, On some (pseudo) involutions in the Riordan group, J. Integer Seq. 8 (2005) Article 05.3.7. [4] G.-S. Cheon, S.-T. Jin, H. Kim, L.W. Shapiro, Riordan group involutions and the ∆-sequence, Discrete Appl. Math. 157 (8) (2009) 1696–1701. [5] G.-S. Cheon, H. Kim, Simple proofs of open problems about the structure of involutions in the Riordan group, Linear Algebra Appl. 428 (2008) 930–940. [6] G.-S. Cheon, H. Kim, L.W. Shapiro, Riordan group involutions, Linear Algebra Appl. 428 (2008) 941–952. [7] T.-X. He, L.C. Hsu, P.J.-S. Shiue, The Sheffer group and the Riordan group, Discrete Appl. Math. 155 (2007) 1895–1909. [8] T.-X. He, R. Sprugnoli, Sequence characterization of Riordan arrays, Discrete Math. 22 (2009) 3962–3974. [9] A. Luzón, Iterative processes related to Riordan arrays: the reciprocation and the inversion of power series, Discrete Math. 310 (2010) 3607–3618. [10] A. Luzón, M.A. Morón, Ultrametrics, Banach’s fixed point theorem and the Riordan group, Discrete Appl. Math. 156 (2008) 2620–2635. [11] A. Luzón, M.A. Morón, Riordan matrices in the reciprocation of quadratic polynomials, Linear Algebra Appl. 430 (2009) 2254–2270. [12] A. Luzón, M.A. Morón, Recurrence relations for polynomial sequences via Riordan matrices, Linear Algebra Appl. 433 (2010) 1422–1446. [13] D.G. Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Math. 22 (1978) 301–310. [14] L.W. Shapiro, Some open question about random walks, involutions, limiting distributions, and generating functions, Adv. in Appl. Math. 27 (2001) 585–596. [15] L.W. Shapiro, S. Getu, W.J. Woan, L. Woodson, The Riordan group, Discrete Appl. Math. 34 (1991) 229–239. [16] R. Sprugnoli, Riordan arrays and combinatorial sums, Discrete Math. 132 (1994) 267–290. [17] W. Wang, T. Wang, Generalized Riordan arrays, Discrete Math. 308 (2008) 6466–6500.