The restricted binary partition function b k (n) enumerates the number of ways to represent n as We study the question of how large a power of 2 divides the difference b k (2 r+2 n) -b k -2 (2 r n) for fixed k \ 3, r \ 1, and all n \ 1.
The Partition Algebra Revisited
β Scribed by William F. Doran IV; David B. Wales
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 450 KB
- Volume
- 231
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Γ 4 1 1 2 2 3 3 4 4 5 5 Ε½ ΓΓ 4 as clusters, and of composition of partitions ab s Q. β£ , β£ , β£ , β£ , 1 2 3 4 Γ 4 Γ 4 Γ 4 4 . Ε½ β£ , β€ , β€ , β€ , β€ , β€ by an appropriate juxtaposition cf. p. 868 5 1 2 3 4 5 w x. of 2 . We define the elements of S , Γβ£ , β€ 4 n Γ 4 Γ 4 Γ 4 Γ 4
## Abstract We give a new proof of the strong partition relation on __Ο__~1~, assuming the axiom of determinacy, which uses only a general argument not involving the complete analysis of a measure on __Ο__~1~. (Β© 2003 WILEYβVCH Verlag GmbH & Co. KGaA, Weinheim)