Related papers: Perturbing Subshifts of Finite Type

This article is dedicated to the following class of problems. Start with an $N\times N$ Hermitian matrix randomly picked from a matrix ensemble - the reference matrix. Applying a rank-$t$ perturbation to it, with $t$ taking the values $1\le…

When massless particles are involved, the traditional scattering matrix ($S$-matrix) does not exist: it has no rigorous non-perturbative definition and has infrared divergences in its perturbative expansion. The problem can be traced to the…

We show that for any invariant measure $\mu$ on a free group shift system, there are two numbers $h^\flat \leq h^\sharp$ which in some sense are the typical upper and lower sofic entropy values. We also give a condition under which $h^\flat…

A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of…

Let $S$ be a subset of $\{1,\ldots,N\}$ avoiding the nontrivial progressions $x, x+y^2-1, x+ 2(y^2-1)$. We prove that $|S|\ll N/\log_m{N}$, where $\log_m $ is the $m$-fold iterated logarithm and $m\in\mathbf{N}$ is an absolute constant.…

We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…

We investigate the consequence of two Lip$(\gamma)$ functions, in the sense of Stein, being close throughout a subset of their domain. A particular consequence of our results is the following. Given $K_0 > \varepsilon > 0$ and $\gamma >…

Supervised Fine-Tuning (SFT) is the standard paradigm for domain adaptation, yet it frequently incurs the cost of catastrophic forgetting. In sharp contrast, on-policy Reinforcement Learning (RL) effectively preserves general capabilities.…

Let $D$ be a dictionary in a Hilbert space $H$, that is, a set of unit elements whose linear combinations are dense in $H$. We consider the least $m$-term deviation $\sigma_m(x)$ of an element $x\in H$: this is the distance of $x$ from the…

In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…

We consider perturbed discrete tight-binding models in $\ell^2(\mathbb{Z_h},\mathcal{G})$ describing union of quantum particles with localized interactions, where $\mathbb{Z_h}$ is the 1D lattice $h\mathbb{Z_h}$, $h > 0$, and $\mathcal G$…

The threshold behaviour of the K-Satisfiability problem is studied in the framework of the statistical mechanics of random diluted systems. We find that at the transition the entropy is finite and hence that the transition itself is due to…

Finite alphabets of at least three letters permit the construction of square-free words of infinite length. We show that the entropy density is strictly positive and derive reasonable lower and upper bounds. Finally, we present an…

It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…

We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…

We give sufficient conditions for a shift space $(\Sigma,\sigma)$ to be intrinsically ergodic, along with sufficient conditions for every subshift factor of $\Sigma$ to be intrinsically ergodic. As an application, we show that every…

It is a question of Hochman whether any two one-dimensional topologically mixing subshifts of finite type (SFTs) with the same entropy are topologically conjugate when their periodic points are removed. We give a negative answer, in fact we…

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

We examine the behavior of the entanglement asymmetry in the ground state of a (1+1)-dimensional conformal field theory with a boundary condition that explicitly breaks a bulk symmetry. Our focus is on the asymmetry of a subsystem $A$…