Geometry and complexity of O'Hara's algorithm

Matjaž Konvalinka 1 Igor Pak 2
1 Department of Mathematics, Vanderbilt University
2 School of Mathematics [Minneapolis]
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.
Keywords : partitions O'Hara's algorithm complexity
Type de document :
Communication dans un congrès
Krattenthaler, Christian and Strehl, Volker and Kauers, Manuel. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), pp.537-548, 2009, DMTCS Proceedings
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger
https://hal.inria.fr/hal-01185384
Contributeur : Coordination Episciences Iam <>
Soumis le : jeudi 20 août 2015 - 11:06:56
Dernière modification le : jeudi 26 avril 2018 - 20:38:11
Document(s) archivé(s) le : mercredi 26 avril 2017 - 09:44:05

Fichier

dmAK0145.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-01185384, version 1

Collections

INSMI | TDS-MACS

Citation

Matjaž Konvalinka, Igor Pak. Geometry and complexity of O'Hara's algorithm. Krattenthaler, Christian and Strehl, Volker and Kauers, Manuel. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), pp.537-548, 2009, DMTCS Proceedings. 〈hal-01185384〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

50

Téléchargements de fichiers

106

Contact


archive-ouverte@inria.fr