Services on Demand
Journal
Article
English (pdf)
Article in xml format
Article references
Automatic translation
Send this article by e-mailIndicators
-
Cited by SciELO -
Access statistics
Related links
-
Cited by Google -
Similars in
SciELO -
Similars in Google
Share
Permalink
Revista Colombiana de Matemáticas
Print version ISSN 0034-7426
Rev.colomb.mat. vol.53 no.2 Bogotá July/Dec. 2019 Epub Mar 20, 2020
Artículos originales
The formal derivative operator and multifactorial numbers
El operador derivada formal y números multifactoriales
1Universidad ECCI, Bogotá, Colombia. Universidad ECCI Carrera 19 # 49-20 Bogota, Colombia e-mail: jtrianal@ecci.edu.co
2Universidad Nacional de Colombia, Bogotá, Colombia, Departamento de Matemáticas Facultad de Ciencias Carrera 30, calle 45 Bogotá, Colombia e-mail: rdecastrok@unal.edu.co
In this paper some properties, examples and counterexamples about the formal derivative operator defined with respect to context-free grammars are presented. In addition, we show a connection between the context-free grammar G={α→ αb r ; b→b r+1 } ties involving multifactorial numbers will be obtained by grammatical methods.
Key words and phrases. Context-free grammars; formal derivative operator; multifactorial numbers
En este artículo se presentan algunas propiedades, ejemplos y contraejemplos del operador derivada formal con respecto a gramáticas independientes del contexto. Adicionalmente, se obtiene una relación entre la gramática G={α→ αb r ; b→b r+1 } y números multifactoriales. Se obtienen algunas identidades sobre números multifactoriales mediante métodos gramaticales.
Palabras y frases clave. Gramáticas independiente del contexto; operador derivada formal; números multifactoriales
References
[1] D. Callan , A combinatorial survey of identities for the double factorial, arXiv:0906.1317v1 (2009), 1-29. [ Links ]
[2] D. Callan, S. Ma, and T. Mansour, Some combinatorial arrays related to the Lotka-Volterra system, The Electronic Journal of Combinatorics 22 (2015), no. 2, #22. [ Links ]
[3] C. Chen and K. Kho, Principles and techniques in combinatorics, World Scientific, Singapur, 1992. [ Links ]
[4] W. Chen, Context-free grammars, differential operators and formal power series, Theoretical Computer Science 117 (1993), 113-129. [ Links ]
[5] W. Chen and A. Fu, Context-free grammars for permutations and increasing trees, Advances in Applied Mathematics 82 (2017), 58-82. [ Links ]
[6] D. Dumont, Grammaires de William Chen et derivations dans les arbres et arborescences, Seminaire Lotharingien de Combinatoire 37 (1996), 1-21, B37a. [ Links ]
[7] D. Dumont and A. Ramamonjisoa, Grammaire de Ramanujan et arbres de Cayley, The Electronic Journal of Combinatorics 3 (1996), no. 2, 1-18, R17. [ Links ]
[8] A. Dzhumadildaeva, Problem 11406, American Mathematical Monthly 116 (2009), no. 1, 82. [ Links ]
[9] H. Gould and J. Quaintance, Double fun with double factorials, Mathematics Magazine 85 (2012), no. 3, 177-192. [ Links ]
[10] R. Hao, L. Wang, and H. Yang, Context-free grammars for triangular arrays, Acta Mathematica Sinica 31 (2015), no. 3, 445-455. [ Links ]
[11] V. Lampret, Approximating real Pochhammer products: a comparison with powers, Central European Journal of Mathematics 7 (2009), no. 3, 493505. [ Links ]
[12] S. Ma, Some combinatorial arrays generated by context-free grammars, European Journal of Combinatorics 34 (2013), no. 7, 1081-1091. [ Links ]
[13] S. Ma, J. Ma, Y. Yeh, and B. Zhu, Context-free grammars for several polynomials associated with Eulerian polynomials, The Electronic Journal of Combinatorics 25 (2018), no. 1, 1-31. [ Links ]
[14] S. Ma, T. Mansour, and M. Schork, Normal ordering problem and the extensions ofthe Stirling grammar, Russian Journal of Mathematical Physics 21 (2014), no. 2, 242-255. [ Links ]
[15] S. Ma and Y. Yeh, Eulerian polynomials, Stirling permutations of the second kind and perfect matchings, The Electronic Journal of Combinatorics 24 (2017), no. 4, 4-27. [ Links ]
[16] E. Weisstein, CRC Concise Encylopedia of Mathematics, Chapman & Hall/ CRC, New York, 2002. [ Links ]
Received: February 2019; Accepted: June 2019
Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons BY
