English
Related papers

Related papers: Lamplighters admit weakly aperiodic SFTs

200 papers

For a group $G$, $\mathcal{F}_G$ denotes the set of all non-empty finite subsets of $G$. We extend the finitary coarse structure of $G$ from $G\times G$ to $\mathcal{F}_G\times \mathcal{F}_G$ and say that a macro-uniform mapping $f:…

Group Theory · Mathematics 2021-03-24 Igor Protasov

Suppose that $X=G/K$ is the quotient of a locally compact group by a closed subgroup. If $X$ is locally contractible and connected, we prove that $X$ is a manifold. If the $G$-action is faithful, then $G$ is a Lie group.

Group Theory · Mathematics 2013-07-23 Karl H. Hofmann , Linus Kramer

We prove that for any $C^1$-stably weakly shadowing transitive set $\Lambda$, either $\Lambda$ is a sink or a source, or $\Lambda$ admits a dominated splitting.

Dynamical Systems · Mathematics 2010-03-11 Dawei Yang

In this paper, a G-shift of finite type (G-SFT) is a shift of finite type together with a free continuous shift-commuting action by a finite group G. We reduce the classification of G-SFTs up to equivariant flow equivalence to an algebraic…

Dynamical Systems · Mathematics 2020-02-12 Mike Boyle , Toke Meier Carlsen , Søren Eilers

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

Group Theory · Mathematics 2026-01-23 Siddhartha Sarkar

We prove that any finitely generated torsion free solvable subgroup of the group ${\rm IET}$ of all Interval Exchange Transformations is virtually abelian. In contrast, the lamplighter groups $A\wr \mathbb{Z}^k$ embed in ${\rm IET}$ for…

Group Theory · Mathematics 2021-04-02 François Dahmani , Koji Fujiwara , Vincent Guirardel

In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…

Discrete Mathematics · Computer Science 2017-06-27 Bruno Durand , Andrei Romashchenko

Given a point p of the topos of simplicial sets and the corresponding flat covariant functor F from the small category Delta to the category of sets, we determine the extensions of F to the cyclic category. We show that to each such cyclic…

Algebraic Geometry · Mathematics 2013-09-03 Alain Connes , Caterina Consani

We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…

Formal Languages and Automata Theory · Computer Science 2014-02-27 Francesca Fiorenzi

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

Group Theory · Mathematics 2022-07-08 Ashot Minasyan

For any nontrivial abelian group $\mathbb{X}$ we construct a reversible (bireversible in case the order of $\mathbb{X}$ is odd) automaton such that its set of states and alphabet are identified with $\mathbb{X}$, transition and output…

Group Theory · Mathematics 2023-08-14 Piotr W. Nowak , Andriy Oliynyk , Veronika Prokhorchuk

A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak…

Logic in Computer Science · Computer Science 2019-08-06 Ahmet A. Husainov

It is a classical result that the set $K\backslash G /B$ is finite, where $G$ is a reductive algebraic group over an algebraically closed field with characteristic not equal to two, $B$ is a Borel subgroup of $G$, and $K = G^{\theta}$ is…

Representation Theory · Mathematics 2024-10-28 Kam Hung Tong

This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…

Discrete Mathematics · Computer Science 2021-05-04 Etienne Moutot , Coline Petit-Jean

For an aperiodic subshift of finite type $Y$ and for a subshift $X$ with topological entropy less than the topological entropy of $Y$, a theorem is proved in Krieger: On the subsystems of topological Markov chains, Ergodic Theory \&…

Dynamical Systems · Mathematics 2025-09-16 Wolfgang Krieger

Let $T(X)$ (resp. L(V)) be the semigroup of all transformations (resp. linear transformations) of a set $X$ (resp. vector space $V$). For a subset $Y$ of $X$ and a subsemigroup $\mathbb{S}(Y)$ of $T(Y)$, consider the subsemigroup…

Group Theory · Mathematics 2023-03-08 Mosarof Sarkar , Shubh N. Singh

It is known that splittings of finitely presented groups over 2-ended groups can be characterized geometrically. We show that this characterization does not extend to all finitely generated groups. Answering a question of Kleiner we show…

Group Theory · Mathematics 2009-11-03 Panos Papasoglu

The proper subgroup $B$ of the group $G$ is called {\it strongly embedded}, if $2\in\pi(B)$ and $2\notin\pi(B \cap B^g)$ for any element $g \in G \setminus B $ and, therefore, $ N_G(X) \leq B$ for any 2-subgroup $ X \leq B $. An element $a$…

Group Theory · Mathematics 2020-04-30 Anatoliy Sozutov

Let $G$ be a locally compact group with left regular representation $\lambda_{G}.$ We say that $G$ admits a frame of translates if there exist a countable set $\Gamma\subset G$ and $\varphi\in L^{2}(G)$ such that $(\lambda_{G}(x)…

Representation Theory · Mathematics 2018-02-09 Hartmut Fuhr , Vignon Oussa

We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…

Discrete Mathematics · Computer Science 2021-07-01 Bruno Durand , Andrei Romashchenko