Calculating the numbers of representations and the Garsia entropy in linear numeration systems

DOI10.1007/s00605-012-0397-6zbMath1290.11009OpenAlexW2037650032MaRDI QIDQ1938007

Marcia Edson

Publication date: 1 February 2013

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00605-012-0397-6

zbMATH Keywords

numeration systemslinear recurrenceBernoulli convolutionGarsia entropy

Mathematics Subject Classification ID

Related Items (4)

Unnamed Item ⋮ Optimal number representations in negative base ⋮ Digit frequencies and Bernoulli convolutions ⋮ Confluent Parry numbers, their spectra, and integers in positive- and negative-base number systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On representations of positive integers in the Fibonacci base
• String overlaps, pattern matching, and nontransitive games
• Confluent linear numeration systems
• Combinatorial and arithmetical properties of linear numeration systems
• On the random series \(\sum\pm\lambda^ n\) (an Erdös problem)
• On the number of partitions of an integer in the \(m\)-bonacci base
• Entropy and singularity of infinite convolutions
• An Exercise on Fibonacci Representations
• Systems of Numeration
• Random Series in Powers of Algebraic Integers: Hausdorff Dimension of the Limit Distribution
• On a Family of Symmetric Bernoulli Convolutions
• On algebraic equations with all but one root in the interior of the unit circle. To my teacher and former colleague Erhard Schmidt on his 75th birthday

This page was built for publication: Calculating the numbers of representations and the Garsia entropy in linear numeration systems