Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.

Topics covered include Galois geometries, blocking sets, affine and projective planes, incidence structures and their automorphism groups. Matroids, graph theory and designs are also treated, along with weak algebraic structures such as near-rings, near-fields, quasi-groups, loops, hypergroups etc., and permutation sets and groups.

The vitality of combinatorics today lies in its important interactions with computer science. The problems which arise are of a varied nature and suitable techniques to deal with them have to be devised for each situation; one of the special features of combinatorics is the often sporadic nature of solutions, stemming from its links with number theory. The branches of combinatorics are many and various, and all of them are represented in the 56 papers in this volume.

Скачать книгу бесплатно (djvu, 2.50 Mb)

---

Читать «Combinatorics ′86»