中文
相关论文

相关论文: Factoring strongly irreducible group shift actions…

200 篇论文

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…

动力系统 · 数学 2024-11-20 Robert Bland

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…

动力系统 · 数学 2013-11-26 Uijin Jung

Let $G$ be an infinite countable amenable group and let $(X,G)$ be a $G$-subshift with specification, containing a free element. We prove that $(X,G)$ is universal, i.e., has positive topological entropy and for any free ergodic $G$-action…

动力系统 · 数学 2025-04-21 Tomasz Downarowicz , Benjamin Weiss , Mateusz Więcek , Guohua Zhang

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

动力系统 · 数学 2023-02-21 Robert Bland , Kevin McGoff , Ronnie Pavlov

We prove that if a free ergodic action of a countably infinite group has positive Rokhlin entropy (or, less generally, positive sofic entropy) then it factors onto all Bernoulli shifts of lesser or equal entropy. This extends to all…

动力系统 · 数学 2019-05-23 Brandon Seward

It is well known that if $G$ is a countable amenable group and $G \curvearrowright (Y, \nu)$ factors onto $G \curvearrowright (X, \mu)$, then the entropy of the first action must be greater than or equal to the entropy of the second action.…

动力系统 · 数学 2014-07-07 Brandon Seward

Let $G$ be a finitely generated amenable group. We study the space of shifts on $G$ over a given finite alphabet $A$. We show that the zero entropy shifts are generic in this space, and that more generally the shifts of entropy $c$ are…

动力系统 · 数学 2018-04-24 Joshua Frisch , Omer Tamuz

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

动力系统 · 数学 2025-11-07 Sebastián Barbieri

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…

动力系统 · 数学 2023-05-09 Jacob Raymond

We give a sufficient condition for a symbolic topological dynamical system with action of a countable amenable group to be an extension of the full shift, a problem analogous to those studied by Ashley, Marcus, Johnson and others for…

动力系统 · 数学 2019-01-07 Bartosz Frej , Dawid Huczek

Let G be an infinite discrete countable amenable group acting continuously on a Lebesgue space X. In this article, using partition and factor-space, the conditional entropy of the action G is defined. We introduction some properties of…

动力系统 · 数学 2025-05-06 Yuan Lian , Bin Zhu

Let $G$ be an amenable group and let $A$ be a finite set. We prove that if $X \subset A^G$ is a strongly irreducible subshift then $X$ has the Myhill property, that is, every pre-injective cellular automaton $\tau \colon X \to X$ is…

动力系统 · 数学 2012-02-01 Tullio Ceccherini-Silberstein , Michel Coornaert

Let $G$ be a countable residually finite group (for instance $\mathbb{F}_2$) and let $\overleftarrow{G}$ be a totally disconnected metric compactification of $G$ equipped with the action of $G$ by left multiplication. For every $r\geq 1$ we…

动力系统 · 数学 2024-11-20 Paulina Cecchi Bernales , María Isabel Cortez , Jaime Gómez

Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for $G$-shifts, where $G$ is a finitely generated group with decidable word problem. A $G$-shift has strong…

形式语言与自动机理论 · 计算机科学 2025-06-13 Djamel Eddine Amir , Benjamin Hellouin de Menibus

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

群论 · 数学 2015-07-07 Emmanuel Jeandel

We prove that if $G$ is a countable, discrete group having infinite, normal subgroups with the relative property (T), then the Bernoulli shift action of $G$ on ${\underset g \in G \to \Pi} (X_0, \mu_0)_g$ for $(X_{0},\mu_{0})$ an arbitrary…

算子代数 · 数学 2007-05-23 Sorin Popa , Roman Sasyk

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

动力系统 · 数学 2025-09-10 Robert Bland , Kevin McGoff

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…

形式语言与自动机理论 · 计算机科学 2015-08-27 Emmanuel Jeandel

Given a topologically free action of a countably infinite amenable group on the Cantor set, we prove that, for every subgroup $G$ of the topological full group containing the alternating group, the group von Neumann algebra $\mathscr{L} G$…

算子代数 · 数学 2023-11-15 David Kerr , Spyridon Petrakos

In this note, we prove that if G is a countable group that contains a nonabelian free subgroup then every pair of nontrivial Bernoulli shifts over G are weakly isomorphic.

动力系统 · 数学 2008-12-16 Lewis Bowen
‹ 上一页 1 2 3 10 下一页 ›