<p>For any positive integer <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(p\ge 3\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>p</mi> <mo>≥</mo> <mn>3</mn> </mrow> </math></EquationSource> </InlineEquation>, let <i>A</i> be a proper subset of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\{0,1,\ldots , p-1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mi>p</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\({\# }A=s\ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo>#</mo> <mi>A</mi> <mo>=</mo> <mi>s</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation>. Suppose <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(h: \{0,1,\ldots ,s-1\}\rightarrow A\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>h</mi> <mo>:</mo> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mi>s</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">}</mo> <mo stretchy="false">→</mo> <mi>A</mi> </mrow> </math></EquationSource> </InlineEquation> is a strictly increasing one-to-one mapping. We focus on the so-called Cantor-integers <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\{a_n\}_{n\ge 1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mo stretchy="false">{</mo> <msub> <mi>a</mi> <mi>n</mi> </msub> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation>, which consist of these positive integers <i>n</i> such that the digits of the <i>p</i>-ary expansion of <i>n</i> are taken solely from the elements of <i>A</i>. Evidently, the set <InlineEquation ID="IEq6"> <EquationSource Format="TEX">\(\mathfrak {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">C</mi> </math></EquationSource> </InlineEquation> consisting of points <InlineEquation ID="IEq7"> <EquationSource Format="TEX">\(x\in [0,1]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>x</mi> <mo>∈</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation> such that the digits in the <i>p</i>-ary expansion of <i>x</i> are exclusively drawn from the elements of <i>A</i> is precisely the attractor of the iterated function system <InlineEquation ID="IEq8"> <EquationSource Format="TEX">\(\{f_i\}_{i=0}^{s-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msubsup> <mrow> <mo stretchy="false">{</mo> <msub> <mi>f</mi> <mi>i</mi> </msub> <mo stretchy="false">}</mo> </mrow> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mi>s</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> </math></EquationSource> </InlineEquation>, where <InlineEquation ID="IEq9"> <EquationSource Format="TEX">\(f_i\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>f</mi> <mi>i</mi> </msub> </math></EquationSource> </InlineEquation> are functions defined on [0,&#xa0;1] as <InlineEquation ID="IEq10"> <EquationSource Format="TEX">\(f_i(x)=\frac{x+h(i)}{p}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>f</mi> <mi>i</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <mi>x</mi> <mo>+</mo> <mi>h</mi> <mo stretchy="false">(</mo> <mi>i</mi> <mo stretchy="false">)</mo> </mrow> <mi>p</mi> </mfrac> </mrow> </math></EquationSource> </InlineEquation>, respectively. Denote the classical self-similar measure supported on <InlineEquation ID="IEq11"> <EquationSource Format="TEX">\(\mathfrak {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="fraktur">C</mi> </math></EquationSource> </InlineEquation> by <InlineEquation ID="IEq12"> <EquationSource Format="TEX">\(\mu _{\mathfrak {C}}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>μ</mi> <mi mathvariant="fraktur">C</mi> </msub> </math></EquationSource> </InlineEquation> with <InlineEquation ID="IEq13"> <EquationSource Format="TEX">\(\mu _\mathfrak {C}=\sum _{i=0}^{s-1}\frac{1}{s} \mu _\mathfrak {C}\circ f_i^{-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msub> <mi>μ</mi> <mi mathvariant="fraktur">C</mi> </msub> <mo>=</mo> <msubsup> <mo>∑</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>0</mn> </mrow> <mrow> <mi>s</mi> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> <mfrac> <mn>1</mn> <mi>s</mi> </mfrac> <msub> <mi>μ</mi> <mi mathvariant="fraktur">C</mi> </msub> <mo>∘</mo> <msubsup> <mi>f</mi> <mi>i</mi> <mrow> <mo>-</mo> <mn>1</mn> </mrow> </msubsup> </mrow> </math></EquationSource> </InlineEquation>. Note that <InlineEquation ID="IEq14"> <EquationSource Format="TEX">\(n^{\log _s p}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>n</mi> <mrow> <msub> <mo>log</mo> <mi>s</mi> </msub> <mi>p</mi> </mrow> </msup> </math></EquationSource> </InlineEquation> is the growth order of <InlineEquation ID="IEq15"> <EquationSource Format="TEX">\(a_n\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>a</mi> <mi>n</mi> </msub> </math></EquationSource> </InlineEquation> and the set of accumulation points of the sequence <InlineEquation ID="IEq16"> <EquationSource Format="TEX">\(\left\{ \frac{a_n}{n^{\log _s p}}:~n\ge 1\right\} \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close="}" open="{"> <mfrac> <msub> <mi>a</mi> <mi>n</mi> </msub> <msup> <mi>n</mi> <mrow> <msub> <mo>log</mo> <mi>s</mi> </msub> <mi>p</mi> </mrow> </msup> </mfrac> <mo>:</mo> <mspace width="3.33333pt" /> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mfenced> </math></EquationSource> </InlineEquation> is precisely the set <InlineEquation ID="IEq17"> <EquationSource Format="TEX">\(\left\{ \frac{x}{(\mu _{\mathfrak {C}}([0,x]))^{\log _s p}}: x\in \mathfrak {C}\cap [\frac{h(1)}{p},1]\right\} \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close="}" open="{"> <mfrac> <mi>x</mi> <msup> <mrow> <mo stretchy="false">(</mo> <msub> <mi>μ</mi> <mi mathvariant="fraktur">C</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mrow> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mrow> <msub> <mo>log</mo> <mi>s</mi> </msub> <mi>p</mi> </mrow> </msup> </mfrac> <mo>:</mo> <mi>x</mi> <mo>∈</mo> <mi mathvariant="fraktur">C</mi> <mo>∩</mo> <mrow> <mo stretchy="false">[</mo> <mfrac> <mrow> <mi>h</mi> <mo stretchy="false">(</mo> <mn>1</mn> <mo stretchy="false">)</mo> </mrow> <mi>p</mi> </mfrac> <mo>,</mo> <mn>1</mn> <mo stretchy="false">]</mo> </mrow> </mfenced> </math></EquationSource> </InlineEquation>. We show that this set is just an interval with the infimum <i>m</i> and supremum <i>M</i> of the sequence <InlineEquation ID="IEq18"> <EquationSource Format="TEX">\(\left\{ \frac{a_n}{n^{\log _s p}}:~n\ge 1\right\} \)</EquationSource> <EquationSource Format="MATHML"><math> <mfenced close="}" open="{"> <mfrac> <msub> <mi>a</mi> <mi>n</mi> </msub> <msup> <mi>n</mi> <mrow> <msub> <mo>log</mo> <mi>s</mi> </msub> <mi>p</mi> </mrow> </msup> </mfrac> <mo>:</mo> <mspace width="3.33333pt" /> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mfenced> </math></EquationSource> </InlineEquation> as its endpoints, in particular, <InlineEquation ID="IEq19"> <EquationSource Format="TEX">\(\left\{ \frac{x}{(\mu _{\mathfrak {C}}([0,x]))^{\log _s p}}: x\in \mathfrak {C}\backslash \{0\}\right\} =[m,M]\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mfenced close="}" open="{"> <mfrac> <mi>x</mi> <msup> <mrow> <mo stretchy="false">(</mo> <msub> <mi>μ</mi> <mi mathvariant="fraktur">C</mi> </msub> <mrow> <mo stretchy="false">(</mo> <mrow> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>x</mi> <mo stretchy="false">]</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mrow> <msub> <mo>log</mo> <mi>s</mi> </msub> <mi>p</mi> </mrow> </msup> </mfrac> <mrow> <mo>:</mo> <mi>x</mi> <mo>∈</mo> <mi mathvariant="fraktur">C</mi> <mo stretchy="true">\</mo> <mrow> <mo stretchy="false">{</mo> <mn>0</mn> <mo stretchy="false">}</mo> </mrow> </mrow> </mfenced> <mo>=</mo> <mrow> <mo stretchy="false">[</mo> <mi>m</mi> <mo>,</mo> <mi>M</mi> <mo stretchy="false">]</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation> if <InlineEquation ID="IEq20"> <EquationSource Format="TEX">\(0\in A\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mn>0</mn> <mo>∈</mo> <mi>A</mi> </mrow> </math></EquationSource> </InlineEquation>. Further, we show that the sequence <InlineEquation ID="IEq21"> <EquationSource Format="TEX">\(\left\{ \frac{a_n}{n^{\log _s p}}\right\} _{n\ge 1}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mfenced close="}" open="{"> <mfrac> <msub> <mi>a</mi> <mi>n</mi> </msub> <msup> <mi>n</mi> <mrow> <msub> <mo>log</mo> <mi>s</mi> </msub> <mi>p</mi> </mrow> </msup> </mfrac> </mfenced> <mrow> <mi>n</mi> <mo>≥</mo> <mn>1</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> is not uniformly distributed modulo&#xa0;1, and it does not have cumulative distribution function, but has logarithmic distribution function (given by a specific Lebesgue integral). In the special case where <i>A</i> is the set composed of numbers from <InlineEquation ID="IEq22"> <EquationSource Format="TEX">\(\{0,1,\ldots , p-1\}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">{</mo> <mn>0</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mi>p</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">}</mo> </mrow> </math></EquationSource> </InlineEquation> that all have the same remainder of <i>r</i> when divided by some given positive integer <InlineEquation ID="IEq23"> <EquationSource Format="TEX">\(q \ge 2\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>q</mi> <mo>≥</mo> <mn>2</mn> </mrow> </math></EquationSource> </InlineEquation> (i.e. <InlineEquation ID="IEq24"> <EquationSource Format="TEX">\(h(x)=qx+r\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>h</mi> <mo stretchy="false">(</mo> <mi>x</mi> <mo stretchy="false">)</mo> <mo>=</mo> <mi>q</mi> <mi>x</mi> <mo>+</mo> <mi>r</mi> </mrow> </math></EquationSource> </InlineEquation>), we show that <InlineEquation ID="IEq25"> <EquationSource Format="TEX">\(m=\frac{q(s-1)+r}{p-1}, M=\frac{q(p-1)+pr}{p-1}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>m</mi> <mo>=</mo> <mfrac> <mrow> <mi>q</mi> <mo stretchy="false">(</mo> <mi>s</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>+</mo> <mi>r</mi> </mrow> <mrow> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </mfrac> <mo>,</mo> <mi>M</mi> <mo>=</mo> <mfrac> <mrow> <mi>q</mi> <mo stretchy="false">(</mo> <mi>p</mi> <mo>-</mo> <mn>1</mn> <mo stretchy="false">)</mo> <mo>+</mo> <mi>p</mi> <mi>r</mi> </mrow> <mrow> <mi>p</mi> <mo>-</mo> <mn>1</mn> </mrow> </mfrac> </mrow> </math></EquationSource> </InlineEquation> .</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On the distribution of the Cantor-integers

  • Chun-Yun Cao,
  • Jie Yu

摘要

For any positive integer \(p\ge 3\) p 3 , let A be a proper subset of \(\{0,1,\ldots , p-1\}\) { 0 , 1 , , p - 1 } with \({\# }A=s\ge 2\) # A = s 2 . Suppose \(h: \{0,1,\ldots ,s-1\}\rightarrow A\) h : { 0 , 1 , , s - 1 } A is a strictly increasing one-to-one mapping. We focus on the so-called Cantor-integers \(\{a_n\}_{n\ge 1}\) { a n } n 1 , which consist of these positive integers n such that the digits of the p-ary expansion of n are taken solely from the elements of A. Evidently, the set \(\mathfrak {C}\) C consisting of points \(x\in [0,1]\) x [ 0 , 1 ] such that the digits in the p-ary expansion of x are exclusively drawn from the elements of A is precisely the attractor of the iterated function system \(\{f_i\}_{i=0}^{s-1}\) { f i } i = 0 s - 1 , where \(f_i\) f i are functions defined on [0, 1] as \(f_i(x)=\frac{x+h(i)}{p}\) f i ( x ) = x + h ( i ) p , respectively. Denote the classical self-similar measure supported on \(\mathfrak {C}\) C by \(\mu _{\mathfrak {C}}\) μ C with \(\mu _\mathfrak {C}=\sum _{i=0}^{s-1}\frac{1}{s} \mu _\mathfrak {C}\circ f_i^{-1}\) μ C = i = 0 s - 1 1 s μ C f i - 1 . Note that \(n^{\log _s p}\) n log s p is the growth order of \(a_n\) a n and the set of accumulation points of the sequence \(\left\{ \frac{a_n}{n^{\log _s p}}:~n\ge 1\right\} \) a n n log s p : n 1 is precisely the set \(\left\{ \frac{x}{(\mu _{\mathfrak {C}}([0,x]))^{\log _s p}}: x\in \mathfrak {C}\cap [\frac{h(1)}{p},1]\right\} \) x ( μ C ( [ 0 , x ] ) ) log s p : x C [ h ( 1 ) p , 1 ] . We show that this set is just an interval with the infimum m and supremum M of the sequence \(\left\{ \frac{a_n}{n^{\log _s p}}:~n\ge 1\right\} \) a n n log s p : n 1 as its endpoints, in particular, \(\left\{ \frac{x}{(\mu _{\mathfrak {C}}([0,x]))^{\log _s p}}: x\in \mathfrak {C}\backslash \{0\}\right\} =[m,M]\) x ( μ C ( [ 0 , x ] ) ) log s p : x C \ { 0 } = [ m , M ] if \(0\in A\) 0 A . Further, we show that the sequence \(\left\{ \frac{a_n}{n^{\log _s p}}\right\} _{n\ge 1}\) a n n log s p n 1 is not uniformly distributed modulo 1, and it does not have cumulative distribution function, but has logarithmic distribution function (given by a specific Lebesgue integral). In the special case where A is the set composed of numbers from \(\{0,1,\ldots , p-1\}\) { 0 , 1 , , p - 1 } that all have the same remainder of r when divided by some given positive integer \(q \ge 2\) q 2 (i.e. \(h(x)=qx+r\) h ( x ) = q x + r ), we show that \(m=\frac{q(s-1)+r}{p-1}, M=\frac{q(p-1)+pr}{p-1}\) m = q ( s - 1 ) + r p - 1 , M = q ( p - 1 ) + p r p - 1 .