Multiset rewriting over Fibonacci and tribonacci numbers
From MaRDI portal
Publication:2453583
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
Cites work
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1948153 (Why is no real title available?)
- scientific article; zbMATH DE number 3373770 (Why is no real title available?)
- scientific article; zbMATH DE number 3397639 (Why is no real title available?)
- A Note on Rewriting Proofs and Fibonacci Numbers
- A counting based proof of the generalized Zeckendorf's theorem
- Bijections for partition identities
- Bijective proofs of some classical partition identities
- Method for constructing bijections for classical partition identities
- Sieve equivalence in generalized partition theory
- Sieve-equivalence and explicit bijections
- Systems of Numeration
- The two-way rewriting in action: removing the mystery of Euler-Glaisher's map
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)