MT4516 Finite Mathematics

Academic year

2025 to 2026 Semester 1

Further information on which modules are specific to your programme.

Key module information

SCOTCAT credits

15

The Scottish Credit Accumulation and Transfer (SCOTCAT) system allows credits gained in Scotland to be transferred between institutions. The number of credits associated with a module gives an indication of the amount of learning effort required by the learner. European Credit Transfer System (ECTS) credits are half the value of SCOTCAT credits.

SCQF level

SCQF level 10

The Scottish Credit and Qualifications Framework (SCQF) provides an indication of the complexity of award qualifications and associated learning and operates on an ascending numeric scale from Levels 1-12 with SCQF Level 10 equating to a Scottish undergraduate Honours degree.

Availability restrictions

Not automatically available to General Degree students

Planned timetable

10.00 am Mon (weeks 2, 4, 7, 9, 11), Tue and Thu

This information is given as indicative. Timetable may change at short notice depending on room availability.

Module coordinator

Dr S Huczynska

Dr S Huczynska
This information is given as indicative. Staff involved in a module may change at short notice depending on availability and circumstances.

Module Staff

Dr Sophie Huczynska

This information is given as indicative. Staff involved in a module may change at short notice depending on availability and circumstances.

Module description

The aim of this module is to introduce students to some topics in the mathematics of combinatorial structures. This theory has wide applications, both in classical mathematics and in theoretical computer science. Topics to be covered may include: coding theory, finite geometries, Latin squares, designs.

Relationship to other modules

Pre-requisites

BEFORE TAKING THIS MODULE YOU MUST PASS MT2504 OR PASS MT2505

Assessment pattern

2-hour Written Examination = 100%

Re-assessment

Oral examination = 100%

Learning and teaching methods and delivery

Weekly contact

2.5 lectures (x 10 weeks) and 1 tutorial (x 10 weeks).

Scheduled learning hours

35

The number of compulsory student:staff contact hours over the period of the module.

Guided independent study hours

115

The number of hours that students are expected to invest in independent study over the period of the module.

Intended learning outcomes

  • Find generator matrices or parity check matrices for binary linear codes, determine the error-correcting capabilities of binary codes, encode and decode messages, and understand bounds (such as the Hamming bound) on the size of binary codes
  • Construct Latin squares from finite fields, construct direct products of Latin squares, and construct Latin squares orthogonal to given ones
  • Construct and analyse finite affine and projective planes, count simple substructures, and prove results about the existence or non-existence of planes of specified orders
  • Determine the parameters of (v, b, r, k, lambda)-designs, appreciate the relationships between these parameters, and be able to find designs with given parameters
  • Understand the relationships between Latin squares, finite affine and projective geometries, and designs