相关论文: Automatic structures for torus link groups

We obtain a criterion for the automorphism group of an affine toric variety to be connected in combinatorial terms and in terms of the divisor class group of the variety. The component group of the automorphism group of a non-degenerate…

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…

The Coxeter groups that act geometrically on euclidean space have long been classified and presentations for the irreducible ones are encoded in the well-known extended Dynkin diagrams. The corresponding Artin groups are called euclidean…

In a seminal paper, Brin demonstrates that the outerautomorphism group of Thompson group $T$ is isomorphic to the cyclic group of order two. In this article, building on characterisation of automorphisms of the Higman-Thompson groups…

We adapt a proof of Lascar in order to show the simplicity of the group of automorphisms fixing pointwise all non-generic elements for a class of uncountable models of suitable theories, encompassing both strongly minimal theories as well…

Twisted torus links are given by twisting a subset of strands on a closed braid representative of a torus link. T--links are a natural generalization, given by repeated positive twisting. We establish a one-to-one correspondence between…

We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…

We prove that on B-free subshifts, with B satisfying the Erd\"os condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.

We prove that a group homomorphism $\varphi\colon L\to G$ from a locally compact Hausdorff group $L$ into a discrete group $G$ either is continuous, or there exists a normal open subgroup $N\subseteq L$ such that $\varphi(N)$ is a torsion…

The existence and uniqueness of linking systems associated to saturated fusion systems over discrete $p$-toral groups were proved by Levi and Libman. Their proof make indirectly use of the classification of the finite simple groups. Here we…

We describe the automorphism groups of reductive monoids and of root monoids with active groups of invertible elements.

In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a…

We consider certain groups of tree automorphisms as so-called diffeological groups. The notion of diffeology, due to Souriau, allows to endow non-manifold topological spaces, such as regular trees that we look at, with a kind of a…

We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…

Several distinct Garside monoids having torus knot groups as groups of fractions are known. For $n,m\geq 2$ two coprime integers, we introduce a new Garside monoid $\mathcal{M}(n,m)$ having as Garside group the $(n,m)$-torus knot group,…

We study topological full groups attached to groupoid models for left regular representations of Garside categories. Groups arising in this way include Thompson's group $V$ and many of its variations such as R\"over-Nekrashevych groups. Our…

This paper shows how to construct explicitly an automaton that generates an arbitrary numerical semigroup.

In this paper, we introduce the notion of Autometrized lattice ordered monoids (for short,AL-monoids) as a generalization to DRl-semi groups. We obtain the basic properties of AL-monoids. Also, we prove that Autometrized lattice ordered…

We construct large families of groups admitting free transitive actions on median spaces. In particular, we construct groups which act freely and transitively on the complete universal real tree with continuum valence such that any subgroup…

We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…