DOCSLIB.ORG

Finite Operator Calculus with Applications to Linear Recursions

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Finite Operator Calculus with Applications to Linear Recursions Finite Operator Calculus With Applications to Linear Recursions Heinrich Niederhausen Florida Atlantic University Boca Raton [email protected] www.math.fau.edu/Niederhausen 2 Contents Contents i 1 Prerequisites from the Theory of Formal Power Series 1 1.1 Generating Functions and Linear Recursions . 2 1.1.1 Roots . 9 1.1.2 Exercises . 10 1.2 Composition and Inverses . 13 1.2.1 Exercises . 15 1.3 Multivariate Power Series . 17 1.3.1 Exercises . 20 2 Finite Operator Calculus in One Variable 21 2.1 Polynomials, Operators, and Functionals . 21 2.1.1 The Vector Space of Polynomials, and Their Bases . 22 2.1.2 Standard Bases and Linear Operators . 25 2.1.3 Exercises . 26 2.2 Finite Operators . 27 2.2.1 Translation Operators . 28 2.2.2 Basic Sequences and Delta Operators . 30 2.2.3 Special Cases . 32 2.2.4 Exercises . 40 2.3 Sheffer Sequences . 44 2.3.1 Initial Values Along a Line . 47 2.3.2 The Umbral Group . 51 2.3.3 Special Cases . 54 2.3.4 Exercises . 63 2.4 Transfer Theorems . 69 2.4.1 Umbral shifts and the Pincherle derivative . 73 2.4.2 Proof of the Transfer Formula . 74 2.4.3 Exercises . 76 ii CONTENTS 3 Applications 79 3.1 The Functional Expansion Theorem . 79 3.1.1 Some Applications of the Functional Expansion Theorem . 83 3.1.2 Exercises . 87 3.2 Diagonals of Riordan Matrices as Values of Sheffer Sequences . 89 3.2.1 Exercises . 93 3.3 Determinants of Hankel Matrices . 94 3.3.1 Exercises . 100 3.4 Classical Umbral Calculus . 102 3.4.1 The Cumulant Umbra . 109 3.4.2 Exercises . 111 4 Finite Operator Calculus in Several Variables 113 4.1 Polynomials and Operators in Several Variables . 114 4.1.1 Exercises . 117 4.2 The Multivariate Transfer Formulas . 119 4.2.1 Transfer with constant coeffi cients . 119 4.2.2 Operator based transfer . 121 4.2.3 The multivariate Pincherle derivative . 123 4.2.4 Transfer with operator coeffi cients . 128 4.2.5 Exercises . 131 4.3 The Multivariate Functional Expansion Theorem . 134 4.3.1 Exercises . 136 5 Special Constructions in Several Variables 137 5.1 Multi-indexed Sheffer Sequences . 137 5.1.1 Delta Operators for multi-indexed Sheffer sequences. 139 5.1.2 Translation invariance of diagonalization, and some examples.140 5.1.3 Abelization of Multi-Indexed Sequences . 142 5.1.4 Exercises . 147 5.2 Polynomials with all but one variable equal to 0 . 150 5.2.1 Exercises . 153 5.3 Cross-Sequences and Steffensen Sequences . 153 5.3.1 Exercises . 155 6 A General Finite Operator Calculus 157 6.1 Transforms of Operators . 157 6.2 Reference Frames, Sheffer Sequences, and Delta Operators . 162 6.2.1 Reference Frames . 162 6.2.2 Sheffer Sequences and Delta Operators . 165 6.2.3 Exercises . 169 6.3 Transfer Formulas . 171 6.3.1 General Umbral Shifts and the Pincherle Derivative . 171 6.3.2 Equivalent Transfer Formulas . 173 CONTENTS iii 6.3.3 Exercises . 175 6.4 Functionals . 176 6.4.1 Augmentation . 179 6.4.2 Orthogonality . 179 6.4.3 Exercises . 184 7 Applications of the General Theory 187 7.1 The Binomial Reference Frame . 188 7.1.1 Orthogonal Binomial Reference Sequences . 189 7.1.2 Generalized Catalan Operators . 195 7.1.3 Dickson Polynomials . 197 7.1.4 Exercises . 200 7.2 Eulerian Differential Operators . 204 7.2.1 Exercises . 209 8 Solutions to Exercises 211 Bibliography 257 iv CONTENTS Preface The following text originated from various lecture notes for graduate courses in combinatorics. I would very much appreciate receiving your comments, additions and corrections. My apologies to all those mathematicians not mentioned in the text, their important contributions to the theory of the Finite Operator Calculus skipped over because of ignorance or by design in order to keep the material manageable. Your views can still be included - please let me know: [email protected]. Introduction n Every linear operator T on polynomials has a representation T = n 0 M(pn) , ≥ D where is the derivative operator, and M(pn) stands for multiplication by the D P polynomial pn (x) (Pincherle [74, 1901]). When applied to polynomials, the oper- ator T reduces to a finite sum, of course, and may therefore be called a “finite” n operator. A special case of this concept, when T can be written as T = n 0 cn , ≥ D where c0, c1,... are scalars, is called a called a finite operator in the “Finite Op- erator Calculus” [83, 1973] by G.-C. Rota and his students D. KahanerP and A. n Odlyzko. Hence T is isomorphic to the formal power series n 0 cnt , and it is of course exactly this isomorphism that made the Finite Operator≥ Calculus so widely applicable. We adopt Rota’s approach in this book, but consider,P in the last two n chapters, also linear operators of the form T = n 0 cn , where can be any linear operator reducing the degree by 1, deg ( q) =≥ deg qR 1 for all polynomialsR q of degree larger than 0, and q = 0 for polynomialsR P of degree 0 (we identify polyno- mials of degree 0 with scalarsR c = 0; however, we let deg (0) = , as usual). The fundamental difference between6 Rota’s approach and the generalized1 version we n present, due to J. M. Freeman [35, 1985], also his student, is that T = n 0 cn is translation invariant, TEc = EcT , where Ec : f (x) f (x + c) is the operator≥ D translating by c. The generalized version does not have7! this property.P Translation invariance, however, is an important feature in many applications. The applications we have in mind are usually the solutions to recursive equa- tions. Suppose your analysis of a given enumerative problem resulted in a recursive expression for the numbers you are looking for; to be specific, let us assume you arrived at Fm = Fm 1 + Fm 2, the recursion for the Fibonacci numbers, starting at F0 = F1 = 1. A computer will give us “special”answers in a very short time, even F10,000 makes no problem whatsoever. From this point of view, you will not need this book. However, finding n+1 n+1 n+1 out that Fn = 1 + p5 1 p5 / 2 p5 is as surprising as it is rewarding. In addition, it is even “practical”; a scientific calculator will show that 2089 F10,000 5.4 10 . It also tells you something about the ratio, Fn/Fn 1, and CONTENTS v its famous limit, the Golden Ratio. Generating functions are the standard tool for solving this type of linear recursion. We give a brief introduction in the first chapter. The reader familiar with formal power series may just want to browse through section 1.2 for the notation. Now suppose the recursion you found was Fn (m) = Fn (m 1) + Fn 1 (m 2) , with initial conditions Fn (n) = Fn 1 (n) for n 1, and F0 (m) = 1 for all m. The recursion is still easy, but the initial values≥ are also “recursive” - we have to know Fn 1 (n) before we can say what the value of Fn (n) is. We will see that F0 (x) ,F1(x),... is a sequence of polynomials, actually a basis, and that the operator T : Fn (x) Fn 1 (x) is a translation invariant operator, satisfying the operator equation 7! 1 2 I = E + E T. We will show in chapters 2 and 3.1 how to find the solution with given initial values from such an equation. Suppose you found the system of recursion sm,n (u, v) = sm,n (u 1, v) + sm 1,n (u, v + 2) and sm,n (u, v) = sm,n (u, v 1) + sm,n 1 (u + 1, v + 1) sm,n 2 (u, v) , with initial values sm,n (0, 0) = 0 for all m, n 0, except s0,0 (0, 0) = 1. This system of recursions is two dimensional and linear,≥ the initial values are explicit. We show how to write sn,m (u, v) as a sum of binomial coeffi cients in chapters 3.1 and 5, dedicated to the multivariate Finite Operator Calculus. Technically the problems get more diffi cult to solve, of course, when it comes to higher dimensions. The theory, however, remains quite easy. Somewhere between the univariate and the multivariate case fall the Steffensen sequences (section 5.3) and the multi- indexed sequences (section 5.1). Rota’s goal was to create a solid foundation for the “Umbral Calculus”, to purge it of the “witchcraft”, as he called it. This was one of his favorite themes, and he wrote more papers on Umbral Calculus later. Several young (at that time) mathematicians took up his work, and showed that it had applications to a va- riety of mathematical topics, including approximation theory, signal processing, probability theory, and, of course, combinatorics. After all, the “Finite Operator Calculus”was published a part VIII in a series of papers “On the Foundations of Combinatorial Theory”. A complete survey of papers relating to Umbral Calcu- lus until the year 2000 has been compiled by Di Bucchianico and Loeb [26]. An application of the Finite Operator Calculus can also be found in Taylor [96, 1998]. We assume that after 5 chapters the reader will get interested in the theory itself. J. M. Freeman explored this generalization in some depth [35], and we follow it literally in the last two chapters.
Load more

Recommended publications
  • 18.102 Introduction to Functional Analysis Spring 2009
    MIT OpenCourseWare http://ocw.mit.edu 18.102 Introduction to Functional Analysis Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 108 LECTURE NOTES FOR 18.102, SPRING 2009 Lecture 19. Thursday, April 16 I am heading towards the spectral theory of self-adjoint compact operators. This is rather similar to the spectral theory of self-adjoint matrices and has many useful applications. There is a very effective spectral theory of general bounded but self- adjoint operators but I do not expect to have time to do this. There is also a pretty satisfactory spectral theory of non-selfadjoint compact operators, which it is more likely I will get to. There is no satisfactory spectral theory for general non-compact and non-self-adjoint operators as you can easily see from examples (such as the shift operator). In some sense compact operators are ‘small’ and rather like finite rank operators. If you accept this, then you will want to say that an operator such as (19.1) Id −K; K 2 K(H) is ‘big’. We are quite interested in this operator because of spectral theory. To say that λ 2 C is an eigenvalue of K is to say that there is a non-trivial solution of (19.2) Ku − λu = 0 where non-trivial means other than than the solution u = 0 which always exists. If λ =6 0 we can divide by λ and we are looking for solutions of −1 (19.3) (Id −λ K)u = 0 −1 which is just (19.1) for another compact operator, namely λ K: What are properties of Id −K which migh show it to be ‘big? Here are three: Proposition 26.
    [Show full text]
  • Curl, Divergence and Laplacian
    Curl, Divergence and Laplacian What to know: 1. The definition of curl and it two properties, that is, theorem 1, and be able to predict qualitatively how the curl of a vector field behaves from a picture. 2. The definition of divergence and it two properties, that is, if div F~ 6= 0 then F~ can't be written as the curl of another field, and be able to tell a vector field of clearly nonzero,positive or negative divergence from the picture. 3. Know the definition of the Laplace operator 4. Know what kind of objects those operator take as input and what they give as output. The curl operator Let's look at two plots of vector fields: Figure 1: The vector field Figure 2: The vector field h−y; x; 0i: h1; 1; 0i We can observe that the second one looks like it is rotating around the z axis. We'd like to be able to predict this kind of behavior without having to look at a picture. We also promised to find a criterion that checks whether a vector field is conservative in R3. Both of those goals are accomplished using a tool called the curl operator, even though neither of those two properties is exactly obvious from the definition we'll give. Definition 1. Let F~ = hP; Q; Ri be a vector field in R3, where P , Q and R are continuously differentiable. We define the curl operator: @R @Q @P @R @Q @P curl F~ = − ~i + − ~j + − ~k: (1) @y @z @z @x @x @y Remarks: 1.
    [Show full text]
  • New Bell–Sheffer Polynomial Sets
    axioms Article New Bell–Sheffer Polynomial Sets Pierpaolo Natalini 1,* and Paolo Emilio Ricci 2 1 Dipartimento di Matematica e Fisica, Università degli Studi Roma Tre, Largo San Leonardo Murialdo, 1, 00146 Roma, Italy 2 Sezione di Matematica, International Telematic University UniNettuno, Corso Vittorio Emanuele II, 39, 00186 Roma, Italy; [email protected] * Correspondence: [email protected] Received: 20 July 2018; Accepted: 2 October 2018; Published: 8 October 2018 Abstract: In recent papers, new sets of Sheffer and Brenke polynomials based on higher order Bell numbers, and several integer sequences related to them, have been studied. The method used in previous articles, and even in the present one, traces back to preceding results by Dattoli and Ben Cheikh on the monomiality principle, showing the possibility to derive explicitly the main properties of Sheffer polynomial families starting from the basic elements of their generating functions. The introduction of iterated exponential and logarithmic functions allows to construct new sets of Bell–Sheffer polynomials which exhibit an iterative character of the obtained shift operators and differential equations. In this context, it is possible, for every integer r, to define polynomials of higher type, which are linked to the higher order Bell-exponential and logarithmic numbers introduced in preceding papers. Connections with integer sequences appearing in Combinatorial analysis are also mentioned. Naturally, the considered technique can also be used in similar frameworks, where the iteration of exponential and logarithmic functions appear. Keywords: Sheffer polynomials; generating functions; monomiality principle; shift operators; combinatorial analysis 1. Introduction In recent articles [1,2], new sets of Sheffer [3] and Brenke [4] polynomials, based on higher order Bell numbers [2,5–7], have been studied.
    [Show full text]
  • Numerical Operator Calculus in Higher Dimensions
    Numerical operator calculus in higher dimensions Gregory Beylkin* and Martin J. Mohlenkamp Applied Mathematics, University of Colorado, Boulder, CO 80309 Communicated by Ronald R. Coifman, Yale University, New Haven, CT, May 31, 2002 (received for review July 31, 2001) When an algorithm in dimension one is extended to dimension d, equation using only one-dimensional operations and thus avoid- in nearly every case its computational cost is taken to the power d. ing the exponential dependence on d. However, if the best This fundamental difficulty is the single greatest impediment to approximate solution of the form (Eq. 1) is not good enough, solving many important problems and has been dubbed the curse there is no way to improve the accuracy. of dimensionality. For numerical analysis in dimension d,we The natural extension of Eq. 1 is the form propose to use a representation for vectors and matrices that generalizes separation of variables while allowing controlled ac- r ͑ ͒ ϭ ͸ ␾l ͑ ͒ ␾l ͑ ͒ curacy. Basic linear algebra operations can be performed in this f x1,...,xd sl 1 x1 ··· d xd . [2] representation using one-dimensional operations, thus bypassing lϭ1 the exponential scaling with respect to the dimension. Although not all operators and algorithms may be compatible with this The key quantity in Eq. 2 is r, which we call the separation rank. representation, we believe that many of the most important ones By increasing r, the approximate solution can be made as are. We prove that the multiparticle Schro¨dinger operator, as well accurate as desired.
    [Show full text]
  • Poly-Bernoulli Polynomials Arising from Umbral Calculus
    Poly-Bernoulli polynomials arising from umbral calculus by Dae San Kim, Taekyun Kim and Sang-Hun Lee Abstract In this paper, we give some recurrence formula and new and interesting identities for the poly-Bernoulli numbers and polynomials which are derived from umbral calculus. 1 Introduction The classical polylogarithmic function Lis(x) are ∞ xk Li (x)= , s ∈ Z, (see [3, 5]). (1) s ks k X=1 In [5], poly-Bernoulli polynomials are defined by the generating function to be −t ∞ n Li (1 − e ) (k) t k ext = eB (x)t = B(k)(x) , (see [3, 5]), (2) 1 − e−t n n! n=0 X (k) n (k) with the usual convention about replacing B (x) by Bn (x). As is well known, the Bernoulli polynomials of order r are defined by the arXiv:1306.6697v1 [math.NT] 28 Jun 2013 generating function to be t r ∞ tn ext = B(r)(x) , (see [7, 9]). (3) et − 1 n n! n=0 X (r) In the special case, r = 1, Bn (x)= Bn(x) is called the n-th ordinary Bernoulli (r) polynomial. Here we denote higher-order Bernoulli polynomials as Bn to avoid 1 conflict of notations. (k) (k) If x = 0, then Bn (0) = Bn is called the n-th poly-Bernoulli number. From (2), we note that n n n n B(k)(x)= B(k) xl = B(k)xn−l. (4) n l n−l l l l l X=0 X=0 Let F be the set of all formal power series in the variable t over C as follows: ∞ tk F = f(t)= ak ak ∈ C , (5) ( k! ) k=0 X P P∗ and let = C[x] and denote the vector space of all linear functionals on P.
    [Show full text]
  • 23. Kernel, Rank, Range
    23. Kernel, Rank, Range We now study linear transformations in more detail. First, we establish some important vocabulary. The range of a linear transformation f : V ! W is the set of vectors the linear transformation maps to. This set is also often called the image of f, written ran(f) = Im(f) = L(V ) = fL(v)jv 2 V g ⊂ W: The domain of a linear transformation is often called the pre-image of f. We can also talk about the pre-image of any subset of vectors U 2 W : L−1(U) = fv 2 V jL(v) 2 Ug ⊂ V: A linear transformation f is one-to-one if for any x 6= y 2 V , f(x) 6= f(y). In other words, different vector in V always map to different vectors in W . One-to-one transformations are also known as injective transformations. Notice that injectivity is a condition on the pre-image of f. A linear transformation f is onto if for every w 2 W , there exists an x 2 V such that f(x) = w. In other words, every vector in W is the image of some vector in V . An onto transformation is also known as an surjective transformation. Notice that surjectivity is a condition on the image of f. 1 Suppose L : V ! W is not injective. Then we can find v1 6= v2 such that Lv1 = Lv2. Then v1 − v2 6= 0, but L(v1 − v2) = 0: Definition Let L : V ! W be a linear transformation. The set of all vectors v such that Lv = 0W is called the kernel of L: ker L = fv 2 V jLv = 0g: 1 The notions of one-to-one and onto can be generalized to arbitrary functions on sets.
    [Show full text]
  • On Multivariable Cumulant Polynomial Sequences with Applications E
    JOURNAL OF ALGEBRAIC STATISTICS Vol. 7, No. 1, 2016, 72-89 ISSN 1309-3452 { www.jalgstat.com On multivariable cumulant polynomial sequences with applications E. Di Nardo1,∗ 1 Department of Mathematics \G. Peano", Via Carlo Alberto 10, University of Turin, 10123, I-Turin, ITALY Abstract. A new family of polynomials, called cumulant polynomial sequence, and its extension to the multivariate case is introduced relying on a purely symbolic combinatorial method. The coefficients are cumulants, but depending on what is plugged in the indeterminates, moment se- quences can be recovered as well. The main tool is a formal generalization of random sums, when a not necessarily integer-valued multivariate random index is considered. Applications are given within parameter estimations, L´evyprocesses and random matrices and, more generally, problems involving multivariate functions. The connection between exponential models and multivariable Sheffer polynomial sequences offers a different viewpoint in employing the method. Some open problems end the paper. 2000 Mathematics Subject Classifications: 62H05; 60C05; 11B83, 05E40 Key Words and Phrases: multi-index partition, cumulant, generating function, formal power series, L´evyprocess, exponential model 1. Introduction The so-called symbolic moment method has its roots in the classical umbral calculus developed by Rota and his collaborators since 1964; [15]. Rewritten in 1994 (see [17]), what we have called moment symbolic method consists in a calculus on unital number sequences. Its basic device is to represent a sequence f1; a1; a2;:::g with the sequence 2 f1; α; α ;:::g of powers of a symbol α; named umbra. The sequence f1; a1; a2;:::g is said to be umbrally represented by the umbra α: The main tools of the symbolic moment method are [7]: a) a polynomial ring C[A] with A = fα; β; γ; : : :g a set of symbols called umbrae; b) a unital operator E : C[A] ! C; called evaluation, such that i i) E[α ] = ai for non-negative integers i; ∗Corresponding author.
    [Show full text]
  • Degenerate Poly-Bernoulli Polynomials with Umbral Calculus Viewpoint Dae San Kim1,Taekyunkim2*, Hyuck in Kwon2 and Toufik Mansour3
    Kim et al. Journal of Inequalities and Applications (2015)2015:228 DOI 10.1186/s13660-015-0748-7 R E S E A R C H Open Access Degenerate poly-Bernoulli polynomials with umbral calculus viewpoint Dae San Kim1,TaekyunKim2*, Hyuck In Kwon2 and Toufik Mansour3 *Correspondence: [email protected] 2Department of Mathematics, Abstract Kwangwoon University, Seoul, 139-701, S. Korea In this paper, we consider the degenerate poly-Bernoulli polynomials. We present Full list of author information is several explicit formulas and recurrence relations for these polynomials. Also, we available at the end of the article establish a connection between our polynomials and several known families of polynomials. MSC: 05A19; 05A40; 11B83 Keywords: degenerate poly-Bernoulli polynomials; umbral calculus 1 Introduction The degenerate Bernoulli polynomials βn(λ, x)(λ =)wereintroducedbyCarlitz[ ]and rediscovered by Ustinov []underthenameKorobov polynomials of the second kind.They are given by the generating function t tn ( + λt)x/λ = β (λ, x) . ( + λt)/λ – n n! n≥ When x =,βn(λ)=βn(λ, ) are called the degenerate Bernoulli numbers (see []). We observe that limλ→ βn(λ, x)=Bn(x), where Bn(x)isthenth ordinary Bernoulli polynomial (see the references). (k) The poly-Bernoulli polynomials PBn (x)aredefinedby Li ( – e–t) tn k ext = PB(k)(x) , et – n n! n≥ n where Li (x)(k ∈ Z)istheclassicalpolylogarithm function given by Li (x)= x (see k k n≥ nk [–]). (k) For = λ ∈ C and k ∈ Z,thedegenerate poly-Bernoulli polynomials Pβn (λ, x)arede- fined by Kim and Kim to be Li ( – e–t) tn k ( + λt)x/λ = Pβ(k)(λ, x) (see []).
    [Show full text]
  • Some New Identities Involving Sheffer-Appell Polynomial Sequences Via Matrix Approach
    SOME NEW IDENTITIES INVOLVING SHEFFER-APPELL POLYNOMIAL SEQUENCES VIA MATRIX APPROACH MOHD SHADAB, FRANCISCO MARCELLAN´ AND SAIMA JABEE∗ Abstract. In this contribution some new identities involving Sheffer-Appell polyno- mial sequences using generalized Pascal functional and Wronskian matrices are de- duced. As a direct application of them, identities involving families of polynomials as Euler, Bernoulli, Miller-Lee and Apostol-Euler polynomials, among others, are given. 1. introduction Sequences of polynomials play an important role in many problems of pure and applied mathematics in the framework of approximation theory, statistics, combinatorics and classical analysis (see, for example, [19, 22{25]). The sequence of Sheffer polynomials constitutes one of the most important family of polynomial sequences. A polynomial sequence fsn(x)gn≥0 is said to be a Sheffer polynomial sequence [6, 9, 24, 27] if its generating function has the following form: 1 X yn A(y)exH(y) = s (x) ; (1.1) n n! n=0 where A(y) = A0 + A1y + ··· ; and 2 H(y) = H1y + H2y + ··· ; with A0 6= 0 and H1 6= 0. Let us recall an alternative definition of the Sheffer polynomial sequences [24, Pg. 17]. P1 yn P1 yn Indeed, let h(y) = n=1 hn n! ; h1 6= 0; and l(y) = n=0 ln n! , l0 6= 0; be, respectively, delta series and invertible series with complex coefficients. Then there exists a unique sequence of Sheffer polynomials fsn(x)gn≥0 satisfying the orthogonality conditions k hl(y)h(y) jsn(x)i = n!δn;k 8 n; k = 0; (1.2) where δn;k is the Kronecker delta.
    [Show full text]
  • L-Series and Hurwitz Zeta Functions Associated with the Universal Formal Group
    Ann. Scuola Norm. Sup. Pisa Cl. Sci. (5) Vol. IX (2010), 133-144 L-series and Hurwitz zeta functions associated with the universal formal group PIERGIULIO TEMPESTA Abstract. The properties of the universal Bernoulli polynomials are illustrated and a new class of related L-functions is constructed. A generalization of the Riemann-Hurwitz zeta function is also proposed. Mathematics Subject Classification (2010): 11M41 (primary); 55N22 (sec- ondary). 1. Introduction The aim of this article is to establish a connection between the theory of formal groups on one side and a class of generalized Bernoulli polynomials and Dirichlet series on the other side. Some of the results of this paper were announced in the communication [26]. We will prove that the correspondence between the Bernoulli polynomials and the Riemann zeta function can be extended to a larger class of polynomials, by introducing the universal Bernoulli polynomials and the associated Dirichlet series. Also, in the same spirit, generalized Hurwitz zeta functions are defined. Let R be a commutative ring with identity, and R {x1, x2,...} be the ring of formal power series in x1, x2,...with coefficients in R.Werecall that a commuta- tive one-dimensional formal group law over R is a formal power series (x, y) ∈ R {x, y} such that 1) (x, 0) = (0, x) = x 2) ( (x, y) , z) = (x,(y, z)) . When (x, y) = (y, x), the formal group law is said to be commutative. The existence of an inverse formal series ϕ (x) ∈ R {x} such that (x,ϕ(x)) = 0 follows from the previous definition.
    [Show full text]
  • A New Formula of Q-Fubini Numbers Via Goncharov Polynomials
    A NEW FORMULA OF q-FUBINI NUMBERS VIA GONC˘AROV POLYNOMIALS Adel Hamdi 20 aoˆut 2019 Faculty of Science of Gabes, Department of Mathematics, Cit´eErriadh 6072, Zrig, Gabes, Tunisia Abstract Connected the generalized Gon˘carov polynomials associated to a pair (∂, Z) of a delta operator ∂ and an interpolation grid Z, introduced by Lorentz, Tringali and Yan in [7], with the theory of binomial enumeration and order statistics, a new q-deformed of these polynomials given in this paper allows us to derive a new combinatorial formula of q-Fubini numbers. A combinatorial proof and some nice algebraic and analytic properties have been expanded to the q-deformed version. Keywords: q-delta operators, polynomials of q-binomial type, Gon˘carov polynomials, order partitions, q-Fubini numbers. 2010 Mathematics Subject Classification. 05A10, 41A05, 05A40. 1 Introduction This paper grew out of the recent work, generalized Gon˘carov polynomials, of Lo- rentz, Tringali and Yan in [7] where these polynomials are seen as a basis of solutions for the Interpolation problem : Find a polynomial f(x) of degree n such that the ith delta operator ∂ of f(x) at a given complex number ai has value bi, for i = 0, 1, 2, .... There is a natural q-analog of this interpolation by replacing the delta operator with a q-delta arXiv:1908.06939v1 [math.CO] 19 Aug 2019 operator, we extend these polynomials into a generalized q-Gon˘carov basis (tn,q(x))n≥0, i N defined by the q-biorthogonality relation εzi (∂q(tn,q(x))) = [n]q!δi,n, for all i, n ∈ , where Z = (zi)i≥0 is a sequence of scalars and εzi the evaluation at zi.
    [Show full text]
  • Pp. 101–130. the Classical Umbral Calculus
    Lecture Notes of Seminario Interdisciplinare di Matematica Vol. 8(2009), pp. 101–130. The classical umbral calculus: She↵er sequences Elvira Di Nardo, Heinrich Niederhausen and Domenico Senato Abstract1. Following the approach of Rota and Taylor [17], we present an innovative theory of She↵er sequences in which the main properties are encoded by using umbrae. This syntax allows us noteworthy computational simplifications and conceptual clarifica- tions in many results involving She↵er sequences. To give an indication of the e↵ectiveness of the theory, we describe applications to the well-known connection constants problem, to Lagrange inversion formula and to solving some recurrence relations. 1. Introduction As well known, many polynomial sequences like Laguerre polynomials, first and second kind Meixner polynomials, Poisson-Charlier polynomials and Stirling poly- nomials are She↵er sequences. She↵er sequences can be considered the core of umbral calculus: a set of tricks extensively used by mathematicians at the begin- ning of the twentieth century. Umbral calculus was formalized in the language of the linear operators by Gian- Carlo Rota in a series of papers (see [15], [16], and [14]) that have produced a plenty of applications (see [1]). In 1994 Rota and Taylor [17] came back to foundation of umbral calculus with the aim to restore, in light formal setting, the computational power of the original tools, heuristical applied by founders Blissard, Cayley and Sylvester. In this new setting, to which we refer as the classical umbral calculus, there are two basic devices. The first one is to represent a unital sequence of num- bers by a symbol ↵, called an umbra, that is, to represent the sequence 1,a1,a2,..
    [Show full text]