Page 1

Displaying 1 – 20 of 20

Showing per page

Malnormal subgroups and Frobenius groups: basics and examples

Pierre de la Harpe, Claude Weber (2014)

Confluentes Mathematici

Malnormal subgroups occur in various contexts. We review a large number of examples, and compare the general situation to that of finite Frobenius groups of permutations.In a companion paper [18], we analyse when peripheral subgroups of knot groups and 3 -manifold groups are malnormal.

Mapping class group of a handlebody

Bronisław Wajnryb (1998)

Fundamenta Mathematicae

Let B be a 3-dimensional handlebody of genus g. Let ℳ be the group of the isotopy classes of orientation preserving homeomorphisms of B. We construct a 2-dimensional simplicial complex X, connected and simply-connected, on which ℳ acts by simplicial transformations and has only a finite number of orbits. From this action we derive an explicit finite presentation of ℳ.

Minimal length coset representatives for quotients of parabolic subgroups in Coxeter groups

Fabio Stumbo (2000)

Bollettino dell'Unione Matematica Italiana

In questo lavoro viene trovata un'espressione esplicita per i rappresentanti dei laterali di sottogrupi parabolici di gruppi di Coxeter aventi lunghezza minima: dato un sistema di Coxeter W , S ed un suo sottogruppo parabolico W I , I , con I S , si determina esplicitamente in ogni laterale W I w di W I un elemento avente lunghezza minima. Nella sezione 2 trattiamo i casi classici, i.e. W = A n , B n e D n . Dopo ciò, nella sezione 3, diamo una procedura per risolvere il problema nei restanti casi eccezionali, insieme a qualche...

Monoid presentations of groups by finite special string-rewriting systems

Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas (2004)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We show that the class of groups which have monoid presentations by means of finite special [ λ ] -confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group.

Monoid presentations of groups by finite special string-rewriting systems

Duncan W. Parkes, V. Yu. Shavrukov, Richard M. Thomas (2010)

RAIRO - Theoretical Informatics and Applications

We show that the class of groups which have monoid presentations by means of finite special [λ]-confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group.

Currently displaying 1 – 20 of 20

Page 1