Module Handbook

  • Dynamischer Default-Fachbereich geändert auf INF

Module INF-58-52-M-6

Algorithmic Group Theory (M, 8.0 LP, AUSL)

Module Identification

Module Number Module Name CP (Effort)
INF-58-52-M-6 Algorithmic Group Theory 8.0 CP (240 h)

Basedata

CP, Effort 8.0 CP = 240 h
Position of the semester 1 Sem. in SuSe
Level [6] Master (General)
Language [EN] English
Module Manager
Lecturers
Area of study [INF-ALG] Algorithmics and Deduction
Reference course of study [INF-88.79-SG] M.Sc. Computer Science
Livecycle-State [AUSL] Phase-out period

Courses

Type/SWS Course Number Title Choice in
Module-Part
Presence-Time /
Self-Study
SL SL is
required for exa.
PL CP Sem.
4V+2U INF-58-52-K-6
Algorithmic Group Theory
P 84 h 156 h
U-Schein
ja PL1 8.0 SuSe
  • About [INF-58-52-K-6]: Title: "Algorithmic Group Theory"; Presence-Time: 84 h; Self-Study: 156 h
  • About [INF-58-52-K-6]: The study achievement "[U-Schein] proof of successful participation in the exercise classes (ungraded)" must be obtained.
    • It is a prerequisite for the examination for PL1.

Examination achievement PL1

  • Form of examination: oral examination (20-60 Min.)
  • Examination Frequency: Examination only within the course
  • Examination number: 65852 ("Algorithmic Group Theory")

Contents

  • Different ways of encoding groups in the computer.
  • Algorithms for calculating elementary properties and objects in groups such as order of elements, order of group and favorable generating systems. The focus is on algorithms for permutation groups.

Competencies / intended learning achievements

Upon successful completion of the module, students will be able to
  • explain the theoretical basics of handling of groups,
  • explain the operation of efficient algorithms which are used for calculation in groups and the limits of computability in this context,
  • use computer algebra systems for handling groups,
  • to clarify the limits of computability and efficiency of algorithms when dealing with algebraic objects at concrete problems.

Literature

  • Seress, Ákos. Permutation group algorithms . Vol. 152. Cambridge University Press, 2003.
  • Holt, Derek F., Bettina Eick, and Eamonn A. O'Brien. Handbook of computational group theory . CRC Press, 2005.

Requirements for attendance of the module (informal)

None

Requirements for attendance of the module (formal)

None

References to Module / Module Number [INF-58-52-M-6]

Course of Study Section Choice/Obligation
[INF-88.79-SG] M.Sc. Computer Science [Specialisation] Specialization 1 [WP] Compulsory Elective