We study Bell polynomials by using functions of triangular matrices (parapermanents and paradeterminants). Some combinatorial identities and relationships between these functions and the Stirling numbers of the first and second kinds are established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. T. Bell, “Partition polynomials,” Ann. Math., 29, 38–46 (1927).
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, New York (1958).
N. J. Fine, “Sums over partitions,” Rept. Inst. Theory Numbers, Boulder (1959), pp. 86–94.
I. V. Protasov and O. M. Khromulyak, Methods of Linear Algebra in Combinatorics [in Ukrainian], Ukrainian State Pedagogical University, Kyiv (1997).
V. E. Tarakanov, Combinatorial Problems and (0, 1)-Matrices [in Russian], Nauka, Kiev (1985).
R. A. Zators’kyi, “Paradeterminants and parapermanents of triangular matrices,” Mat. Stud., 17, Issue 1, 45–54 (2002).
R. P. Stanley, Enumerative Combinatorics [Russian translation], Mir, Moscow (1990).
G. E. Andrews, The Theory of Partitions, Addison-Wesley, London (1976).
R. A. Zators’kyi, “Parapermanents and linear recurrence relations,” Proc. of the Internat. Mathematical Conf. Dedicated to the 100 Years of the Beginning of the Scientific Career of D. O. Grave (1863–1939) at the Kyiv University (Kyiv, June 17–22, 2002).
V. N. Sachkov, Introduction to the Combinatorial Methods of Discrete Mathematics [in Russian], Nauka, Moscow (1982).
J. Riordan, Combinatorial Identities [Russian translation], Nauka, Moscow (1982).
Author information
Authors and Affiliations
Additional information
Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 11, pp. 1457–1469, November, 2008.
Rights and permissions
About this article
Cite this article
Zators’kyi, R.A. Paradeterminants and partition polynomials. Ukr Math J 60, 1702–1715 (2008). https://doi.org/10.1007/s11253-009-0164-6
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11253-009-0164-6