Related papers: Perturbing Subshifts of Finite Type

We consider perturbation defects obtained by perturbing a 2D conformal field theory (CFT) by a relevant operator on a half-plane. If the perturbed bulk theory flows to an infrared fixed point described by another CFT, the defect flows to a…

Given a one-sided subshift $X$ on a finite alphabet, we consider the semigroup $S_X =L_X \cup \{0\}$, where $L_X $ is the language of $X $, equipped with the multiplication operation given by concatenation, when allowed, and set to vanish…

Standard negative log-likelihood (NLL) for Supervised Fine-Tuning (SFT) applies uniform token-level weighting. This rigidity creates a two-fold failure mode: (i) overemphasizing low-probability targets can amplify gradients on noisy…

Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to…

Let $G$ be a locally compact abelian group, and let $\widehat{G}$ denote its dual group, equipped with a Haar measure. A variant of the uncertainty principle states that for any $S \subset G$ and $\Sigma \subset \widehat{G}$, there exists a…

We demonstrate that linear combinations of subregion entropies with canceling boundary terms, commonly used to calculate the topological entanglement entropy, may suffer from spurious nontopological contributions even in models with zero…

We study subshift that arise by excluding words of length two from Dyck shifts. The words that are to be excluded are taken from a finite set that is not literal-uniform.

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…

We present a streamlined proof of a result essentially present in previous work of the author, namely that for every set $S = \{s_1, s_2, \ldots\} \subset \mathbb{N}$ of zero Banach density and finite set $A$, there exists a minimal…

We present a unifying approach to the study of entropies in Mathematics, such as measure entropy, topological entropy, algebraic entropy, set-theoretic entropy. We take into account discrete dynamical systems, that is, pairs $(X,T)$, where…

We investigate the expressive power of quantifier alternation hierarchy of first-order logic over words. This hierarchy includes the classes ${\Sigma}_i$ (sentences having at most $i$ blocks of quantifiers starting with an $\exists$) and…

Necessary and sufficient conditions are given for the similarity between two perturbations of the (backward) shift by rank one operators, under certain assumptions on the perturbations. The proof of similarity is based on an explicit…

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

A new functional for the entropy that is asymptotically correct both in the high and low density limits is proposed. The new form is [ S=S^{(id)}+S^{(ln)}+S^{(r)}+S^{(c)} ] where the new term S^{(c)} depends on the p-bodies density…

We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…

We show that if $y=(y_n)_{n\ge 1}$ is a bounded sequence with zero average along every infinite arithmetic progression then for every $N\ge 2$ there exist (unilateral or bilateral) subshifts $\Sigma$ over $N$ symbols, with entropy…

The general form of soft supersymmetry breaking terms at one loop for effective supergravity models based on the weakly-coupled heterotic string are presented, with special emphasis on those terms arising from the superconformal anomaly.…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing…

It is well known that if $G$ admits a f.g. subgroup $H$ with a weaklyaperiodic SFT (resp. an undecidable domino problem), then $G$itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the…