Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden

@article{NielsenDieID,
  title={Die Isomorphismen der allgemeinen, unendlichen Gruppe mit zwei Erzeugenden},
  author={Jakob Nielsen},
  journal={Mathematische Annalen},
  volume={78},
  pages={385-397}
}
  • J. Nielsen
  • Published 1 December 1917
  • Mathematics
  • Mathematische Annalen
Randomizing and Describing Groups
In this work we study some topics in logic and group theory, and naturally, their intersection. One important theme in this work is the notion of random groups, which is informally the study of “what
Combinatorial categories and permutation groups
  • G. Jones
  • Mathematics, Computer Science
    Ars Math. Contemp.
  • 2016
TLDR
It is shown how to enumerate regular objects in various categories with a given finite automorphism group G, how to represent them all as quotients of a single regular object  U ( G ) , and how the outer automorphist group of  Γ   acts on them.
A survey of the Johnson homomorphisms of the automorphism groups of free groups and related topics
This is a biased survey for the Johnson homomorphisms of the automorphism groups of free groups. We just exposit some well known facts and recent developments for the Johnson homomorphisms and its
CARRIER GRAPHS FOR REPRESENTATIONS OF THE RANK TWO FREE GROUP INTO ISOMETRIES OF HYPERBOLIC THREE SPACE
Carrier graphs were first introduced for closed hyperbolic 3-manifolds by White. In this paper, we first generalize this definition to carrier graphs for representations of a rank two free group into
Regular dessins with a given automorphism group
Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are
STACS 99
TLDR
This exposition presents a model to formally study algorithms in a distributed setting where the participants cannot be assumed to follow the algorithm but rather their own self-interest, and demonstrates how some of the techniques of mechanism design can be applied towards distributed computation problems.
Kleinian groups with singly cusped parabolic fixed points
We consider geometrically innnite Kleinian groups and, in particular, groups with singly cusped parabolic xed points. In order to distinguish between diierent geometric characteristics of such
Test words, generic elements and almost primitivity
A test element in a group G is an element g with the property that if f(g) = g for an endomorphism f of G to G then f must be an automorphism. A test element in a free group is called a test word.
Commutators in Free Groups
We study the representations of an element of a free group as a commutator. For a given element g of a free group F, we are interested in the set of all pairs (x, y) of elements of F such that (1)
...
1
2
3
4
5
...