Mathematics > Number Theory
[Submitted on 7 Mar 2024
(this version)
, latest version 29 May 2024 (v2)
]
Title: Borel-Bernstein theorem and Hausdorff dimension of sets in power-2-decaying Gauss-like expansion
Title: 波莱尔-伯恩斯坦定理和幂2衰减高斯类似展开中集合的豪斯多夫维数
Abstract: Each $x\in (0,1]$ can be uniquely expanded as a power-2-decaying Gauss-like expansion, in the form of $$ x=\sum_{i=1}^{\infty}2^{-(d_1(x)+d_2(x)+\cdots+d_i(x))},\qquad d_i(x)\in \mathbb{N}. $$ Let $\phi:\mathbb{N}\to \mathbb{R}^{+}$ be an arbitrary positive function. We are interested in the size of the set $$F(\phi)=\{x\in (0,1]:d_n(x)\ge \phi(n)~~\text{i.m.}~n\}.$$ We prove a Borel-Bernstein theorem on the zero-one law of the Lebesgue measure of $F(\phi)$. We also obtain the Hausdorff dimension of $F(\phi)$.
Submission history
From: Dingding Yu [view email][v1] Thu, 7 Mar 2024 02:31:57 UTC (18 KB)
[v2] Wed, 29 May 2024 07:42:24 UTC (28 KB)
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.