English
Related papers

Related papers: Embedding subshifts of finite type into the Fibona…

200 papers

Generalizing a result of MacDonald we give necessary and sufficient conditions for an arbitrary subshift to embed into an irreducible sofic shift factoring through a given cover by an irreducible subshift of finite type (SFT). We obtain…

Dynamical Systems · Mathematics 2025-09-09 Brian Marcus , Tom Meyerovitch , Klaus Thomsen , Chengyu Wu

Krieger's embedding theorem provides necessary and sufficient conditions for an arbitrary subshift to embed in a given topologically mixing $\mathbb{Z}$-subshift of finite type. For some $\mathbb{Z}^d$-subshifts of finite type, Lightwood…

Dynamical Systems · Mathematics 2025-05-07 Tom Meyerovitch

Let $G$ be a connected reductive group. We find a necessary and sufficient condition for a quasiaffine homogeneous space of $G$ to be embeddable into an irreducible $G$-module. In addition, for an affine homogeneous space we find a…

Representation Theory · Mathematics 2010-06-03 Ivan V. Losev

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 study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…

Formal Languages and Automata Theory · Computer Science 2013-11-19 Marie-Pierre Béal , Michel Blockelet , Cǎtǎlin Dima

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…

Group Theory · Mathematics 2018-09-25 Ville Salo

We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…

Dynamical Systems · Mathematics 2007-05-23 Daniel Lenz

A necessary and sufficient condition is given for a subshift presentation to have a continuous $g$-function. An invariant necessary and sufficient condition is formulated for a subshift to posses a presentation that has a continuous…

Dynamical Systems · Mathematics 2007-05-23 Wolfgang Krieger

Necessary and sufficient conditions for a group to possess a faithful irreducible representation are investigated

Representation Theory · Mathematics 2016-11-01 Fernando Szechtman , Anatoliy Tushev

We give sufficient conditions to find all subtypes isomorphic to a subtype in a finite generalized ordered type.

Logic · Mathematics 2025-06-16 Jean S. Joseph

We prove that a hyperbolic group admits a strongly aperiodic subshift of finite type if and only if it has at most one end.

Group Theory · Mathematics 2017-06-08 David Bruce Cohen , Chaim Goodman-Strauss , Yo'av Rieck

We give a sufficient condition for a projective metric on a subset of a Euclidean space to admit a bi-Lipschitz embedding into Euclidean space of the same dimension.

Metric Geometry · Mathematics 2014-06-17 Leonid V. Kovalev

We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…

Dynamical Systems · Mathematics 2024-11-20 Robert Bland

We formulate explicitly the necessary and sufficient conditions for the local invertibility of a field transformation involving derivative terms. Our approach is to apply the method of characteristics of differential equations, by treating…

High Energy Physics - Theory · Physics 2019-11-11 Eugeny Babichev , Keisuke Izumi , Norihiro Tanahashi , Masahide Yamaguchi

Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code…

Dynamical Systems · Mathematics 2013-11-26 Uijin Jung

Surface incompressibility, also called inextensibility, imposes a zero-surface-divergence constraint on the velocity of a closed deformable material surface. The well-posedness of the mechanical problem under such constraint depends on an…

Numerical Analysis · Mathematics 2015-07-28 Gustavo C. Buscaglia

Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…

Dynamical Systems · Mathematics 2015-09-10 Jung-Chao Ban , Chih-Hung Chang

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…

Dynamical Systems · Mathematics 2019-04-05 Silvère Gangloff , Benjamin Hellouin de Menibus

We describe the necessary and sufficient numerical condition when an element $X$ in the Picard group of $K(2)$-local category at prime $p \geqslant 5$ is of finite type, i.e., $\pi_kX$ is finitely generated as a $\mathbb{Z}_p$-module for…

Algebraic Topology · Mathematics 2021-10-19 Guchuan Li

We augment the body of existing results on embedding finite semigroups of a certain type into 2-generator finite semigroups of the same type. The approach adopted applies to finite semigroups the idempotents of which form a band and also to…

Group Theory · Mathematics 2019-01-25 Peter M. Higgins
‹ Prev 1 2 3 10 Next ›