Abstract
An involution ϕ, is given on the set of all integer partitions of n. The cardinality of the fixed point set of ϕ, is > n2 and has the same parity as p(n). Moreover, ϕ(λ) can found in polynomial time.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 223-228 |
| Number of pages | 6 |
| Journal | Journal of Algorithms |
| Volume | 15 |
| Issue number | 2 |
| DOIs | |
| State | Published - Sep 1993 |
Fingerprint
Dive into the research topics of 'An algorithmic involution for p(n)'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS