Sciweavers

825 search results - page 1 / 165
» Partitions of an Integer into Powers
Sort
View
DMCCG
2001
Springer
120views Combinatorics» more  DMCCG 2001»
13 years 9 months ago
Partitions of an Integer into Powers
Matthieu Latapy
JMMA
2010
90views more  JMMA 2010»
12 years 11 months ago
A Unified Approach to Algorithms Generating Unrestricted and Restricted Integer Compositions and Integer Partitions
An original algorithm is presented that generates both restricted integer compositions and restricted integer partitions that can be constrained simultaneously by a) upper and low...
John Douglas Opdyke
JCT
1998
70views more  JCT 1998»
13 years 4 months ago
Partitions into Distinct Parts and Elliptic Curves
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)...
Ken Ono
DM
2002
84views more  DM 2002»
13 years 4 months ago
On the refined lecture hall theorem
Abstract. A lecture hall partition of length n is a sequence (1, 2, . . . , n) of nonnegative integers satisfying 0 1/1
Ae Ja Yee
ITSL
2008
13 years 6 months ago
An Implementation of the Barvinok--Woods Integer Projection Algorithm
We describe the first implementation of the Barvinok
Matthias Koeppe, Sven Verdoolaege, Kevin Woods