Geometry and complexity of O'Hara's algorithm
Name
Konvalinka-2009-Geometry and complex.pdf
Size
454.12 KB
Format
Adobe PDF
Checksum (MD5)
2f187bcc517cd298e5e69375415de281
Author(s)
Konvalinka, Matjaz
Pak, Igor
Date Issued
September 2008
Journal
Advances in Applied Mathematics
Publisher
Elsevier
Citation
Konvalinka, Matjaz, and Igor Pak. “Geometry and Complexity of O’Hara’s Algorithm.” Advances in Applied Mathematics 42, no. 2 (February 2009): 157–175. © 2008 Elsevier Inc.
Version
Final published version
Abstract
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new complexity bounds, proving that O'Hara's bijection is efficient in several special cases and mildly exponential in general. Finally, we prove that for identities with finite support, the map of the O'Hara's bijection can be computed in polynomial time, i.e. much more efficiently than by O'Hara's construction.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/j.aam.2008.06.005
