✦ LIBER ✦

Enumeration of double cosets

✍ Scribed by Robert H. Gilman

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 313 KB
Volume: 26
Category: Article
ISSN: 0022-4049
DOI: 10.1016/0022-4049(82)90023-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Intersections of double cosets in algebr

Intersections of double cosets in algebraic groups

✍ R.W. Richardson 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Computing Double Cosets in Soluble Group

Computing Double Cosets in Soluble Groups

✍ Michael C. Slattery 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 273 KB

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.

Scalable Parallel Coset Enumeration: Bul

Scalable Parallel Coset Enumeration: Bulk Definition and the Memory Wall

✍ Gene Cooperman; Victor Grinberg 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Coset enumeration, like Gröbner bases, is a notoriously difficult algorithm to parallelize. We demonstrate a successful shared memory parallelization achieving a seven times speedup on an Origin 2000 CC-NUMA computer using 16 CPUs. We take as a testbed, an enumeration of Lyons's group (8 835 156 cos

Double Coset Density in Reductive Algebr

Double Coset Density in Reductive Algebraic Groups

✍ J. Brundan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Complete enumerations and double sequenc

Complete enumerations and double sequences

✍ M. Adrian Carpentier 📂 Article 📅 1969 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

## COMPLETE ENUMERATIONS AND DOUBLE SEQUENCES l ) by M. ADRIAN CARPENTIER in Notre Dame, Indiana (U.S.A.) A. E. MALCEV has defined complete enumerations and shown a correspondence between these and universal sequences of sets [3], this latter concept being equivalent to creativity for disjoint re