English
Related papers

Related papers: Perturbing Subshifts of Finite Type

200 papers

Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by monotonicity constraints over…

Logic in Computer Science · Computer Science 2015-07-01 Amir M. Ben-Amram

Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…

Dynamical Systems · Mathematics 2012-01-04 Christopher Hoffman

We continue the study of entanglement entropy for a QFT through a perturbative expansion of the path integral definition of the reduced density matrix. The universal entanglement entropy for a CFT perturbed by a relevant operator is…

High Energy Physics - Theory · Physics 2015-06-23 Vladimir Rosenhaus , Michael Smolkin

Dependence among marginally constrained observations can break a finite-sample barrier. To formalize this phenomenon, we introduce the \emph{minimum list entropy coupling} $H(P\|Q_1,\dots,Q_m)$, the minimum conditional entropy…

Information Theory · Computer Science 2026-05-18 Shahab Asoodeh , Jun Chen

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

Formal Languages and Automata Theory · Computer Science 2021-12-23 Gabriele Fici , Jeffrey Shallit

We show that the limit in our definition of tree shift topological entropy is actually the infimum, as is the case for both the topological and measure-theoretic entropies in the classical situation when the time parameter is $\mathbb Z$.…

Dynamical Systems · Mathematics 2019-09-12 Karl Petersen , Ibrahim Salama

Recent efforts have focused on characterizing the set of separable states that cannot be made entangled by any global unitary transformation. Here we characterize the set of states whose entanglement content cannot be increased under any…

Quantum Physics · Physics 2026-04-06 Jofre Abellanet-Vidal , Guillem Müller-Rigat , Albert Rico , Anna Sanpera

Let $G$ be a countable infinite amenable group, $K$ a finite-dimensional compact metrizable space, and $(K^G,\sigma)$ the full $G$-shift on $K^G$. For any $r\in [0,{\rm mdim}(K^G,\sigma))$, we construct a minimal subshift $(X,\sigma)$ of…

Dynamical Systems · Mathematics 2024-12-23 Xiangtong Wang , Hang Zhao

A subgroup $H$ of a finite group $G$ is said to be SS-permutable in $G$ if $H$ has a supplement $K$ in $G$ such that $H$ permutes with every Sylow subgroup of $K$. A finite group $G$ is called an SST-group if SS-permutability is a…

Group Theory · Mathematics 2015-08-05 Xiaoyu Chen , Wenbin Guo

We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on…

Dynamical Systems · Mathematics 2021-06-25 Van Cyr , Bryna Kra

Barbieri and Hall have argued that threshold effects at the scale of grand-unification wipe out predictions on the SUSY scale, M_S. Using triviality arguments we give upper bounds on ultraheavy particles, while proton stability gives lower…

High Energy Physics - Phenomenology · Physics 2009-10-22 Alon E. Faraggi , Benjamin Grinstein , Sydney Meshkov

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…

Combinatorics · Mathematics 2019-04-19 Andrew MacFie

Non-invertible symmetries in quantum field theory (QFT) generalize the familiar product rule of groups to a more general fusion rule. In many cases, gauged versions of these symmetries can be regarded as dual descriptions of invertible…

High Energy Physics - Theory · Physics 2024-02-02 Jonathan J. Heckman , Jacob McNamara , Miguel Montero , Adar Sharon , Cumrun Vafa , Irene Valenzuela

We extend the convergence law for sparse random graphs proven by Lynch to arbitrary relational languages. We consider a finite relational vocabulary $\sigma$ and a first order theory $T$ for $\sigma$ composed of symmetry and…

Combinatorics · Mathematics 2020-06-15 Lázaro Alberto Larrauri

The concept of distinguishability lies at the heart of quantum information theory. We introduce \textit{left-right relative entropy} as a quantitative measure of distinguishability within the space of boundary states in two-dimensional…

High Energy Physics - Theory · Physics 2026-05-26 Mostafa Ghasemi

We consider the number of occurrences of subwords (non-consecutive sub-sequences) in a given word. We first define the notion of subword entropy of a given word that measures the maximal number of occurrences among all possible subwords. We…

Combinatorics · Mathematics 2025-10-06 Wenjie Fang

We argue that in large classes of string compactifications with a MSSM-like structure substantial flavor violating SUSY-breaking soft terms are generically induced. We specify to the case of flavor dependent soft-terms in type IIB/F-theory…

High Energy Physics - Theory · Physics 2015-06-16 Pablo G. Camara , Luis E. Ibanez , Irene Valenzuela

It is shown that the variance of a perturbation Hamiltonian density vanishes in the infinite-volume limit of the perturbed spin systems with quenched disorder. This is proven in a simpler way and under less assumptions than before. A…

Mathematical Physics · Physics 2020-07-28 C. Itoi

Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2018-09-06 Jean Néraud , Carla Selmi

We prove a new version of the Uncertainty Principle of the form $\int |f|^2 \lesssim \int_{E^c} |f|^2 + \int_{\Sigma ^c}|\hat f|^2 $ where the sets $E$ and $\Sigma$ are $\epsilon$-thin in the following sense: $|E \cap D(x, \rho_1(x))| \le…

Classical Analysis and ODEs · Mathematics 2007-05-23 O. Kovrizhkin