Finding direct partition bijections by two-directional rewriting techniques

DOI10.1016/j.disc.2004.01.017zbMath1044.05010OpenAlexW2065565997MaRDI QIDQ1877658

Max I. Kanovich

Publication date: 19 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.017

zbMATH Keywords

Strong normalizationTerminationInteger partitionsMultiset rewritingConfluencePartition identities

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Grammars and rewriting systems (68Q42) Automata sequences (11B85)

Related Items (2)

The two-way rewriting in action: removing the mystery of Euler-Glaisher's map ⋮ Geometry and complexity of O'Hara's algorithm

Cites Work

• Bijections for partition identities
• Bijective proofs of some classical partition identities
• A trinomial analogue of Bailey's lemma and \(N=2\) superconformal invariance
• Sieve-equivalence and explicit bijections
• Sieve equivalence in generalized partition theory
• Method for constructing bijections for classical partition identities
• Two Theorems of Euler and a General Partition Theorem
• Partition Theorems for Euler Pairs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding direct partition bijections by two-directional rewriting techniques