Flag-transitive Steiner Designs (Frontiers in Mathematics)

Flag-transitive Steiner Designs (Frontiers in Mathematics)

Michael Huber
როგორ მოგეწონათ ეს წიგნი?
როგორი ხარისხისაა ეს ფაილი?
ჩატვირთეთ, ხარისხის შესაფასებლად
როგორი ხარისხისაა ჩატვირთული ფაილი?
The monograph provides the first full discussion of flag-transitive Steiner designs. This is a central part of the study of highly symmetric combinatorial configurations at the interface of several mathematical disciplines, like finite or incidence geometry, group theory, combinatorics, coding theory, and cryptography. In a sufficiently self-contained and unified manner the classification of all flag-transitive Steiner designs is presented. This recent result settles interesting and challenging questions that have been object of research for more than 40 years. Its proof combines methods from finite group theory, incidence geometry, combinatorics, and number theory. The book contains a broad introduction to the topic, along with many illustrative examples. Moreover, a census of some of the most general results on highly symmetric Steiner designs is given in a survey chapter. The monograph is addressed to graduate students in mathematics and computer science as well as established researchers in design theory, finite or incidence geometry, coding theory, cryptography, algebraic combinatorics, and more generally, discrete mathematics.
კატეგორია:
წელი:
2009
გამოცემა:
1
გამომცემლობა:
Birkhäuser Basel
ენა:
english
გვერდები:
136
ISBN 10:
3034600011
სერია:
Frontiers in Mathematics
ფაილი:
PDF, 973 KB
IPFS:
CID , CID Blake2b
english, 2009
ონლაინ წაკითხვა
ხორციელდება კონვერტაციის -ში
კონვერტაციის -ში ვერ მოხერხდა

საკვანძო ფრაზები