Symbolic Computation With Infinite Sequences Of P Groups With Fixed Coclass

Download Symbolic Computation With Infinite Sequences Of P Groups With Fixed Coclass PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Symbolic Computation With Infinite Sequences Of P Groups With Fixed Coclass book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Symbolic Computation with Infinite Sequences of P-groups with Fixed Coclass

Author: Dörte Feichtenschlager
language: en
Publisher: Logos Verlag Berlin GmbH
Release Date: 2010
The classification of finite emph {p-groups is a much investigated problem, though in general it seems impossible. Leedham-Green & Newman defined a new invariant for finite emph {p-groups, the coclass. They suggested to try to classify finite emph {p-groups by coclass. One step towards such a classification was the introduction of so-called infinite coclass sequences by du Sautoy and Eick & Leedham-Green. The groups in such a sequence can be described by a parametrised presentation. For prime 2 and a fixed coclass r it holds that almost all 2-groups of coclass r fall into finitely many infinite coclass sequences. So describing the infinite sequences yields an almost classification in these cases. In this work it is shown that using the parametrised presentations one can compute certain invariants for almost all groups in an infinite coclass sequence, especially the Schur multiplicator. This is done by introducing a way to work with almost all groups at a time by a symbolic computation.
Function Algebras on Finite Sets

Author: Dietlinde Lau
language: en
Publisher: Springer Science & Business Media
Release Date: 2006-11-23
Functions which are defined on finite sets occur in almost all fields of mathematics. For more than 80 years algebras whose universes are such functions (so-called function algebras), have been intensively studied. This book gives a broad introduction to the theory of function algebras and leads to the cutting edge of research. To familiarize the reader from the very beginning on with the algebraic side of function algebras the more general concepts of the Universal Algebra is given in the first part of the book. The second part on fuction algebras covers the following topics: Galois-connection between function algebras and relation algebras, completeness criterions, clone theory. This book is an insdispensible source on function algebras for graduate students and researchers in mathematical logic and theoretical computer science.