| dc.contributor.author | Konvalinka, Matjaz | |
| dc.contributor.author | Pak, Igor | |
| dc.date.accessioned | 2015-03-31T18:01:45Z | |
| dc.date.available | 2015-03-31T18:01:45Z | |
| dc.date.issued | 2008-09 | |
| dc.date.submitted | 2007-10 | |
| dc.identifier.issn | 01968858 | |
| dc.identifier.issn | 1090-2074 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/96288 | |
| dc.description.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. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.aam.2008.06.005 | en_US |
| dc.rights | 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. | en_US |
| dc.source | Elsevier | en_US |
| dc.title | Geometry and complexity of O'Hara's algorithm | en_US |
| dc.type | Article | en_US |
| dc.identifier.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. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Konvalinka, Matjaz | en_US |
| dc.relation.journal | Advances in Applied Mathematics | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Konvalinka, Matjaz; Pak, Igor | en_US |
| mit.license | PUBLISHER_POLICY | en_US |
| mit.metadata.status | Complete | |
