Fractal functions defined in terms of number representations in systems with a redundant alphabet
Abstract
For fixed natural numbers r and s, where 2≤ s ≤ r, we consider a representation of numbers from the interval [0;rs-1] obtained by encoding numbers by means of the alphabet A=\0,1,...,r\ via the expansion x=Σn=1∞s-nαn=rsα1α2...αn.... The algorithm for expanding a number into such a series is justified in the paper. The geometry of this representation is studied, including the geometric meaning of digits, properties of cylinder sets -- particularly the specificity of their overlaps -- and metric relations, as well as the connection between the representation and partial sums of the corresponding series. The paper also presents results on the study of a function f defined by f(x=Σn=1∞αn(r+1)n)=rsα1α2...αn..., αn∈ A. It is proved that the function f is continuous at every point that has a unique representation in the classical numeration system with base r+1, and discontinuous at points having two representations. The function has unbounded variation and a self-affine graph. For r<2s-1, the function possesses singleton, finite, countable, and continuum level sets, including fractal ones; for r>2s-2, every level set is a continuum, and moreover it is fractal or anomalously fractal.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.