An integration of Euler's pentagonal partition
From MaRDI portal
Publication:6220752
arXiv1009.3645MaRDI QIDQ6220752FDOQ6220752
Publication date: 19 September 2010
Abstract: A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the coefficients result from a discrete integration of Euler's coefficients. Both a bijective proof and one based on generating functions show the equivalence of the subject recurrences.
Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Analytic theory of partitions (11P82) Partitions; congruences and congruential restrictions (11P83)
This page was built for publication: An integration of Euler's pentagonal partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6220752)
