English
Related papers

Related papers: The infinite dihedral group

200 papers

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.

Group Theory · Mathematics 2017-11-28 Laurent Bartholdi , Ivan Mitrofanov

We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.

Group Theory · Mathematics 2007-05-23 Diego Rattaggi

In the paper, a method of describing the outer derivations of the group algebra of a finitely presentable group is given. The description of derivations is given in terms of characters of the groupoid of the adjoint action of the group.

Rings and Algebras · Mathematics 2017-08-18 A. A. Arutyunov , A. S. Mishchenko , A. I. Shtern

In this paper we construct a cellular complex which is an infinite analogue to Stasheff's associahedra. We prove that it is contractible and state that its (combinatorial) automorphism group is isomorphic to a semi-direct product of R.J.…

Group Theory · Mathematics 2013-03-21 Ariadna Fossas

In this article, we study the outer automorphism group of a group G decomposed as a finite graph of group with finite edge groups and finitely generated vertex groups with at most one end. We show that Out(G) is essentially obtained by…

Group Theory · Mathematics 2013-01-21 Mathieu Carette

We explicitly determine the automorphism groups of all self-similar trees (a.k.a. trees with finitely many cone types). We show that any such automorphism group is a direct limit of certain finite products of finite symmetric groups, which…

Group Theory · Mathematics 2023-12-07 Tobias Hartnick , Merlin Incerti-Medici

In the following pages we discuss infinite sequences defined on a finite alphabet, and more specially those which are generated by finite automata. We have divided our paper into seven parts which are more or less self-contained. Needless…

Formal Languages and Automata Theory · Computer Science 2022-12-20 Jean-Paul Allouche , Michel Mendès France

We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.

Group Theory · Mathematics 2025-04-30 Olga Kharlampovich , Alexei Miasnikov

We determine the quantum automorphism groups of finite graphs. These are quantum subgroups of the quantum permutation groups defined by Wang. The quantum automorphism group is a stronger invariant for finite graphs than the usual one. We…

Quantum Algebra · Mathematics 2007-05-23 Julien Bichon

We study group extensions of Finite Abelian Groups using matrices. We also prove a Theorem for equivalence of extensions using matrices.

Group Theory · Mathematics 2018-02-16 Guhan Venkat

We describe the two-generated limits of abelian-by-(infinite cyclic) groups in the space of marked groups using number theoretic methods. We also discuss universal equivalence of these limits.

Group Theory · Mathematics 2010-07-09 Luc Guyot

In this article, we classify disconnected reductive groups over an algebraically closed field with a few caveats. Internal parts of our result are both a classification of finite groups and a classification of integral representations of a…

Representation Theory · Mathematics 2024-09-20 Dylan Johnston , Diego Martín Duro , Dmitriy Rumynin

A simple observation, showing that every groupoid becomes an inverse semigroup after adding one element. In such inverse semigroups all idempotents are mutually orthogonal. This fact implies that every C*-algebra of a discrete groupoid is a…

Operator Algebras · Mathematics 2016-05-02 Marat Aukhadiev

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Group Theory · Mathematics 2011-08-12 Olga Kharlampovich , Bakhadyr Khoussainov , Alexei Miasnikov

We give an explicit formula for Whitehead group of a three-dimensional crystallographic group in terms of the Whitehead groups of its virtually infinite cyclic subgroups.

K-Theory and Homology · Mathematics 2007-05-23 A. Alves , P. Ontaneda

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…

Formal Languages and Automata Theory · Computer Science 2011-07-28 Jeffrey Shallit

Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…

Number Theory · Mathematics 2020-11-17 Alfred Geroldinger , David J. Grynkiewicz , Jun Seok Oh , Qinghai Zhong

For each countable group $Q$ we produce a short exact sequence $1\to N \to G \to Q\to 1$ where $G$ is f.g. and has a graphical $\frac16$ presentation and $N$ is f.g. and satisfies property $T$. As a consequence we produce a group $N$ with…

Group Theory · Mathematics 2007-05-23 Yann Ollivier , Daniel T. Wise

Let $G$ be a group and let $A\subseteq G$ be non-empty. We call $A$ an asymptotic $(r,l)$-approximate group if, for a fixed dilation factor $r$, the larger product sets $A^{hr}$ can, for all sufficiently large $h$, be covered by a bounded…

Group Theory · Mathematics 2026-05-12 Arindam Biswas

We give an infinite presentation for the mapping class group of a non-orientable surface with boundary components. The presentation is a generalization of the presentation given by the second author [15].

Geometric Topology · Mathematics 2016-10-18 Ryoma Kobayashi , Genki Omori