Skip to main content
Log in

Combinatorial and Arithmetical Properties of Linear Numeration Systems

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Dedicated to the memory of Paul Erdős

We extend a result of J. Alexander and D. Zagier on the Garsia entropy of the Erdős measure. Our investigation heavily relies on methods from combinatorics on words. Furthermore, we introduce a new singular measure related to the Farey tree.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received October 7, 1999

RID="†"

ID="†" This author is supported by the START-project Y96-MAT of the Austrian Science Fund

RID="‡"

ID="‡" This author is supported by the Austrian Science Fund (FWF) grant P14200-MAT

RID="*"

ID="*" This author is supported by the Austrian Science Fund (FWF) grant S8307-MAT

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grabner, P., Kirschenhofer, P. & Tichy, R. Combinatorial and Arithmetical Properties of Linear Numeration Systems. Combinatorica 22, 245–267 (2002). https://doi.org/10.1007/s004930200011

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930200011

Navigation