Related papers: Some non-contracting automata groups

The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This…

We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…

In this paper, we study the so-called diagram groups. Our main result is that diagram groups are free if and only if they do not contain any subgroup isomorphic to $\mathbb{Z}^2$. As an immediate corollary, we get that hyperbolic diagram…

We provide a unifying approach which links results on algebraic actions by Lind and Schmidt, Chung and Li, and a topological result by Meyerovitch that relates entropy to the set of asymptotic pairs. In order to do this we introduce a…

We construct new examples of CAT(0) groups containing non finitely presented subgroups that are of type $FP_2$, these CAT(0) groups do not contain copies of $\mathbb{Z}^3$. We also give a construction of groups which are of type $F_n$ but…

We show some sufficient conditions for a finitely presented group $G = A \rtimes Q$, with $A$ and $Q$ abelian and the Krull dimension of $A$ equals to $2$ to be not self-similar. This is in contrast to the case of the Krull dimension of $A$…

The group of isometries of the hyperbolic 3-space is one of the simplest non-commutative complex Lie groups. Its quotient by the maximal compact subgroup naturally maps it back to the hyperbolic space. Each fiber of this map is…

We consider a family of 2-step nilpotent Lie algebras associated to uniform complete graphs on odd number of vertices. We prove that the symmetry group of such a graph is the holomorph of the additive cyclic group $\Z_n$. Moreover, we prove…

We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is…

We first formulate a general scheme for the classification of 2-compact groups in terms of maximal torus normalizer pairs. Applying this scheme, we show that all connected and some non-connected 2-compact groups are N-determined. We also…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

Suppose $G$ is a finitely generated group and $H$ is a subgroup of $G$. Let $\partial_{c}^{\mathcal{F}\mathcal{Q}}G$ denote the contracting boundary of $G$ with the topology of fellow travelling quasi-geodesics defined by Cashen-Mackay…

The existence of Hamiltonian cycles in 1-planar graphs with higher connectivity has attracted considerable attention. Recently, the authors and Dong proved that 4-connected 1-planar chordal graphs are Hamiltonian-connected. In this paper,…

We look at group actions on metric spaces, particularly at group actions on geodesic hyperbolic spaces. We classify the types of automorphisms on these spaces and prove several results about the density of the hyperbolic limit set of the…

In earlier papers, we showed a decomposition of 2-diregular digraphs (2-dds) and used it to provide some sufficient conditions for these graphs to be non-Hamiltonian; we also showed a close connection between the permanent and determinant…

We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…

We show that any graph product of finitely generated groups is hierarchically hyperbolic relative to its vertex groups. We apply this result to answer two questions of Behrstock, Hagen, and Sisto: we show that the syllable metric on any…

Addressing a question of Zaremsky, we give conditions on a finite simplicial graph which guarantee that the associated matching arc complex is connected and hyperbolic.