In mathematics, a polycyclic group is a solvable group that satisfies the maximal condition on subgroups (that is, every subgroup is finitely generated). Polycyclic groups are finitely presented, which makes them interesting from a computational point of view.
Equivalently, a group G is polycyclic if and only if it admits a subnormal series with cyclic factors, that is a finite set of subgroups, let's say G0, ..., Gn such that
Gn coincides with G
G0 is the trivial subgroup
Gi is a normal subgroup of Gi+1 (for every i between 0 and n - 1)
and the quotient group Gi+1 / Gi is a cyclic group (for every i between 0 and n - 1)
A metacyclic group is a polycyclic group with n ≤ 2, or in other words an extension of a cyclic group by a cyclic group.
Examples of polycyclic groups include finitely generated abelian groups, finitely generated nilpotent groups, and finite solvable groups. Anatoly Maltsev proved that solvable subgroups of the integer general linear group are polycyclic; and later Louis Auslander (1967) and Swan proved the converse, that any polycyclic group is up to isomorphism a group of integer matrices. The holomorph of a polycyclic group is also such a group of integer matrices.
A polycyclic group G is said to be strongly polycyclic if each quotient Gi+1 / Gi is infinite. Any subgroup of a strongly polycyclic group is strongly polycyclic.
A virtually polycyclic group is a group that has a polycyclic subgroup of finite index, an example of a virtual property. Such a group necessarily has a normal polycyclic subgroup of finite index, and therefore such groups are also called polycyclic-by-finite groups. Although polycyclic-by-finite groups need not be solvable, they still have many of the finiteness properties of polycyclic groups; for example, they satisfy the maximal condition, and they are finitely presented and residually finite.
In the textbook and some papers, an M-group refers to what is now called a polycyclic-by-finite group, which by Hirsch's theorem can also be expressed as a group which has a finite length subnormal series with each factor a finite group or an infinite cyclic group.
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.
This course gives a comprehensive view of the main research topics being explored in the different sections of Physics, and the highlights from EPFL beyond the specific topic of each PhD. The students
This is a course about group schemes, with an emphasis on structural theorems for algebraic groups (e.g. Barsotti--Chevalley's theorem). All the basics will be covered towards the proof of such theore
The goal of this course/seminar is to introduce the students to some contemporary aspects of geometric group theory. Emphasis will be put on Artin's Braid groups and Thompson's groups.
Explore des groupes plats d'automorphismes et leurs propriétés, y compris des fonctions de minimisation et d'invariance dans des conditions spécifiques.
Explore les groupes solvables, les actions de groupe, les normalisateurs et les stabilisateurs en théorie de groupe.
Explore la création de tableaux de bord dans ServiceNow, en mettant l'accent sur les avantages, la transition des pages d'accueil et des concepts importants comme les tâches et les incidents.
En algèbre, un groupe est dit super-résoluble s'il possède une suite normale (avec G normal dans G) dont tous les quotients G/G sont monogènes. Détaillons les implications strictes : super-résoluble ⇒ polycyclique ⇒ résoluble. Tout groupe super-résoluble est (notion plus faible où l'on demande seulement que chaque G soit normal dans G). Tout groupe polycyclique est résoluble (notion encore plus faible où de plus, on demande seulement que les quotients G/G soient abéliens).
In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combination (under the group operation) of finitely many elements of S and of inverses of such elements. By definition, every finite group is finitely generated, since S can be taken to be G itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated.
En théorie des groupes, un groupe peut se définir par une présentation, autrement dit, la donnée d'un ensemble de générateurs et d'un ensemble de relations que ceux-ci vérifient. La possibilité d'une telle définition découle de ce que tout groupe est quotient d'un groupe libre. En général, une présentation d'un groupe G se note en écrivant entre crochets une liste de lettres et une liste minimale de mots sur cet alphabet, chaque mot étant censé valoir 1 dans le groupe et aucune relation n'existant entre les lettres, hormis celles-là et leurs conséquences.
The notion of active sum provides an analogue for groups of what the direct sum is for abelian groups. One natural question then is which groups are the active sum of a family of cyclic subgroups. Many groups have been found to give a positive answer to th ...
Elsevier2014
This dissertation investigates the amenability of topological full groups using a property of group actions called extensive amenability. Extensive amenability is a core concept of several amenability results for groups of dynamical origin. We study its pr ...
We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We introduce here a l ...