Automaticity of structural defects in fixed points of block substitutions
Lior Tenenbaum
Abstract
We study structural defects in fixed points of block substitutions, building on arXiv:2604.12637 and providing its technical supplement. We develop an automata-based framework to characterize their occurrence and derive verifiable combinatorial criteria. We also introduce simplifications for the construction and analysis of these automata, including tensor-product decompositions, that clarify the mechanisms underlying structural defects and their emergence.
Create a lesson
Related papers
A face polynomial invariant for embedded graphs
Hongxia Ma, Metrose Metsidik
Odd-ordered Cayley graphs satisfy Erdős--Gyárfás
Michael C. Burkhart
The Maximum Second Zagreb Spectral Radius of Trees, Unicyclic Graphs and Bicyclic Graphs
Juan Wang, Genjie Wang
A Low-Diameter Nash-Williams--Tutte Theorem
Pin-Hsian Lee, Peng-Ting Lin, Meng-Tsung Tsai et al.
A Short Proof and Generalization of the Rainbow Cycle Theorem and Improved Bounds for Binary Even-Query LCCs
Andrew D. Lin
Two-block paths in oriented graphs under the Ore-type condition
Ke Zhao, Jia Zhou, Yunshu Gao