𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof for a partition identity of Hwang and Wei

✍ Scribed by Peter Kirschenhofer; Helmut Prodinger

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
160 KB
Volume
52
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A partition identity
A partition identity
✍ F.K. Hwang; V.K. Wei πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 302 KB
A short proof of a partition theorem for
A short proof of a partition theorem for the ordinal ωω
✍ Jean A. Larson πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science βš– 716 KB

An ordinal a is equal to the set of its predecessors and is ordered by the membership relation. For any ordinal a, one writes a -~ (a, m) 2 if and only if for any set A order-isomorphic to a, and any function f from the pairs of elements of A into {0, 1}, either there is a subset X c\_ A order-isomo

A Computer Proof of a Polynomial Identit
A Computer Proof of a Polynomial Identity Implying a Partition Theorem of GΓΆllnitz
✍ Alexander Berkovich; Axel Riese πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 117 KB

In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer proofs are done with the aid of the new computer algebra packag