惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

F
Fortinet All Blogs
爱范儿
爱范儿
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
B
Blog
WordPress大学
WordPress大学
Jina AI
Jina AI
GbyAI
GbyAI
aimingoo的专栏
aimingoo的专栏
N
Netflix TechBlog - Medium
腾讯CDC
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
阮一峰的网络日志
阮一峰的网络日志
The GitHub Blog
The GitHub Blog
V
Visual Studio Blog
Google DeepMind News
Google DeepMind News
月光博客
月光博客
博客园 - Franky
Y
Y Combinator Blog
MyScale Blog
MyScale Blog
大猫的无限游戏
大猫的无限游戏
Martin Fowler
Martin Fowler
雷峰网
雷峰网
小众软件
小众软件
H
Hackread – Cybersecurity News, Data Breaches, AI and More

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Critical base for the unique codings of fat Sierpinski ga...
Derong Kong, Wenxia Li · 2018-12-03 · via math.CO updates on arXiv.org

Given $β\in(1,2)$ the fat Sierpinski gasket $\mathcal S_β$ is the self-similar set in $\mathbb R^2$ generated by the iterated function system (IFS) \[ f_{β,d}(x)=\frac{x+d}β,\quad d\in\mathcal A:=\{(0, 0), (1,0), (0,1)\}. \] Then for each point $P\in\mathcal S_β$ there exists a sequence $(d_i)\in\mathcal A^\mathbb N$ such that $P=\sum_{i=1}^\infty d_i/β^i$, and the infinite sequence $(d_i)$ is called a \emph{coding} of $P$. In general, a point in $\mathcal S_β$ may have multiple codings since the overlap region $\mathcal O_β:=\bigcup_{c,d\in\mathcal A, c\ne d}f_{β,c}(Δ_β)\cap f_{β,d}(Δ_β)$ has non-empty interior, where $Δ_β$ is the convex hull of $\mathcal S_β$. In this paper we are interested in the invariant set \[ \widetilde{\mathcal U}_β:=\left\{\sum_{i=1}^\infty \frac{d_i}{β^i}\in \mathcal S_β: \sum_{i=1}^\infty\frac{d_{n+i}}{β^i}\notin\mathcal O_β~\forall n\ge 0\right\}. \] Then each point in $ \widetilde{\mathcal U}_β$ has a unique coding. We show that there is a transcendental number $β_c\approx 1.55263$ related to the Thue-Morse sequence, such that $\widetilde{\mathcal U}_β$ has positive Hausdorff dimension if and only if $β>β_{c}$. Furthermore, for $β=β_c$ the set $\widetilde{\mathcal U}_β$ is uncountable but has zero Hausdorff dimension, and for $β<β_c$ the set $\widetilde{\mathcal U}_β$ is at most countable. Consequently, we also answer a conjecture of Sidorov (2007). Our strategy is using combinatorics on words based on the lexicographical characterization of $\widetilde{\mathcal U}_β$.