![]() |
School of Mathematics and StatisticsHome | About the school | Contact | Courses | Research | Personnel list |
Courses in
|
MT4516 FINITE MATHEMATICSAims- To introduce the student to finite mathematical structures such as codes, Latin squares, finite geometries and designs.- To demonstrate relationships between different structures. - To illustrate applications of more classical mathematical disciplines (such as fields and vector spaces) - To investigation of finite structures, as well as the application of finite structures to other branches of mathematics and science. ObjectivesBy the end of the course students are expected to- know the basic definitions and facts about codes, Latin squares, finite geometries and designs. - understand basic existential, constructive and counting proofs, and to be able to reproduce them. - apply the above knowledge to problem solving. Syllabus- Codes: linear codes, decoding with coset leaders and syndromes, perfect codes;- Latin squares: existence, counting, orthogonality; - Finite geometries: affine and projective planes, connections with Latin squares. - Designs: necessary conditions for existence, Steiner triple systems, connections with codes. TextbooksCombinatorics : Topics, Techniques, Algorithms, P J Cameron, Cambridge University Press, 1994;A Course in Combinatorics: J H van Lint and R M Wilson, Cambridge University Press, 1992; Combinatorial Theory, an Introduction: A P Street and W D Wallis, CBRC, Manitoba, 1977. Assessment2 Hour Examination = 100%Co-requisitesone of MT3501, MT3503, MT3504, MT3606AvailabilityAcademic year 2011/12 in semester 1 at 11LecturerDr C Roney-DougalClick here for access to past examination papers for this module. Click here to see the University Course Catalogue entry. Revised: PMH (September 2011)
|