Image from Google Jackets

Finite Geometries

By: Contributor(s): Material type: TextTextPublication details: Milton : CRC Press LLC, 2019.Description: 1 online resource (347 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781498721660
  • 1498721664
  • 9781315120072
  • 1315120070
  • 9781351636841
  • 1351636847
  • 9781351646383
  • 1351646389
Subject(s): DDC classification:
  • 516.13 23
LOC classification:
  • QA167.2
Online resources: Summary: Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope. The authors thoroughly explain how the subject of finite geometries is a central part of discrete mathematics. The text is suitable for undergraduate and graduate courses. Additionally, it can be used as reference material on recent works. 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
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Finite Geometries stands out from recent textbooks about the subject of finite geometries by having a broader scope. The authors thoroughly explain how the subject of finite geometries is a central part of discrete mathematics. The text is suitable for undergraduate and graduate courses. Additionally, it can be used as reference material on recent works. 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

OCLC-licensed vendor bibliographic record.

There are no comments on this title.

to post a comment.

To Reach Us

0206993118
amiu.library@amref.ac.ke

Our Location

Lang’ata Road, opposite Wilson Airport
PO Box 27691 – 00506,   Nairobi, Kenya

Social Networks

Powered by Koha