On the number of partitions of an integer in the \(m\)-bonacci base

DOI10.5802/aif.2240zbMath1147.11012OpenAlexW2274161748MaRDI QIDQ2372776

Luca Q. Zamboni, Marcia Edson

Publication date: 1 August 2007

Published in: Annales de l'Institut Fourier (Search for Journal in Brave)

Full work available at URL: http://www.numdam.org/item?id=AIF_2006__56_7_2271_0

zbMATH Keywords

numeration systemsFibonacci numbersFine and Wilf theoremepi-Sturmian words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Symbolic dynamics (37B10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50)

Related Items

Calculating the numbers of representations and the Garsia entropy in linear numeration systems ⋮ Unnamed Item ⋮ Central sets generated by uniformly recurrent words

Cites Work

• Fine and Wilf words for any periods
• Episturmian words and episturmian morphisms
• Characterisations of balanced words via orderings
• Return words in Sturmian and episturmian words
• EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS
• An Exercise on Fibonacci Representations
• Uniqueness Theorems for Periodic Functions
• On the numeration system of Ostrowski
• Unnamed Item
• Unnamed Item
• Unnamed Item