Some combinatorics from Zeckendorf representations
From MaRDI portal
Publication:2278650
Recommendations
Cites work
- Binomial Coefficients Modulo a Prime
- Breadth-first serialisation of trees and rational languages (short paper)
- Counting binomial coefficients divisible by a prime power
- Dominance orders, generalized binomial coefficients, and Kummer's theorem
- Fibonacci representations and finite automata
- scientific article; zbMATH DE number 1975686 (Why is no real title available?)
- scientific article; zbMATH DE number 2124021 (Why is no real title available?)
- scientific article; zbMATH DE number 775612 (Why is no real title available?)
- scientific article; zbMATH DE number 3397597 (Why is no real title available?)
- The power of a prime that divides a generalized binomial coefficient.
- The signature of rational languages
Cited in
(10)- Basic representations of \(A_{n-1}^{(1)}\) and \(A_{2n}^{(2)}\) and the combinatorics of partitions
- Combinatorics of the \(z^{AB}\) theorem
- Combinatorics of the zeta map on rational Dyck paths
- A note on some diagonal, row and partial column sums of a Zeckendorf triangle
- scientific article; zbMATH DE number 4093555 (Why is no real title available?)
- Visual Triangular Number Identities from Positional Number Systems
- Some combinatorics of factorial base representations
- On Additive Combinatorics of Permutations of \mathbb{Z}_n
- Zeons, permanents, the Johnson scheme, and generalized derangements
- Combinatorial proofs of Zeckendorf representations of Fibonacci and Lucas products
This page was built for publication: Some combinatorics from Zeckendorf representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2278650)