相关论文: Automatic structures for torus link groups

In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…

In this paper we study Thurston's automaton on the braid groups via binary operations. These binary operations are obtained from the construction of this automaton. We study these operations and find some connections between them in a "skew…

Let PSigma_n denote the group that can be thought of either as the group of motions of the trivial n-component link or the group of symmetric automorphisms of a free group of rank n. The integral cohomology ring of PSigma_n is determined,…

A group is boundedly simple if, for some constant N, every nontrivial conjugacy class generates the whole group in N steps. For a large class of trees, Tits proved simplicity of a canonical subgroup of the automorphism group, which is…

We show that any finite monoid or semigroup presentation satisfying the small overlap condition C(4) has word problem which is a deterministic rational relation. It follows that the set of lexicographically minimal words forms a regular…

A homomorphism from a completely metrizable topological group into a free product of groups whose image is not contained in a factor of the free product is shown to be continuous with respect to the discrete topology on the range. In…

Let M be a compact manifold, possibly with boundary. We show that the group of homeomorphisms of M has the automatic continuity property: any homomorphism from Homeo(M) to any separable group is necessarily continuous. This answers a…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Divisibility monoids (resp. Garside monoids) are a natural algebraic generalization of Mazurkiewicz trace monoids (resp. spherical Artin monoids), namely monoids in which the distributivity of the underlying lattices (resp. the existence of…

All knots are known to be hyperbolic, satellite, or torus knots, and one important family is Lorenz links, or T-links, which arise from dynamics. However, it remains difficult to determine the geometric type of a Lorenz link from a…

We study natural linear representations of self-similar groups over finite fields. In particular, we show that if the group is generated by a finite automaton, then obtained matrices are automatic. This shows a new relation between two…

This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings'…

Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\mathbb{Z}$ into…

Consider a smooth connected algebraic group $G$ acting on a normal projective variety $X$ with an open dense orbit. We show that Aut($X$) is a linear algebraic group if so is $G$; for an arbitrary $G$, the group of components of Aut($X$) is…

Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.

It is well-known that the spacetime diagrams of some cellular automata have a fractal structure: for instance Pascal's triangle modulo 2 generates a Sierpinski triangle. It has been shown that such patterns can occur when the alphabet is…

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

We present obstruction results for self-similar groups regarding the generation of free groups. As a main consequence of our main results, we solve an open problem posed by Grigorchuk by showing that in an automaton group where a…

We show that recent results of U. Baumgartner and G.A. Willis concerning contraction groups of automorphisms of metrizable, totally disconnected, locally compact groups remain valid also in the non-metrizable case, if one restricts…

Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…