VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

401-3118-22L 6 Credits BSC , MSC D-MATH

Computation in Algebra and Number Theory

Lecturers & Examiners: Prof. Dr. David Alexander Loeffler
VVZ CR n/a

Last Updated: 2026-02-05 16:06:49

Abstract

This course will cover explicit, computational methods in a selection of areas of algebra and number theory. The lectures will survey the ideas needed in order to make the relevant objects explicit enough to represent on a computer, and a selection of the important algorithms; the exercise classes will give a hands-on introduction to some of the available software.

Content

Course content (approximate): - Commutative algebra: ideals in polynomial rings; Groebner bases and Buchberger's algorithm; elimination theory - Algebraic geometry: computing with varieties in affine/projective space; elliptic curves (group structure, hints at applications to cryptography) - Polynomials over integers and finite fields: Galois groups, Hensel lifting, Zassenhaus factorization - Lattices: short vectors, LLL reduction, applications - Algebraic number fields: integer rings, ideals, class groups; number-field sieve - Group theory: presentations of groups, coset enumeration; SL(2, Z) and its subgroups. Representations and characters of finite groups, Burnside's algorithm.

Resources

Literature

Cox, Little + O'Shea "Ideals, varieties and algorithms" Stewart + Tall "Algebraic number theory and Fermat's last theorem" Cohen "A course in computational algebraic number theory" Rotman "Introduction to the theory of groups"

Learning Materials (Links)

General Information

Language
English
Levels
BSC , MSC

Examination

Type
graded semester performance
Details to be announced.

Course Components

Type Title Time & Place Hours
lecture with exercise Computation in Algebra and Number Theory
  • Thu 10:15-12:00 (HG D 1.1)
  • Fri 11:15-12:00 (HG E 1.1)
3 h weekly

Offered In