Linear Pro-p-groups of finite Width G. Klaas, C.R. Leedham-Green, W. Plesken. Lecture notes in mathematics 1674.

Klaas, Gundel:

ISBN 10: 3540636439 / ISBN 13: 9783540636434

Editore: Berlin, Springer [1997]., 1997

Riguardo questo articolo

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 20 KLA 9783540636434 Sprache: Englisch Gewicht in Gramm: 550.

Codice articolo 2497823

Dati bibliografici

• Titolo: Linear Pro-p-groups of finite Width G. Klaas, C.R. Leedham-Green, W. Plesken. Lecture notes in mathematics 1674.
• Editore: Berlin, Springer [1997].
• Data di pubblicazione: 1997
• Lingua: Inglese
• ISBN 10: 3540636439
• ISBN 13: 9783540636434
• Rilegatura: Softcover
• Peso: 550 grammi
• Cataloghi dei venditori:
  • SA MATHEMATIK

Descrizione articolo

Riassunto

The normal subgroup structure of maximal pro-p-subgroups of rational points of algebraic groups over the p-adics and their characteristic p analogues are investigated. These groups have finite width, i.e. the indices of the sucessive terms of the lower central series are bounded since they become periodic. The richness of the lattice of normal subgroups is studied by the notion of obliquity. All just infinite maximal groups with Lie algebras up to dimension 14 and most Chevalley groups and classical groups in characteristic 0 and p are covered. The methods use computers in small cases and are purely theoretical for the infinite series using root systems or orders with involutions.

Contenuti

Elementary properties of width.- p-adically simple groups .- Periodicity.- Chevalley groups.- Some classical groups.- Some thin groups.- Algorithms on fields.- Fields of small degree.- Algorithm for finding a filtration and the obliquity.- The theory behind the tables.- Tables.- Uncountably many just infinite pro-p-groups of finite width.- Some open problems.