ON THE ARITHMETIC STRUCTURE OF RATIONAL NUMBERS IN THE CANTOR SET

Author(s):  
IGOR E. SHPARLINSKI

We obtain a lower bound on the largest prime factor of the denominator of rational numbers in the Cantor set. This gives a stronger version of a recent result of Schleischitz [‘On intrinsic and extrinsic rational approximation to Cantor sets’, Ergodic Theory Dyn. Syst. to appear] obtained via a different argument.

2020 ◽  
pp. 1-30
Author(s):  
JOHANNES SCHLEISCHITZ

We establish various new results on a problem proposed by Mahler [Some suggestions for further research. Bull. Aust. Math. Soc.29 (1984), 101–108] concerning rational approximation to fractal sets by rational numbers inside and outside the set in question. Some of them provide a natural continuation and improvement of recent results of Broderick, Fishman and Reich, and Fishman and Simmons. A key feature is that many of our new results apply to more general, multi-dimensional fractal sets and require only mild assumptions on the iterated function system. Moreover, we provide a non-trivial lower bound for the distance of a rational number $p/q$ outside the Cantor middle-third set $C$ to the set $C$ , in terms of the denominator $q$ . We further discuss patterns of rational numbers in fractal sets. We highlight two of them: firstly, an upper bound for the number of rational (algebraic) numbers in a fractal set up to a given height (and degree) for a wide class of fractal sets; and secondly, we find properties of the denominator structure of rational points in ‘missing- digit’ Cantor sets, generalizing claims of Nagy and Bloshchitsyn.


2021 ◽  
Vol 30 (2) ◽  
Author(s):  
Tom Gur ◽  
Yang P. Liu ◽  
Ron D. Rothblum

AbstractInteractive proofs of proximity allow a sublinear-time verifier to check that a given input is close to the language, using a small amount of communication with a powerful (but untrusted) prover. In this work, we consider two natural minimally interactive variants of such proofs systems, in which the prover only sends a single message, referred to as the proof. The first variant, known as -proofs of Proximity (), is fully non-interactive, meaning that the proof is a function of the input only. The second variant, known as -proofs of Proximity (), allows the proof to additionally depend on the verifier's (entire) random string. The complexity of both s and s is the total number of bits that the verifier observes—namely, the sum of the proof length and query complexity. Our main result is an exponential separation between the power of s and s. Specifically, we exhibit an explicit and natural property $$\Pi$$ Π that admits an with complexity $$O(\log n)$$ O ( log n ) , whereas any for $$\Pi$$ Π has complexity $$\tilde{\Omega}(n^{1/4})$$ Ω ~ ( n 1 / 4 ) , where n denotes the length of the input in bits. Our lower bound also yields an alternate proof, which is more general and arguably much simpler, for a recent result of Fischer et al. (ITCS, 2014). Also, Aaronson (Quantum Information & Computation 2012) has shown a $$\Omega(n^{1/6})$$ Ω ( n 1 / 6 ) lower bound for the same property $$\Pi$$ Π .Lastly, we also consider the notion of oblivious proofs of proximity, in which the verifier's queries are oblivious to the proof. In this setting, we show that s can only be quadratically stronger than s. As an application of this result, we show an exponential separation between the power of public and private coin for oblivious interactive proofs of proximity.


2019 ◽  
Vol 2019 (746) ◽  
pp. 149-170
Author(s):  
Pekka Pankka ◽  
Juan Souto

Abstract We prove that Kleinian groups whose limit sets are Cantor sets of Hausdorff dimension < 1 are free. On the other hand we construct for any ε > 0 an example of a non-free purely hyperbolic Kleinian group whose limit set is a Cantor set of Hausdorff dimension < 1 + ε.


2022 ◽  
Vol 18 (0) ◽  
pp. 1
Author(s):  
Tim Austin

<p style='text-indent:20px;'>Let <inline-formula><tex-math id="M1">\begin{document}$ a &lt; b $\end{document}</tex-math></inline-formula> be multiplicatively independent integers, both at least <inline-formula><tex-math id="M2">\begin{document}$ 2 $\end{document}</tex-math></inline-formula>. Let <inline-formula><tex-math id="M3">\begin{document}$ A,B $\end{document}</tex-math></inline-formula> be closed subsets of <inline-formula><tex-math id="M4">\begin{document}$ [0,1] $\end{document}</tex-math></inline-formula> that are forward invariant under multiplication by <inline-formula><tex-math id="M5">\begin{document}$ a $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M6">\begin{document}$ b $\end{document}</tex-math></inline-formula> respectively, and let <inline-formula><tex-math id="M7">\begin{document}$ C : = A\times B $\end{document}</tex-math></inline-formula>. An old conjecture of Furstenberg asserted that any planar line <inline-formula><tex-math id="M8">\begin{document}$ L $\end{document}</tex-math></inline-formula> not parallel to either axis must intersect <inline-formula><tex-math id="M9">\begin{document}$ C $\end{document}</tex-math></inline-formula> in Hausdorff dimension at most <inline-formula><tex-math id="M10">\begin{document}$ \max\{\dim C,1\} - 1 $\end{document}</tex-math></inline-formula>. Two recent works by Shmerkin and Wu have given two different proofs of this conjecture. This note provides a third proof. Like Wu's, it stays close to the ergodic theoretic machinery that Furstenberg introduced to study such questions, but it uses less substantial background from ergodic theory. The same method is also used to re-prove a recent result of Yu about certain sequences of sums.</p>


2006 ◽  
Vol 74 (3) ◽  
pp. 443-448 ◽  
Author(s):  
H.K. Baek

For a class of homogeneous Cantor sets, we find an explicit formula for their packing dimensions. We then turn our attention to the value of packing measures. The exact value of packing measure for homogeneous Cantor sets has not yet been calculated even though that of Hausdorff measures was evaluated by Qu, Rao and Su in (2001). We give a reasonable lower bound for the packing measures of homogeneous Cantor sets. Our results indicate that duality does not hold between Hausdorff and packing measures.


1995 ◽  
Vol 06 (01) ◽  
pp. 19-32 ◽  
Author(s):  
NIKOLAY GUSEVSKII ◽  
HELEN KLIMENKO

We construct purely loxodromic, geometrically finite, free Kleinian groups acting on S3 whose limit sets are wild Cantor sets. Our construction is closely related to the construction of the wild Fox–Artin arc.


2015 ◽  
Vol 145 (6) ◽  
pp. 1153-1182 ◽  
Author(s):  
Anne-Maria Ernvall-Hytönen ◽  
Kalle Leppälä ◽  
Tapani Matala-aho

Let 𝕀 denote an imaginary quadratic field or the field ℚ of rational numbers and let ℤ𝕀denote its ring of integers. We shall prove a new explicit Baker-type lower bound for a ℤ𝕀-linear form in the numbers 1, eα1, . . . , eαm,m⩾ 2, whereα0= 0,α1, . . . ,αmarem+ 1 different numbers from the field 𝕀. Our work gives substantial improvements on the existing explicit versions of Baker’s work about exponential values at rational points. In particular, dependencies onmare improved.


Author(s):  
A. F. Beardon

Introduction and notation. In this paper a generalization of the Cantor set is discussed. Upper and lower estimates of the Hausdorff dimension of such a set are obtained and, in particular, it is shown that the Hausdorff dimension is always positive and less than that of the underlying space. The concept of local dimension at a point is introduced and studied as a function of that point.


1997 ◽  
Vol 17 (3) ◽  
pp. 531-564 ◽  
Author(s):  
TIM BEDFORD ◽  
ALBERT M. FISHER

Given a ${\cal C}^{1+\gamma}$ hyperbolic Cantor set $C$, we study the sequence $C_{n,x}$ of Cantor subsets which nest down toward a point $x$ in $C$. We show that $C_{n,x}$ is asymptotically equal to an ergodic Cantor set valued process. The values of this process, called limit sets, are indexed by a Hölder continuous set-valued function defined on Sullivan's dual Cantor set. We show the limit sets are themselves ${\cal C}^{k+\gamma},{\cal C}^\infty$ or ${\cal C}^\omega$ hyperbolic Cantor sets, with the highest degree of smoothness which occurs in the ${\cal C}^{1+\gamma}$ conjugacy class of $C$. The proof of this leads to the following rigidity theorem: if two ${\cal C}^{k+\gamma},{\cal C}^\infty$ or ${\cal C}^\omega$ hyperbolic Cantor sets are ${\cal C}^1$ conjugate, then the conjugacy (with a different extension) is in fact already ${\cal C}^{k+\gamma},{\cal C}^\infty$ or ${\cal C}^\omega$. Within one ${\cal C}^{1+\gamma}$ conjugacy class, each smoothness class is a Banach manifold, which is acted on by the semigroup given by rescaling subintervals. Smoothness classes nest down, and contained in the intersection of them all is a compact set which is the attractor for the semigroup: the collection of limit sets. Convergence is exponentially fast, in the ${\cal C}^1$ norm.


2021 ◽  
Vol 41 (2) ◽  
pp. 227-244
Author(s):  
Steen Pedersen ◽  
Vincent T. Shaw

In this paper we consider a retained digits Cantor set \(T\) based on digit expansions with Gaussian integer base. Let \(F\) be the set all \(x\) such that the intersection of \(T\) with its translate by \(x\) is non-empty and let \(F_{\beta}\) be the subset of \(F\) consisting of all \(x\) such that the dimension of the intersection of \(T\) with its translate by \(x\) is \(\beta\) times the dimension of \(T\). We find conditions on the retained digits sets under which \(F_{\beta}\) is dense in \(F\) for all \(0\leq\beta\leq 1\). The main novelty in this paper is that multiplication the Gaussian integer base corresponds to an irrational (in fact transcendental) rotation in the complex plane.


Sign in / Sign up

Export Citation Format

Share Document