Abstract

The present issue of Designs, Codes and Cryptography is devoted to the theme “Geometric and Algebraic Combinatorics”. A central concept in this research area is the Association Scheme. On one hand it can be a tool for a better understanding of combinatorial objects, such as error correcting codes, block designs, point-line incidence geometries, and permutation groups. On the other hand, many association schemes are interesting objects in themselves. This includes the strongly regular and distance-regular graphs. Algebraic tools like eigenvalues are extremely important for studying association schemes, but are also useful tools in their own right for studying the structure of graphs. Also incidence geometries, especially projective and affine geometries over finite fields are often related to association schemes, but as expected, here geometric methods play a more important role. The issue contains fourteen articles, which we’ll briefly review.

Highlights

  • Algebraic tools like eigenvalues are extremely important for studying association schemes, but are useful tools in their own right for studying the structure of graphs

  • Especially projective and affine geometries over finite fields are often related to association schemes, but as expected, here geometric methods play a more important role

  • Alexander Gavrilyuk and Alexander Makhnev prove the nonexistence of distance-regular graphs with intersection arrays {52, 35, 16; 1, 4, 28} and {69, 48, 24; 1, 4, 46}, by using bounds on the size of certain substructures

Read more

Summary

Introduction

Algebraic tools like eigenvalues are extremely important for studying association schemes, but are useful tools in their own right for studying the structure of graphs. Especially projective and affine geometries over finite fields are often related to association schemes, but as expected, here geometric methods play a more important role. 2. Dieter Jungnickel and Vladimir Tonchev generalize the Hamada type characterization of the classical point-hyperplane designs in terms of associated codes to a characterization of all classical geometric designs.

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call