𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing Double Cosets in Soluble Groups

✍ Scribed by Michael C. Slattery

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
273 KB
Volume
31
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We discuss the use of orbit-stabilizer and orbit reduction techniques for computing representatives of double cosets in finite soluble groups given by a polycyclic presentation.

πŸ“œ SIMILAR VOLUMES

Double Coset Decompositions of Groups
Double Coset Decompositions of Groups
✍ Graham A. Niblo πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 65 KB

We show that residually finite or word hyperbolic groups which can be decomposed as a finite union of double cosets of a cyclic subgroup are necessarily virtually cyclic, and we apply this result to the study of Frobenius permutation groups. We show that in general, finite double coset decomposition

On the Intersection of Double Cosets in
On the Intersection of Double Cosets in Free Groups, with an Application to Amalgamated Products
✍ R.G. Burns; S.-M. Kam πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 244 KB

It is shown that if H, K are any finitely generated subgroups of a free group F and U is any cyclic subgroup of F, then any intersection Hg U l Kg U of double 1 2 Ε½ . cosets contains only a finite number of double cosets H l K gU, and an explicit upper bound for this number is given in terms of the

Computing Projectors, Injectors, Residua
Computing Projectors, Injectors, Residuals and Radicals of Finite Soluble Groups
✍ Burkhard HΓΆfling πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 348 KB

Let G be a finite soluble group, given by a polycyclic generating system, and X a class of groups, represented by an algorithm that decides whether a given finite group belongs to X or not. This paper contains practical algorithms for the computation of X-projectors and X-injectors of G, where X is