2009

Algorithmic Algebraic Combinatorics and Gröbner Bases

ISBN: 978-3-642-01959-3 (Print) 978-3-642-01960-9 (Online)

Table of contents (12 chapters)

  1. Front Matter

    Pages I-XII

  2. Tutorials

    1. Front Matter

      Pages 1-1

    2. No Access

      Book Chapter

      Pages 3-65

      Loops, Latin Squares and Strongly Regular Graphs: An Algorithmic Approach via Algebraic Combinatorics

    3. No Access

      Book Chapter

      Pages 67-112

      Siamese Combinatorial Objects via Computer Algebra Experimentation

    4. No Access

      Book Chapter

      Pages 113-135

      Using Gröbner Bases to Investigate Flag Algebras and Association Scheme Fusion

    5. No Access

      Book Chapter

      Pages 137-150

      Enumerating Set Orbits

    6. No Access

      Book Chapter

      Pages 151-203

      The 2-dimensional Jacobian Conjecture: A Computational Approach

  3. Research Papers

    1. Front Matter

      Pages 205-205

    2. No Access

      Book Chapter

      Pages 207-227

      Some Meeting Points of Gröbner Bases and Combinatorics

    3. No Access

      Book Chapter

      Pages 229-249

      A Construction of Isomorphism Classes of Oriented Matroids

    4. No Access

      Book Chapter

      Pages 251-268

      Algorithmic Approach to Non-symmetric 3-class Association Schemes

    5. No Access

      Book Chapter

      Pages 269-278

      Sets of Type (d 1,d 2) in Projective Hjelmslev Planes over Galois Rings

    6. No Access

      Book Chapter

      Pages 279-284

      A Construction of Designs from PSL(2,q) and PGL(2,q), q=1 mod 6, on q+2 Points

    7. No Access

      Book Chapter

      Pages 285-296

      Approaching Some Problems in Finite Geometry Through Algebraic Geometry

    8. No Access

      Book Chapter

      Pages 297-311

      Computer Aided Investigation of Total Graph Coherent Configurations for Two Infinite Families of Classical Strongly Regular Graphs