Multiset rewriting over Fibonacci and tribonacci numbers
DOI10.1016/J.JCSS.2014.04.006zbMATH Open1327.68143OpenAlexW2094095381MaRDI QIDQ2453583FDOQ2453583
Authors: Max Kanovich 
Publication date: 10 June 2014
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.006
Recommendations
- A Note on Rewriting Proofs and Fibonacci Numbers
- scientific article; zbMATH DE number 1948153
- Finding direct partition bijections by two-directional rewriting techniques
- A combinatorial proof of a family of multinomial-Fibonacci identities
- Bijective proofs for Fibonacci identities related to Zeckendorf's theorem
integer partitionsconfluenceFibonacci numberspartition identitiesterminationChurch-Rosser propertymultiset rewritingtribonacci numbers\(k\)-step Fibonacci numbers
Combinatorial aspects of partitions of integers (05A17) Grammars and rewriting systems (68Q42) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Title not available (Why is that?)
- Systems of Numeration
- Method for constructing bijections for classical partition identities
- Title not available (Why is that?)
- Title not available (Why is that?)
- A counting based proof of the generalized Zeckendorf's theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bijective proofs of some classical partition identities
- Sieve equivalence in generalized partition theory
- Bijections for partition identities
- Sieve-equivalence and explicit bijections
- Title not available (Why is that?)
- The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
- A Note on Rewriting Proofs and Fibonacci Numbers
Cited In (3)
This page was built for publication: Multiset rewriting over Fibonacci and tribonacci numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453583)
