Bivariate Finite Operator Calculus and Counting Ballot Paths Containing Patterns

• Autorzy: Sullivan S.
• Języki publikacji: EN

Słowa kluczowe

EN

Finite Operator Calculus; ballot paths

• Wydawca: Polskie Towarzystwo Matematyczne
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2012
• Tom: Vol. 117, nr 1-4
• Strony: 287--309
• Opis fizyczny: Bibliogr. 10 poz.

Twórcy

autor

Sullivan S.

• Florida Atlantic University Boca Raton, Florida, U.S.A.,

Bibliografia

• [1] Deutsch, E., 1999, Dyck path enumeration. Discrete Math. 204, 167 - 202.
• [2] Niederhausen, H., Sullivan, S., 2007, Euler Coefficients and Restricted Dyck Paths. Congr Numer. 188, 196 - 210 (arXiv:0705.3065).
• [3] Niederhausen, H., Sullivan, S., 2010, Pattern Avoiding Ballot Paths and Finite Operator Calculus. J. Statist. Plann. Inference. (arXiv:0709.0878).
• [4] Niederhausen, H., 2003, Rota's umbral calculus and recursions. Algebra Univers. 49, 435 - 457.
• [5] Jordan, C., 1939, Calculus of Finite Differences. Chelsea Publ. Co., New York, 3rd edition 1979.
• [6] Roman, S.M. (1984) The Umbral Calculus. Academic Press. New York.
• [7] Rota, G.-C., Kahaner, D., Odlyzko, A., 1973, On the Foundations of Combinatorial Theory VIII: Finite operator calculus. J. Math. Anal. Appl. 42, 684 - 760.
• [8] Sapounakis, A., Tasoulas, I., Tsikouras, P., 2007, Counting strings in Dyck paths. Discrete Math. 307, 2909 - 2924.
• [9] I.J. Good, Generalization to several variables of Lagrange's expansion, with applications to stochastic processes, Proc. Canbridge Philos. Soc. 56 (1960) 367-380.
• [10] S.A. Joni, Lagrange inversion in higher dimensions and umbral operators, Linear and Multilinear Algebra, 6 (1970) 111-122.