Algorithmic Algebraic Combinatorics and Gröbner Bases

This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Gröbner bases. Topics covered include coherent configurations, asso...

Full description

Bibliographic Details
Other Authors: Klin, Mikhail (Editor), Jones, Gareth A. (Editor), Jurisic, Aleksandar (Editor), Muzychuk, Mikhail (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2009, 2009
Edition:1st ed. 2009
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03041nmm a2200373 u 4500
001 EB000382371
003 EBX01000000000000000235423
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783642019609 
100 1 |a Klin, Mikhail  |e [editor] 
245 0 0 |a Algorithmic Algebraic Combinatorics and Gröbner Bases  |h Elektronische Ressource  |c edited by Mikhail Klin, Gareth A. Jones, Aleksandar Jurisic, Mikhail Muzychuk, Ilia Ponomarenko 
250 |a 1st ed. 2009 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2009, 2009 
300 |a XII, 311 p  |b online resource 
505 0 |a Tutorials -- Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics -- Siamese Combinatorial Objects via Computer Algebra Experimentation -- Using Gröbner Bases to Investigate Flag Algebras and Association Scheme Fusion -- Enumerating Set Orbits -- The 2-dimensional Jacobian Conjecture: A Computational Approach -- Research Papers -- Some Meeting Points of Gröbner Bases and Combinatorics -- A Construction of Isomorphism Classes of Oriented Matroids -- Algorithmic Approach to Non-symmetric 3-class Association Schemes -- Sets of Type (d 1,d 2) in Projective Hjelmslev Planes over Galois Rings -- A Construction of Designs from PSL(2,q) and PGL(2,q), q=1 mod 6, on q+2 Points -- Approaching Some Problems in Finite Geometry Through Algebraic Geometry -- Computer Aided Investigation of Total Graph Coherent Configurations for Two Infinite Families of Classical Strongly Regular Graphs 
653 |a Mathematics of Computing 
653 |a Computer science / Mathematics 
653 |a Mathematics / Data processing 
653 |a Computational Science and Engineering 
653 |a Algebra 
653 |a Geometry 
653 |a Discrete Mathematics 
653 |a Discrete mathematics 
700 1 |a Jones, Gareth A.  |e [editor] 
700 1 |a Jurisic, Aleksandar  |e [editor] 
700 1 |a Muzychuk, Mikhail  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
028 5 0 |a 10.1007/978-3-642-01960-9 
856 4 0 |u https://doi.org/10.1007/978-3-642-01960-9?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 511.1 
520 |a This collection of tutorial and research papers introduces readers to diverse areas of modern pure and applied algebraic combinatorics and finite geometries with a special emphasis on algorithmic aspects and the use of the theory of Gröbner bases. Topics covered include coherent configurations, association schemes, permutation groups, Latin squares, the Jacobian conjecture, mathematical chemistry, extremal combinatorics, coding theory, designs, etc. Special attention is paid to the description of innovative practical algorithms and their implementation in software packages such as GAP and MAGMA. Readers will benefit from the exceptional combination of instructive training goals with the presentation of significant new scientific results of an interdisciplinary nature