Algorithmic Algebraic Combinatorics and Gröbner Bases

  • Mikhail Klin
  • Gareth A. Jones
  • Aleksandar Jurišić
  • Mikhail Muzychuk
  • Ilia Ponomarenko

About this book

Introduction

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.

Keywords

Algebra Area Computer Graph Gröbner bases Permutation algorithms association scheme coding theory computer algebra construction finite geometry

Editors and affiliations

  • Mikhail Klin
    • 1
  • Gareth A. Jones
    • 2
  • Aleksandar Jurišić
    • 3
  • Mikhail Muzychuk
    • 4
  • Ilia Ponomarenko
    • 5
  1. 1.Department of MathematicsBen-Gurion University of the NegevBeer ShevaIsrael
  2. 2.School of MathematicsUniversity of SouthamptonSouthamptonUK
  3. 3.Faculty of Computer ScienceLaboratory for Cryptography and Computer SecurityLjubljanaSlovenia
  4. 4.Department of Mathematics and Computer ScienceNetanya Academic CollegeNetanyaIsrael
  5. 5.V.A. Steklov Mathematical InstituteLaboratory of Representation Theory and Computational MathematicsSt. PetersburgRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-01960-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-3-642-01959-3
  • Online ISBN 978-3-642-01960-9
  • About this book