Methods for Investigating Finitely-presented Groups PDF Download
Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Methods for Investigating Finitely-presented Groups PDF full book. Access full book title Methods for Investigating Finitely-presented Groups by Matthew Auger. Download full books in PDF and EPUB format.
Author: Matthew Auger Publisher: ISBN: Category : Computer algorithms Languages : en Pages : 88
Book Description
This thesis concerns computation with finite group presentations and its application to resolve certain open problems of Kim and Kostrikin. We use the low-index subgroups and abelian quotient invariants algorithms to show that each member of a certain family of finitely-pesented groups is infinite. We present a new algorithm for determining which generalised dihedral groups are quotients of a given finitely-presented group, and use this to show that the groups in another family are pairwise non-isomorphic. Also we describe the method of 'pictures' over group presentations, discussing what they represent and how they can be used to obtain information about the group.
Author: Matthew Auger Publisher: ISBN: Category : Computer algorithms Languages : en Pages : 88
Book Description
This thesis concerns computation with finite group presentations and its application to resolve certain open problems of Kim and Kostrikin. We use the low-index subgroups and abelian quotient invariants algorithms to show that each member of a certain family of finitely-pesented groups is infinite. We present a new algorithm for determining which generalised dihedral groups are quotients of a given finitely-presented group, and use this to show that the groups in another family are pairwise non-isomorphic. Also we describe the method of 'pictures' over group presentations, discussing what they represent and how they can be used to obtain information about the group.
Author: Charles C. Sims Publisher: Cambridge University Press ISBN: 0521432138 Category : Mathematics Languages : en Pages : 624
Book Description
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.
Author: Volker Diekert Publisher: Walter de Gruyter GmbH & Co KG ISBN: 3111474275 Category : Mathematics Languages : en Pages : 322
Book Description
This book contains surveys and research articles on the state-of-the-art in finitely presented groups for researchers and graduate students. Overviews of current trends in exponential groups and of the classification of finite triangle groups and finite generalized tetrahedron groups are complemented by new results on a conjecture of Rosenberger and an approximation theorem. A special emphasis is on algorithmic techniques and their complexity, both for finitely generated groups and for finite Z-algebras, including explicit computer calculations highlighting important classical methods. A further chapter surveys connections to mathematical logic, in particular to universal theories of various classes of groups, and contains new results on countable elementary free groups. Applications to cryptography include overviews of techniques based on representations of p-groups and of non-commutative group actions. Further applications of finitely generated groups to topology and artificial intelligence complete the volume. All in all, leading experts provide up-to-date overviews and current trends in combinatorial group theory and its connections to cryptography and other areas.
Author: P. Dräxler Publisher: Springer Science & Business Media ISBN: 9783764360634 Category : Mathematics Languages : en Pages : 378
Book Description
I Introductory Articles.- 1 Classification Problems in the Representation Theory of Finite-Dimensional Algebras.- 2 Noncommutative Gröbner Bases, and Projective Resolutions.- 3 Construction of Finite Matrix Groups.- II Keynote Articles.- 4 Derived Tubularity: a Computational Approach.- 5 Problems in the Calculation of Group Cohomology.- 6 On a Tensor Category for the Exceptional Lie Groups.- 7 Non-Commutative Gröbner Bases and Anick's Resolution.- 8 A new Existence Proof of Janko's Simple Group J4.- 9 The Normalization: a new Algorithm, Implementation and Comparisons.- 10 A Computer Algebra Approach to sheaves over Weighted Projective Lines.- 11 Open Problems in the Theory of Kazhdan-Lusztig polynomials.- 12 Relative Trace Ideals and Cohen Macaulay Quotients.- 13 On Sims' Presentation for Lyons' Simple Group.- 14 A Presentation for the Lyons Simple Group.- 15 Reduction of Weakly Definite Unit Forms.- 16 Decision Problems in Finitely Presented Groups.- 17 Some Algorithms in Invariant Theory of Finite Groups.- 18 Coxeter Transformations associated with Finite Dimensional Algebras.- 19 The 2-Modular Decomposition Numbers of Co2.- 20 Bimodule and Matrix Problems.
Author: William M. Kantor Publisher: Walter de Gruyter ISBN: 3110872749 Category : Mathematics Languages : en Pages : 376
Book Description
This volume contains contributions by the participants of the conference "Groups and Computation", which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "Groups and Computation" held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
Author: Manuel Bronstein Publisher: Birkhäuser ISBN: 3034888007 Category : Computers Languages : en Pages : 291
Book Description
Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: • the Knuth-Bendix completion for groups, monoids and general term-rewriting systems, • the Buchberger algorithm for Gröbner bases, • the Ritt-Wu characteristic set method for ordinary differential equations, and • the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication.
Author: Johannes Grabmeier Publisher: Springer Science & Business Media ISBN: 3642558267 Category : Computers Languages : en Pages : 656
Book Description
This Handbook gives a comprehensive snapshot of a field at the intersection of mathematics and computer science with applications in physics, engineering and education. Reviews 67 software systems and offers 100 pages on applications in physics, mathematics, computer science, engineering chemistry and education.
Author: Matthew Auger
Author: Matthew Auger
Author: Charles C. Sims
Author: E. A. O'Brien
Author: Volker Diekert
Author: P. Dräxler
Author: William M. Kantor
Author: C. M. Campbell
Author: Manuel Bronstein
Author: Johannes Grabmeier
Author: Michael D. Atkinson