2410.19237
INTERSECTIONS OF CANTOR SETS DERIVED FROM COMPLEX RADIX EXPANSIONS
Neil MacVicar
correctmedium confidence
- Category
- Not specified
- Journal tier
- Strong Field
- Processed
- Sep 28, 2025, 12:56 AM
- arXiv Links
- Abstract ↗PDF ↗
Audit review
Both the paper and the model obtain density of level sets for the box/ Hausdorff/ packing dimension of C_{n,D} ∩ (C_{n,D}+α) under the same separation hypotheses, by coding α with a Δ-expansion and forcing long runs that alternate “branching” steps (α_j=0 ⇒ multiplicity |D|) with “freezing” steps (α_j = max D − min D ⇒ multiplicity 1). The paper proves the key dimension formula via tile-counting/Moran arguments and then sets β_j ∈ {0, M} using a counting sequence h_j = ⌊jλ⌋ to tune the frequency and achieve any target value, with density obtained by fixing an initial prefix and modifying the tail. The model’s construction is the same in substance, making the disjointness explicit by inserting sufficiently long freezing blocks and then computing the dimension from the average logarithmic branching rate. Any minor differences (e.g., the model’s explicit disjoint-Moran substructure versus the paper’s tile and Moran formalism) are cosmetic.
Referee report (LaTeX)
\textbf{Recommendation:} minor revisions \textbf{Journal Tier:} strong field \textbf{Justification:} The results are correct and the method is conceptually simple yet effective, improving known separation constraints and providing a flexible coding framework. Some statements could be clarified, especially regarding when uniqueness of the Δ-expansion is used and the precise role of the Moran framework, but these are minor presentation issues.