23 search results - page 1 / 5 » The 2-Adic Behavior of the Number of Partitions into Distinc... |
JCT
2000
13 years 4 months ago
2000
JCT
1998
13 years 4 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
COMBINATORICS
2004
13 years 4 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
JCT
2006
13 years 4 months ago
2006
Multirestricted Stirling numbers of the second kind count the number of partitions of a given set into a given number of parts, each part being restricted to at most a fixed number...