Some combinatorics from Zeckendorf representations
From MaRDI portal
Publication:2278650
DOI10.2140/involve.2019.12.1241zbMath1485.11020OpenAlexW2981901541WikidataQ126985952 ScholiaQ126985952MaRDI QIDQ2278650
Tom Edgar, Paul Lagarde, Tyler Ball, Dean Dustin, Rachel Chaiser
Publication date: 5 December 2019
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/involve.2019.12.1241
Other combinatorial number theory (11B75) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Other number representations (11A67)
Related Items (2)
Cites Work
- The signature of rational languages
- Breadth-First Serialisation of Trees and Rational Languages
- Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem
- Fibonacci representations and finite automata
- The power of a prime that divides a generalized binomial coefficient.
- Counting Binomial Coefficients Divisible by a Prime Power
- Binomial Coefficients Modulo a Prime
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Some combinatorics from Zeckendorf representations