✦ LIBER ✦

Computing Subgroups Invariant Under a Set of Automorphisms

✍ Scribed by A. Hulpke

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 442 KB
Volume: 27
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1998.0260

No coin nor oath required. For personal study only.

✦ Synopsis

This article describes an algorithm for computing up to conjugacy all subgroups of a finite solvable group that are invariant under a set of automorphisms. It constructs the subgroups stepping down along a normal chain with elementary abelian factors.

📜 SIMILAR VOLUMES

Automorphisms of Countable Recursively S

Automorphisms of Countable Recursively Saturated Models of PA: Open Subgroups and Invariant Cuts

✍ Henryk Kotlarski; Bozena Piekart 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB

Let M be a countable recursively saturated model of PA and H an open subgroup of G = Aut(M). We prove that I ( H ) = sup{b E M : (3f E G \ H )

On Automorphism-Fixed Subgroups of a Fre

On Automorphism-Fixed Subgroups of a Free Group

✍ A. Martino; E. Ventura 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 101 KB

Let F be a finitely generated free group, and let n denote its rank. A subgroup H of F is said to be automorphism-fixed, or auto-fixed for short, if there exists a set S of automorphisms of F such that H is precisely the set of elements fixed by every element of S; similarly, H is 1-auto-fixed if th

Computing the Subgroups of a Permutation

Computing the Subgroups of a Permutation Group

✍ John J. Cannon; Bruce C. Cox; Derek F. Holt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 279 KB

A new method for computing the conjugacy classes of subgroups of a finite group is described.

Automorphisms of Models of True Arithmet

Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely

✍ Henryk Kotlarski; Bożena Piekart 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 420 KB

## Abstract We show that if __M__ is a countable recursively saturated model of True Arithmetic, then __G__ = Aut(__M__) has nonmaximal open subgroups with unique extension to a maximal subgroup of Aut(__M__). Mathematics Subject Classification: 03C62, 03C50.

On a characterization of flow-invariant

On a characterization of flow-invariant sets

✍ Haim Brezis 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

Automorphisms of Models of True Arithmet

Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely

✍ Henryk Kotlarski; Bożena Piekart 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 239 KB

Continuing the earlier research in [14] we give some more information about nonmaximal open subgroups of G = Aut(M) with unique maximal extension, where M is a countable recursively saturated model of True Arithmetic.