2000 character limit reached
Substitutions over infinite alphabet generating (-β)-integers
Published 18 Aug 2011 in cs.DM | (1108.3627v1)
Abstract: This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (-\beta)-expansions. We give an admissibility criterion for more general case of (-\beta)-expansions and discuss the properties of the set of (-\beta)-integers. We give a description of distances within this set and show that this set can be coded by an infinite word over an infinite alphabet, which is a fixed point of a non-erasing non-trivial morphism.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.