Gruppentheoretische Studien

  title={Gruppentheoretische Studien},
  author={Walther von Dyck},
  journal={Mathematische Annalen},
© Andrée C. Ehresmann et les auteurs, 1996, tous droits réservés. L’accès aux archives de la revue « Cahiers de topologie et géométrie différentielle catégoriques » implique l’accord avec lesExpand
On structures of geometrically realizable triangulations on surfaces
Acknowledgments I (the author) would like to thank Professor Atsuhiro Nakamoto for his suggestions, careful reading and so on. Without his help, I cannot complete this thesis. Also, I would like toExpand
Reflect ions on hyperbol ic space
In school, we learn that the interior angles of any triangle sum up to π. However, there exist spaces different from the usual Euclidean space in which this is not true. One of these spaces is theExpand
Remarks and problems about algorithmic descriptions of groups
We make the case that the so called “global decision problems” should not be investigated solely for groups described by finite presentations. We propose to use descriptions that be algorithms thatExpand
The word problem for one-relation monoids: a survey
This survey is intended to provide an overview of one of the oldest and most celebrated open problems in combinatorial algebra: the word problem for one-relation monoids. We provide a history of theExpand
The B B Newman spelling theorem
This article aims to be a self-contained account of the history of the B B Newman Spelling Theorem, including the historical context in which it arose. First, an account of B B Newman and how he cameExpand
“Are the genre and the Geschlecht one and the same number?” An inquiry into Alfred Clebsch's Geschlecht
Abstract This article is aimed at throwing new light on the history of the notion of genus, whose paternity is usually attributed to Bernhard Riemann while its original name Geschlecht is oftenExpand
Semigroup congruences : computational techniques and theoretical applications
Computational semigroup theory is an area of research that is subject to growing interest. The development of semigroup algorithms allows for new theoretical results to be discovered, which in turnExpand
Balanced and almost balanced group presentations from algorithmic viewpoint
In this thesis we study algorithmic aspects of balanced group presentations which are finite presentations with the same number of generators and relations. The main motivation is that theExpand
On the semigroup rank of a group
For an arbitrary group G, it is known that either the semigroup rank $$G{\text {rk}_\text {s}}$$Grks equals the group rank $$G{\text {rk}_\text {g}}$$Grkg, or $$G{\text {rk}_\text {s}}= G{\textExpand