๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the combinatorics of Kostant's partition function

โœ Scribed by Robert W. Deckhart


Book ID
107774698
Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
463 KB
Volume
96
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Frobenius Partitions and the Combinatori
โœ Sylvie Corteel; Jeremy Lovejoy ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 81 KB

We examine the combinatorial significance of Ramanujan's famous summation. In particular, we prove bijectively a partition theoretic identity which implies the summation formula.

On the parity of the partition function
โœ Li-Xia Dai; Yong-Gao Chen ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 105 KB

Let N be the set of all positive integers and D a subset of N. Let p(D, n) be the number of partitions of n with parts in D and let |D(x)| denote the number of elements of D not exceeding x. It is proved that if D is an infinite subset of N such that p(D, n) is even for all n n 0 , then |D(x)| log x

On the Partition Function p(n)
โœ Rademacher, H. ๐Ÿ“‚ Article ๐Ÿ“… 1938 ๐Ÿ› Oxford University Press ๐ŸŒ English โš– 275 KB