Shift Radix Systems - A Survey

Abstract

Let d 1 be an integer and r=(r0,…,rd-1) ∈ Rd. The shift radix system τr: Zd Zd is defined by τ r( z)=(z1,…,zd-1,- r z)t ( z=(z0,…,zd-1)t). τr has the finiteness property if each z ∈ Zd is eventually mapped to 0 under iterations of τr. In the present survey we summarize results on these nearly linear mappings. We discuss how these mappings are related to well-known numeration systems, to rotations with round-offs, and to a conjecture on periodic expansions w.r.t.\ Salem numbers. Moreover, we review the behavior of the orbits of points under iterations of τr with special emphasis on ultimately periodic orbits and on the finiteness property. We also describe a geometric theory related to shift radix systems.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…