错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On the union of homogeneous symmetric Cantor set with its translations

  • Derong Kong,
  • Wenxia Li,
  • Zhiqiang Wang,
  • Yuanyuan Yao,
  • Yunxiu Zhang

摘要

Fix a positive integer N and a real number \(0< \beta < 1/(N+1)\) 0 < β < 1 / ( N + 1 ) . Let \(\Gamma \) Γ be the homogeneous symmetric Cantor set generated by the IFS \(\begin{aligned} \Bigg \{ \phi _i(x)=\beta x + i \frac{1-\beta }{N}: i=0,1,\ldots , N \Bigg \}. \end{aligned}\) { ϕ i ( x ) = β x + i 1 - β N : i = 0 , 1 , , N } . For \(m\in \mathbb {Z}_+\) m Z + we show that there exist infinitely many translation vectors \({\textbf{t}}=(t_0,t_1,\ldots , t_m)\) t = ( t 0 , t 1 , , t m ) with \(0=t_0<t_1<\cdots <t_m\) 0 = t 0 < t 1 < < t m such that the union \(\bigcup _{j=0}^m(\Gamma +t_j)\) j = 0 m ( Γ + t j ) is a self-similar set. Furthermore, for \(0< \beta < 1/(2N+1)\) 0 < β < 1 / ( 2 N + 1 ) , we give a finite algorithm to determine whether the union \(\bigcup _{j=0}^m(\Gamma +t_j)\) j = 0 m ( Γ + t j ) is a self-similar set for any given vector \({\textbf{t}}\) t . Our characterization relies on determining whether some related directed graph has no cycles, or whether some related adjacency matrix is nilpotent.