Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries, transitive permutation sets, flat-transitive geometries, design theory, finite groups, near-rings and semifields, MV-algebras, coding theory, cryptography and graph theory in its geometric and design aspects.

Combinatorial analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries, transitive permutation sets, flat-transitive geometries, design theory, finite groups, near-rings and semifields, MV-algebras, coding theory, cryptography and graph theory in its geometric and design aspects.

Combinatorial analysis --- Analyse combinatoire --- Congresses. --- Congrès --- Congresses --- Combinatorial analysis - Congresses

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial analysis --- Complexes --- Convex polytopes

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity. The conference on which this book is based was the fourth in a series which began in 1963, which was the first time specialists from East and West were able to come together. The 1990 meeting attracted 170 mathematicians and computer scientists from around the world, so this book represents an international, detailed view of recent research.

Combinatorial analysis --- Computational complexity --- Graph theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Algebraic coding theory has in recent years been increasingly applied to the study of combinatorial designs. This book gives an account of many of those applications together with a thorough general introduction to both design theory and coding theory - developing the relationship between the two areas. The first half of the book contains background material in design theory, including symmetric designs and designs from affine and projective geometry, and in coding theory, coverage of most of the important classes of linear codes. In particular, the authors provide a new treatment of the Reed-Muller and generalized Reed-Muller codes. The last three chapters treat the applications of coding theory to some important classes of designs, namely finite planes, Hadamard designs and Steiner systems, in particular the Witt systems. The book is aimed at mathematicians working in either coding theory or combinatorics - or related areas of algebra. The book is, however, designed to be used by non-specialists and can be used by those graduate students or computer scientists who may be working in these areas.

Combinatorial designs and configurations. --- Coding theory.