Article thumbnail

Geometry and complexity of O’Hara’s algorithm

By Matja ˇ Z Konvalinka and Igor Pak

Abstract

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. 1

Year: 2012
OAI identifier: oai:CiteSeerX.psu:10.1.1.246.3547
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0710.1459... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.