The authors examine how finite geometries' applicable nature led to solutions of open problems in different fields, such as design theory, cryptography and extremal combinatorics. Other areas covered include proof techniques using polynomials in case of Desarguesian planes, and applications in extremal combinatorics, plus, recent material and developments.
Features:
- Includes exercise sets for possible use in a graduate course
- Discusses applications to graph theory and extremal combinatorics
- Covers coding theory and cryptography
- Translated and revised text from the Hungarian published version
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.








