Related papers: On continuing codes
We investigate the stability of the topological phase of the toric code model in the presence of a uniform magnetic field by means of variational and high-order series expansion approaches. We find that when this perturbation is strong…
A new approach to find all the transitive orientations for a comparability graph (finite or infinite) is presented. This approach is based on the link between the notion of ``strong'' partitive set and the forcing theory (notions of…
We solve several problems on frequently hypercyclic operators. Firstly, we characterize frequently hypercyclic weighted shifts on $\ell^p(\mathbb Z)$, $p\geq 1$. Our method uses properties of the difference set of a set with positive upper…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem…
Approximations of functions with finite data often do not respect certain "structural" properties of the functions. For example, if a given function is non-negative, a polynomial approximation of the function is not necessarily also…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…
Given two graphs G and H, there is a bi-resolving (or bi-covering) graph homomorphism from G to H if and only if their adjacency matrices satisfy certain matrix relations. We investigate the bi-covering extensions of bi-resolving…
For full shifts on finite alphabets, Coelho and Quas showed that the map that sends a H\"older continuous potential $\phi$ to its equilibrium state $\mu_\phi$ is $\overline{d}$-continuous. We extend this result to the setting of full shifts…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
This paper is a continuation of work started in \cite{njampavcont} on preserving continuity in ideal topological spaces. We will deal with $\theta$-continuity and weak continuity and give their translations in ideal topological spaces. As…
Code cloning is not only assumed to inflate maintenance costs but also considered defect-prone as inconsistent changes to code duplicates can lead to unexpected behavior. Consequently, the identification of duplicated code, clone detection,…
The smooth function reconstruction needs to use derivatives. In 2010, we used the gradually varied derivatives to successfully constructed smooth surfaces for real data. We also briefly explained why the gradually varied derivatives are…
We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…
It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
We study multifractal decompositions based on Birkhoff averages for sequences of functions belonging to certain classes of symbolically continuous functions. We do this for an expanding interval map with countably many branches, which we…
We show that conformal blocks simplify greatly when there is a large difference between two of the scaling dimensions for external operators. In particular the spacetime dimension only appears in an overall constant which we determine via…
In this paper, we first give a necessary and sufficient condition for a factor code with an unambiguous symbol to admit a subshift of finite type restricted to which it is one-to-one and onto. We then give a necessary and sufficient…