A Note on Rewriting Proofs and Fibonacci Numbers

DOI10.1007/978-3-540-72734-7_20MaRDI QIDQ5434514zbMATH OpenOpenAlexFDO

Authors Max Kanovich

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_20

zbMATH Keywords

combinatoricsinteger partitionsconfluenceFibonacci numbersstrong normalizationpartition identitiesterminationChurch-Rosser propertymultiset rewriting

Mathematics Subject Classification ID

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

Recommendations

• Multiset rewriting over Fibonacci and tribonacci numbers
• Finding direct partition bijections by two-directional rewriting techniques
• scientific article; zbMATH DE number 1948153
• Bijective proofs for Fibonacci identities related to Zeckendorf's theorem
• A combinatorial proof of a family of multinomial-Fibonacci identities

Cited in

(2)

• Multiset rewriting over Fibonacci and tribonacci numbers
• scientific article; zbMATH DE number 1948153 (Why is no real title available?)

This page was built for publication: A Note on Rewriting Proofs and Fibonacci Numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434514)