Skip to Main content Skip to Navigation
Conference papers

Geometry and complexity of O'Hara's algorithm

Abstract : In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we see that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we present a number of new complexity bounds, proving that O'Hara's bijection is efficient in most cases and mildly exponential in general. Finally, we see 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.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185384
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 11:06:56 AM
Last modification on : Thursday, May 6, 2021 - 9:44:04 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:44:05 AM

File

dmAK0145.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01185384, version 1

Collections

Citation

Matjaž Konvalinka, Igor Pak. Geometry and complexity of O'Hara's algorithm. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. pp.537-548. ⟨hal-01185384⟩

Share

Metrics

Record views

171

Files downloads

978