Geometry and complexity of O'Hara's algorithm

DOI10.1016/j.aam.2008.06.005zbMath1231.05018OpenAlexW2092379035MaRDI QIDQ1004250

Matjaž Konvalinka, Igor Pak

Publication date: 2 March 2009

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/96288

zbMATH Keywords

O'Hara's bijection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17)

Related Items (4)

Effective Poset Inequalities ⋮ Cayley compositions, partitions, polytopes, and geometric bijections ⋮ Unnamed Item ⋮ Limit Shapes via Bijections

Cites Work

• Unnamed Item
• Combinatorics and geometry of Littlewood-Richardson cones
• Partition bijections, a survey
• The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
• Bijections for partition identities
• A Rogers-Ramanujan bijection
• Bijective proofs of some classical partition identities
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• Sieve-equivalence and explicit bijections
• Finding direct partition bijections by two-directional rewriting techniques
• The nature of partition bijections. I: Involutions
• Bijections and congruences for generalizations of partition identities of Euler and Guy
• A combinatorial proof of the Rogers--Ramanujan and Schur identities
• Method for constructing bijections for classical partition identities
• Partition identities and geometric bijections

This page was built for publication: Geometry and complexity of O'Hara's algorithm