✦ LIBER ✦

Generating coset representatives for permutation groups

✍ Scribed by Lloyd Allison

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 840 KB
Volume: 2
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(81)90024-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inversion tables and minimal left coset

Inversion tables and minimal left coset representatives for Weyl groups of classical type

✍ Paolo Papi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 152 KB

Using the interplay between the geometric and the permutation representation, we obtain explicit descriptions of the inversions, inversion tables and minimal left coset representatives for elements of ÿnite and a ne Weyl groups of classical type.

Designing cellular permutation networks

Designing cellular permutation networks through coset decompositions of symmetric groups

✍ A. Yavuz Oruc 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

Representing the Quotient Groups of a Fi

Representing the Quotient Groups of a Finite Permutation Group

✍ Derek F. Holt; Jacqueline Walton 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 207 KB

Let G be a permutation group of finite degree d. We prove that the product of the orders of the composition factors of G that are not alternating groups acting naturally, in a sense that will be made precise, is bounded by c d-1 /d, where c = 4 5. We use this to prove that any quotient G/N of G has

Rationally represented characters and pe

Rationally represented characters and permutation characters of nilpotent groups

✍ John R Rasmussen 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 281 KB

Constructing Permutation Representations

Constructing Permutation Representations for Matrix Groups

✍ GENE COOPERMAN; LARRY FINKELSTEIN; MICHAEL TSELMAN; BRYANT YORK 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 465 KB

New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutat

Asymptotic Results for Primitive Permuta

Asymptotic Results for Primitive Permutation Groups

✍ L Pyber; A Shalev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 216 KB

We prove that the number of conjugacy classes of primitive permutation groups cŽ n. ## Ž . of degree n is at most n , where n denotes the maximal exponent occurring in the prime factorization of n. This result is applied to investigating maximal subgroup growth of infinite groups. We then proceed