A Combinatorial Approach to Positional Number Systems
From MaRDI portal
Publication:6233352
DOI10.1007/S10474-013-0387-8arXiv1205.6460MaRDI QIDQ6233352FDOQ6233352
Authors: Andrew Vince 
Publication date: 29 May 2012
Abstract: Although the representation of the real numbers in terms of a base and a set of digits has a long history, new questions arise even in simple situations. This paper concerns binary radix systems, i.e., positional number systems with digits 0 and 1. Our combinatorial approach is to construct infinitely many binary radix systems, each one from a single pair of binary strings. Every binary radix system that satisfies even a minimal set of conditions that would be expected of a positional number system can be constructed in this way.
Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Dynamical systems involving maps of the interval (37E05) Real polynomials: location of zeros (26C10) Designs and configurations (05B99)
This page was built for publication: A Combinatorial Approach to Positional Number Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233352)
