Publicação

On generalized Vietoris’ number sequences

Ver documento

Detalhes bibliográficos
Resumo:Recently, by using methods of hypercomplex function theory, the authors have shown that a certain sequence S of rational numbers (Vietoris’ sequence) combines seemingly disperse subjects in real, complex and hypercomplex analysis. This sequence appeared for the first time in a theorem by Vietoris (1958) with important applications in harmonic analysis (Askey/Steinig, 1974) and in the theory of stable holomorphic functions (Ruscheweyh/Salinas, 2004). A non-standard application of Clifford algebra tools for defining Clifford-holomorphic sequences of Appell polynomials was the hypercomplex context in which a one-parametric generalization S(n),n≥1, of S (corresponding to n=2) surprisingly showed up. Without relying on hypercomplex methods this paper demonstrates how purely real methods also lead to S(n). For arbitrary n≥1 the generating function is determined and for n=2 a particular case of a recurrence relation similar to that known for Catalan numbers is proved.
Autores principais:Cação, Isabel
Outros Autores:Falcão, M. I.; Malonek, Helmuth R.
Assunto:Generating function Hypercomplex Appell polynomials Recurrence relation Vietoris’ number sequence
Ano:2019
País:Portugal
Tipo de documento:artigo
Tipo de acesso:acesso aberto
Instituição associada:Universidade do Minho
Idioma:inglês
Origem:RepositóriUM - Universidade do Minho
Descrição
Resumo:Recently, by using methods of hypercomplex function theory, the authors have shown that a certain sequence S of rational numbers (Vietoris’ sequence) combines seemingly disperse subjects in real, complex and hypercomplex analysis. This sequence appeared for the first time in a theorem by Vietoris (1958) with important applications in harmonic analysis (Askey/Steinig, 1974) and in the theory of stable holomorphic functions (Ruscheweyh/Salinas, 2004). A non-standard application of Clifford algebra tools for defining Clifford-holomorphic sequences of Appell polynomials was the hypercomplex context in which a one-parametric generalization S(n),n≥1, of S (corresponding to n=2) surprisingly showed up. Without relying on hypercomplex methods this paper demonstrates how purely real methods also lead to S(n). For arbitrary n≥1 the generating function is determined and for n=2 a particular case of a recurrence relation similar to that known for Catalan numbers is proved.