Related papers: The infinite dihedral group

We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Dixon's famous theorem states that the group generated by two random permutations of a finite set is generically either the whole symmetric group or the alternating group. In the context of random generation of finite groups this means that…

We investigate the indicators for certain groups of the form $\BZ_k\rtimes D_l$ and their doubles, where $D_l$ is the dihedral group of order $2l$. We subsequently obtain an infinite family of totally orthogonal, completely real groups…

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

We make an exposition of the proof of the Baum-Connes conjecture for the infinite dihedral group following the ideas of Higson and Kasparov.

We construct a well-behaved stable category of modules for a large class of infinite groups. We then consider its Picard group, which is the group of invertible (or endotrivial) modules. We show how this group can be calculated when the…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…

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

The aim of this paper is to explain, mostly through examples, what groupoids are and how they describe symmetry. We will begin with elementary examples, with discrete symmetry, and end with examples in the differentiable setting which…

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

All possible products of all elements of an odd order finite group are considered. A set of all such products is called as a K-set. A hypothesis of K-set coincidence of any group of an odd order with its commutant is proposed and the…

In this paper we give a complete algebraic description of groups elementarily equivalent to a given free nilpotent group of finite rank.

We define and study the class of inner ultrahomogeneous groups, which includes Hall's universal group and the universal locally recursively presentable group. We provide simple criteria for ample generic automorphisms, straight maximality,…

Let $A$ be an infinitely generated free abelian group. We prove that the automorphism group $\aut A$ first-order interprets the full second-order theory of the set $|A|$ with no structure. In particular, this implies that the automorphism…

A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…

We exhibit the construction of a deterministic automaton that, given k > 0, recognizes the (regular) language of k-differentiable words. Our approach follows a scheme of Crochemore et al. based on minimal forbidden words. We extend this…