Algorithms to test open set condition for self-similar set related to P.V. numbers

DOI10.1016/J.JMAA.2014.07.032zbMATH Open1305.28022arXiv1405.0781OpenAlexW2963232002MaRDI QIDQ401376FDOQ401376

Hao Li, Lifeng Xi, Qiuli Guo, Qin Wang

Publication date: 26 August 2014

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Abstract: Fix a P.V. number $lambd{a}^{-1}>1.$ Given $mathbfp=(p_1,cdots,p_m)inmathbb{N}^m$, $$, for the self-similar set $E_{mathbfp,mathbfb}=cu{p}_{i=1}^m(lambd{a}^{p_i}{E}_{mathbfp,mathbfb}+b_i)$ we find an efficient algorithm to test whether $E_{mathbfp,mathbfb}$ satisfies the open set condition (strong separation condition) or not.

Full work available at URL: https://arxiv.org/abs/1405.0781

zbMATH Keywords

fractalself-similar setPisot numberopen set condition

Mathematics Subject Classification ID

Fractals (28A80)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A note on two problems in connexion with graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Separation Properties for Self-Similar Sets
• On the random series \(\sum\pm\lambda^ n\) (an Erdös problem)
• Quasi-Lipschitz equivalence of quasi Ahlfors-David regular sets
• Arithmetic Properties of Bernoulli Convolutions
• Hausdorff Dimension in Graph Directed Constructions
• On the Lipschitz equivalence of Cantor sets
• On self-similar sets with overlaps and inverse theorems for entropy
• On the shape of Cantor sets
• HAUSDORFF DIMENSION OF SELF-SIMILAR SETS WITH OVERLAPS
• Projecting the one-dimensional Sierpiński gasket
• The Hausdorff dimension of self-affine fractals
• Self-similar sets with initial cubic patterns
• Separation conditions for conformal iterated function systems
• Self-Similar Sets 7. A Characterization of Self-Similar Fractals with Positive Hausdorff Measure
• Lipschitz equivalence of a class of self-similar sets with complete overlaps
• Multifractal formalism for self-similar measures with weak separation condition
• Multifractal measures and a weak separation condition
• A class of self-similar fractals with overlap structure
• Lipschitz equivalence of self-similar sets and hyperbolic boundaries
• Self-similar fractals: an algorithmic point of view
• Lipschitz equivalence of generalized \(\{1,3,5\}-\{1,4,5\}\) self-similar sets
• Iterated function systems of finite type and the weak separation property
• Lipschitz equivalence of Cantor sets and algebraic properties of contraction ratios
• Finite type, open set conditions and weak separation conditions
• Iterated Function Systems with Overlaps and Self-Similar Measures
• Weak separation properties for self-similar sets
• Fractal geometry, Turing machines and divide-and-conquer recurrences
• Lipschitz equivalence of fractals generated by nested cubes
• LIPSCHITZ EQUIVALENCE OF SELF-CONFORMAL SETS
• On the Morphology of γ-Expansions with Deleted Digits
• The Hausdorff Dimension of λ-Expansions with Deleted Digits
• Lipschitz equivalence of self-similar sets with touching structures
• ON THE DIMENSION OF SELF-SIMILAR SETS
• On a conjecture of Furstenberg
• Lipschitz equivalence of dust-like self-similar sets
• Lipschitz equivalence of self-similar sets
• A generalized finite type condition for iterated function systems

Cited In (1)

• GAP SEQUENCES OF GRAPH-DIRECTED SETS

This page was built for publication: Algorithms to test open set condition for self-similar set related to P.V. numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q401376)