Algorithmic Algebraic Combinatorics and Gröbner Bases

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Klin, Mikhail (Επιμελητής έκδοσης), Jones, Gareth A. (Επιμελητής έκδοσης), Jurišić, Aleksandar (Επιμελητής έκδοσης), Muzychuk, Mikhail (Επιμελητής έκδοσης), Ponomarenko, Ilia (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Θέματα: Mathematics.; Computer science > Mathematics.; Algebra.; Computer mathematics.; Geometry.; Discrete mathematics.; Combinatorics.; Discrete Mathematics.; Computational Science and Engineering.; Mathematics of Computing.

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...

Πίνακας περιεχομένων:

• 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.