Box-counting dimensions of popcorn subsets
Let \(S\) be a subset of \(\mathbb N\). Let \[ G_S=\left\{\left(\frac{p}{q},\frac{1}{q}\right):\gcd(p,q)=1,\,1\le p<q,\,q\in S\right\} \] and \[ F_S=\left\{\left(\frac{p}{q},\frac{1}{q}\right):1\le p<q,\,q\in S\right\}. \] \textit{H. Chen} et al. [Proc. Am. Math. Soc. 150, No. 11, 4729--4742 (2022; Zbl 07594306)] proved that the popcorn sets \(G=G_{\mathbb N}\) and \(F=F_{\mathbb N}\) are of Assouad dimension \(2\) and box-counting dimension \(4/3\) by using estimates from number theory and probability. In this paper, by introducing logarithm density and \(\beta\)-condition for \(S\), upper and lower bounds of boxcounting dimensions of some popcorn subsets \(S\) are given.
- Arithmetic patches, weak tangents, and dimension
- Fractals in probability and analysis
- scientific article; zbMATH DE number 44693 (Why is no real title available?)
- scientific article; zbMATH DE number 473229 (Why is no real title available?)
- Khintchine's problem in metric diophantine approximation
- On sets of integers containing k elements in arithmetic progression
- On sets of integers containing no four elements in arithmetic progression
- On the Application of the Borel-Cantelli Lemma
- ON THE PROBLEM OF JACOBSTHAL
- Quasi-lower dimension and quasi-Lipschitz mapping
- Remarks on dimensions of Cartesian product sets
- Some geometric properties of sets defined by digit restrictions
- The difference between consecutive primes. II
- The primes contain arbitrarily long arithmetic progressions
This page was built for publication: Box-counting dimensions of popcorn subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698059)
