2015
DOI: 10.1215/ijm/1475266396
|View full text |Cite
|
Sign up to set email alerts
|

Normality preserving operations for Cantor series expansions and associated fractals, I

Abstract: We investigate how non-zero rational multiplication and rational addition affect normality with respect to Q-Cantor series expansions. In particular, we show that there exists a Q such that the set of real numbers which are Q-normal but not Q-distribution normal, and which still have this property when multiplied and added by rational numbers has full Hausdorff dimension. Moreover, we give such a number that is explicit in the sense that it is computable.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
24
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5

Relationship

4
1

Authors

Journals

citations
Cited by 11 publications
(24 citation statements)
references
References 24 publications
0
24
0
Order By: Relevance
“…We then define all the S j recursively, deriving S j by letting it be the coarsest refinement of S j−1 that includes all cylinder sets C s with the sum of digits in s equal to j. Thus S 1 = {Ω \ C [1] , C [1] }, S 2 = {Ω \ (C [1] ∪ C [2] ), C [2] , C [1] \ C [1,1] , C [1,1] }, and so on. Note that S j always consists of just cylinders and anti-cylinders.…”
Section: Now Let Us Consider Two Sequences Of Functions Fmentioning
confidence: 99%
See 4 more Smart Citations
“…We then define all the S j recursively, deriving S j by letting it be the coarsest refinement of S j−1 that includes all cylinder sets C s with the sum of digits in s equal to j. Thus S 1 = {Ω \ C [1] , C [1] }, S 2 = {Ω \ (C [1] ∪ C [2] ), C [2] , C [1] \ C [1,1] , C [1,1] }, and so on. Note that S j always consists of just cylinders and anti-cylinders.…”
Section: Now Let Us Consider Two Sequences Of Functions Fmentioning
confidence: 99%
“…Namely, we remove digits from the head or tail of s and append them to s + or prepend tem to s − until removing any more digits would cause r to no longer appear nicely within t at the same relative position. We refer to this (s, M ) with the length of s minimized as a trigger string for r. If there are exactly k copies of r in t all of which have the same minimal decomposition, we say that (s, M ) is a trigger string of multiplicity k. For example if the resultant string of ( [10], M ) was [1; 1, 1, 1, 1, 1] and the desired string r = [1], then this string has multiplicity 2.…”
Section: Trigger Stringsmentioning
confidence: 99%
See 3 more Smart Citations