相关论文: Perturbing Subshifts of Finite Type

In this work, we investigate the consistency of a perturbative definition of the S-matrix in a particular class of non-Lagrangian theories. We focus on the $p$-form theories proposed in \cite{Broccoli:2021pvv}, which are fully defined by…

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…

A subshift of finite type over finitely many symbols can be described as a collection of all infinite walks on a digraph with at most a single edge from a vertex to another. The associated finite set $\F$ of forbidden words is a constraint…

The study of entanglement in the symmetry sectors of a theory has recently attracted a lot of attention since it provides better understanding of some aspects of quantum many-body systems. In this paper, we extend this analysis to the case…

We provide a framework for a perturbative evaluation of the reduced density matrix. The method is based on a path integral in the analytically continued spacetime. It suggests an alternative to the holographic and `standard' replica trick…

We study suspension flows defined over sub-shifts of finite type with continuous roof functions. We prove the existence of suspension flows with uncountably many ergodic measures of maximal entropy. More generally, we prove that any…

We introduce a class of subshifts governed by finitely many two-sided infinite words. We call these words leading sequences. We show that any locally constant cocycle over such a subshift is uniform. From this we obtain Cantor spectrum of…

In this article, we explore properties of pseudo entropy [1] in quantum field theories and spin systems from several approaches. Pseudo entropy is a generalization of entanglement entropy such that it depends on both an initial and final…

The method of maximum entropy has been very successful but there are cases where it has either failed or led to paradoxes that have cast doubt on its general legitimacy. My more optimistic assessment is that such failures and paradoxes…

We approximate functionals depending on the gradient of $u$ and on the behaviour of $u$ near the discontinuity points, by families of non-local functionals where the gradient is replaced by finite differences. We prove pointwise…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

The non-emptiness, called the Domino Problem, and the characterization of the possible entropies of $\mathbb{Z}^2$-subshifts of finite type are standard problems of symbolic dynamics. In this article we study these questions with horizontal…

In this paper for a finite field $F$, a nonempty set $\Gamma$, a self--map $\varphi:\Gamma\to\Gamma$ and a weight vector $\mathfrak{w}\in F^\Gamma$, we show that the set--theoretical entropy of the weighted generalized shift…

Supervised fine-tuning (SFT) is a fundamental post-training strategy to align Large Language Models (LLMs) with human intent. However, traditional SFT often ignores the one-to-many nature of language by forcing alignment with a single…

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Given a factor code between sofic shifts X and Y, there is a family of decompositions of the original code into factor codes such that the entropies of the intermediate subshifts arising from the decompositions are dense in the interval…

The entanglement entropy of spacetime regions $A$ in odd-dimensional conformal field theories (CFTs) contains a universal constant term, $(-1)^{\frac{d-1}{2}}F(A)$. This quantity can be robustly defined by considering the mutual information…

We place theoretical constraints on the leading deviations to four-fermion standard model interactions. Invoking S-matrix analyticity and partial wave unitarity, we develop new dispersion relations that yield either spin-dependent sum rules…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

The attracting set and the inverse limit set are important objects associated to a self-map on a set. We call \emph{stable set} of the self-map the projection of the inverse limit set. It is included in the attracting set, but is not equal…