Related papers: Perturbing Subshifts of Finite Type
In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…
The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…
A previously proposed non-canonical coupled-perturbed Kohn-Sham density functional theory (KS-DFT)/Hartree-Fock (HF) treatment for spin-orbit coupling is here generalized to infinite periodic systems. The scalar-relativistic periodic…
Let $\Sigma$ and $\bar\Sigma$ be finite alphabets. For topologically transitive sofic systems $ X\subset \Sigma^{\Bbb Z}$ and $\widetilde X\subset \widetilde\Sigma^{\Bbb Z}$ we give a necessary and sufficient condition for the existence of…
Using a deterministic version of the self-similar (or hierarchical, or fixed-point ) method for constructing 2-dimensional subshifts of finite type (SFTs), we construct aperiodic 2D SFTs with a unique direction of non-expansiveness and…
Let $G$ be a sofic group, and let $\Sigma = (\sigma_n)_{n\geq 1}$ be a sofic approximation to it. For a probability-preserving $G$-system, a variant of the sofic entropy relative to $\Sigma$ has recently been defined in terms of sequences…
We study the little hierarchy between mass parameters in the Higgs sector and other SUSY breaking masses. This type of spectrum can relieve the fine-tuning problem in the MSSM Higgs sector. Our scenario can be realized by superconformal…
Given a Probabilistic Finite Automata (PFA), a set of states S, and an error threshold e > 0, our algorithm approximates the infimum probability (quantifying over all infinite words) that the automata reaches S. Our result contrasts with…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…
We derive universal constraints on $(1+1)d$ rational conformal field theories (CFTs) that can arise as transitions between topological theories protected by a global symmetry. The deformation away from criticality to the trivially gapped…
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we use a program abstraction in which transitions are described by Monotonicity Constraints over (abstract)…
We present a detailed study of the fidelity, the entanglement entropy, and the entanglement spectrum, for a dimerized chain of spinless fermions---a simplified Su-Schrieffer-Heeger (SSH) model---with open boundary conditions which is a…
We introduce the forward limit set $\Lambda$ of a semigroup $S$ generated by a family of substitutions of a finite alphabet, which typically coincides with the set of all possible s-adic limits of that family. We provide several alternative…
We introduce the \emph{CP-distance} to quantify the deviation of Hermitian linear maps from complete positivity, defined as the minimal depolarizing noise required to render a map completely positive. We derive a closed spectral formula for…
We study the entanglement entropy of theories that are derived from relevant perturbation of given CFTs for regions with a singular boundary by using the AdS/CFT correspondence. In the smooth case, it is well known that a relevant…
Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
A rigorous lower bound is obtained for the average resolution of any estimate of a shift parameter, such as an optical phase shift or a spatial translation. The bound has the asymptotic form k_I/<2|G|> where G is the generator of the shift…
We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the…
The notion of tree-shifts constitutes an intermediate class in between one-sided shift spaces and multidimensional ones. This paper proposes an algorithm for computing of the entropy of a tree-shift of finite type. Meanwhile, the entropy of…
The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…