Lectures

• Spring term 2026 - Algebra 2
• Winter term 2025/26 - Convex Optimization
• Spring term 2025 - CSP seminar
• Spring term 2025 - Algebra 2
• Spring term 2025 - Universal Algebra 2
• Winter term 2024/25 - Convex Optimization
• Spring term 2024 - Algebra 2 for CS
• Spring term 2024 - Algebra Proseminar
• Winter term 2023/24 - Convex Optimization
• Spring term 2023 - Algebra 2 for CS
• Spring term 2023 - Universal Algebra 2
• Spring term 2022 - Universal Algebra 2
• Winter term 2021/22 - Algebra 1 for CS
• Spring term 2020 - Universal Algebra 2
• Winter term 2019/20 - Universal Algebra 1
• Spring term 2019 - Universal Algebra 2
• Winter term 2018/19 - Universal Algebra 1

In addition, since Spring term 2022, I am one of the organizers of the Algebra Colloquium (NMAG581).

Spring term 2026
Algebra 2 (NMAI076)

Practicals: Monday 13:10 - 13:50, lecture room S6
Lecture: Monday 14:00-15:30, lecture room S4

Lecture notes	Czech	English
Algebra 1	alg1_cz	alg1_en
Algebra 2	alg2_cz	alg2_en

Evaluation:
The credit (Zápočet) for the course is obtained through active participation in the Practicals (presentation and discussion of exercises).
The grade will be determined by an oral exam, admission to the exam requires getting ''Zápočet'' first.

Syllabus: This course is a continuation of Algebra 1 and aims to introduce computer science students to some topics from abstract algebra:

1. Homomorphisms (group homomorphism, quotient groups, ring homomorphisms, ideals, classification of finite fields)
2. Number fields (ring and field extensions, algebraic elements, and finite degree extensions)
3. Algorithms in polynomial arithmetic (fast polynomial multiplication and division, decomposition)
4. Other algebraic structures (lattices and Boolean algebras)

Overview:

Date	Topics	Lecture notes
16/02	Group homomorphisms and isomorphisms, invariants	Section 1.1-1.3
23/02	Classification results for groups; Quotient groups, the first isomorphism theorem Pr: Finding homomorphisms/isomorphism between groups	Section 1.4, 2
02/03	Ideals and divisibility, principal ideal domains Pr: first isomorphism theorem, the alternating group An, the 15 puzzle	Section 3
09/03	Ring homomorphisms, isomorphism, isomorphism theorems Pr: Formal power series, basis of ideals	Section 4.1-4.3
16/03	When is a quotient ring a field/domain? Ring and field extensions, the degree of a field extension Pr: Quotients of polynomial rings	Section 4.4, 5
23/03	Algebraic elements, minimal polynomials, degrees of field extensions Pr: ring and field extensions	Section 6
30/03	algebraic numbers form a field; Problems unsolvable by ruler and compass Pr: minimal polynomials, degrees of non-simple extensions	Section 6.3, 7
06/04	Easter Monday
13/04	uniqueness of rupture and splitting fields Pr: constructible numbers, regular polygons	Section 8
20/04	Classification of finite fields Pr: constructability of regular polygons	Section 9
27/04	Fast Fourier Transform Pr: Subfields of finite fields; leftover exercises on field extensions	Section 10
04/05	Fast polynomial multiplication and division; inverses of power series Pr: primitive roots of unity, FFT	Section 11
11/05	Berlekamp's algorithm for polynomial factorization Pr: Schönhage–Strassen trick, polynomial division	Section 12.2
18/05	General algebraic structures (substructures, homomorphisms, quotients, 1st iso theorem) Pr: square-free decompositions	Section 13 Section 12.1

Consultation:
If you have questions, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but if required, a personal meeting can be arranged. Please make also use of the exercise classes to discuss your questions.

Winter term 2025/26
Convex Optimization (NMMB409)

Lecture: Tuesday 17:20 - 18:50, K9. Wednesday 10:40 - 12:10, K7.
Practicals: Thursday 15:40 - 17:10, K9.

Literature:

• [BV] Boyd, Vandenberghe, Convex Optimization
  This is the main source for the course. Book and slides are freely available on Boyd's website.
• [MG] Matoušek, Gärtner, Understanding and Using Linear Programming
• Homeworks will include programming assignments that are based on using the Python package CVXPY (CVXPY).

Evaluation:
There will be 4 homework assignments, on each of which you need to score at least 60% to obtain the credit (zápočet) for the course. If this condition cannot be met (e.g. due to illness, or some other significant reasons), there is the possibility of solving an extra 5th homework assignment.
Exam: oral examination. It is necessary to have obtained the credit (zápočet) in order to take the exam.

Consulation: If you have any questions, do not hesitate to ask! Best in my office hours, Th: 17:10-18:00.

Overview:

Date	Topics	Reference	Homework
30.09	Optimization problems, Examples Convex optimization problems can be solved efficiently	BV1, MG2
1.10	Convex sets: definitions, important examples closure under intersections and affine functions	BV2.1-2.3
2.10	Pr.: Basic examples in CVXPY	Pr1 Sol1
7.10	Separating and supporting hyperplane theorem (+proof) Basic examples of convex functions	BV 2.5, 3.1
8.10	first and second order criterion for convexity, epigraph and sublevel sets	BV 3.1
9.10	Pr.: Convex sets and functions	Pr2
14.10	Operations that preserve convexity, important definitions for optimization problems	BV 3.2, 4.1
15.10	The first order criterion for convex optimization problems, locally optimal solutions are optimal	BV 4.1
16.10	Pr.: Operations that preserve convex functions, LP normal form	Pr3	HW1 - due 30.10
21.10	LPs, QPs, QCQPs. bounded polyhedra as convex hull of their vertices Motivational example for solving LPs	BV 4.3, 4.4 MG 4
22.10	the standard normal form for LPs, basic feasible solutions the simplex method, unboundedness and degeneracy	MG 4, 5
23.10	Pr.: Linear Programs	Pr4
28.10	Independence day
29.10	simplex method: finding basic feasible solutions; discussion different Pivot rules LP-relaxations (Example: vertex cover). linear-fractional problems reduce to LPs	MG 5, BV 4.3.2
30.10	Pr.: LPs, Norm approximation problems	Pr5	HW2 - due 13.11
4.11	Geometric programming (Example: bacteria population) quasiconvex problems and the bisection method	BV 4.5, BV 4.2.5.
5.11	generalized inequality constraints and Semidefinite Programming (SDP) The SDP relaxation of Max-CUT	BV 4.6, Notes
6.11	Pr.: QPs, QCQPs, SOCPs, SDPs	Pr6
11.11	Vector optimization, Pareto optima via scalarization Duality: Definition of Langrange dual function, and dual problem	BV 4.7 BV 5.1
12.11	Dean's sports day
13.11	Pr.: Duality, Pareto optimal solutions	Pr7	HW3 - due 27.11
18.11	strong duality and Slater's condition geometric and saddle point interpretation, complementary slackness	BV 5
19.11	strong duality, KKT conditions, Farkas lemma	BV 5, Notes
20.11	Pr.: strong duality, KKT conditions,	Pr8
25.11	Sensitivity analysis Approximation: Penality functions approximation	BV5 BV 6.1, 6.2
26.11	Examples: Optimal input design, signal denoising, robust approximation Function fitting	BV 6.3, 6.4
27.11	Pr.: Mixed strategy matrix games, Function fitting	Pr9	HW4 - due 11.12
2.12	ML estimates (Linear measurement models, logistic regression, Covariance matrix estimation)	BV 7.1
3.12	Binary hypothesis testing Geometric problems: Löwner-John ellipsoids for polyhedra	BV 7.3, 8.4
4.12	Pr.: ML estimates	Pr10
9.12	Centers of polyhedra, support vector machines	BV 8.5, 8.6
10.12	The kernel trick for non-linear SVMs Unconstraint minimization: Gradient descent and its convergence	wiki BV 9
11.12	Pr.: Newton descent	Pr11	HW5 - due 7.1
16.12	Unconstraint minimization: Newton descent and its properties	BV 9.5
17.12	Newton descent for equality constraints	BV 10
18.12	Practical cancelled!
5.1	Inner point methods (log-barrier method) and its convergence	BV 11.1-11.3
6.1	log-barrier method for unfeasible start, generalized inequalities	BV 11.4,11.6
7.1	Pr.: Self-concordant functions	Pr12

Spring term 2025
Seminar on CSP (NMAG573)

Spring term 2025
Algebra 2 (NMAI076)

Lecture: Thursday 12:20 - 13:50, lecture room S8
Exercises: Thursdays 14:00 - 15:30 on odd weeks, lecture room S1

Lecture notes	Czech	English
Algebra 1	alg1_cz	alg1_en
Algebra 2	alg2_cz	alg2_en

Evaluation:
To obtain the credit (Zápočet) for the course you need to score at least 54 out of 90 points. Points can be obtained from 3 homework assigments (3*30 points). The final grade will be determined by an oral exam, admission to the exam requires getting ''Zápočet'' first.

Syllabus: This course is a continuation of Algebra 1 and aims to introduce computer science students to some topics from abstract algebra:

1. Homomorphisms (group homomorphism, quotient groups, ring homomorphisms, ideals, classification of finite fields)
2. Number fields (ring and field extensions, algebraic elements, and finite degree extensions)
3. Algorithms in polynomial arithmetic (fast polynomial multiplication and division, decomposition)
4. Other algebraic structures (lattices and Boolean algebras)

Overview:

Date	Topics	Lecture notes	Homework
20/02	Group homomorphisms and isomorphisms, invariants, classifications Ex: Examples	Section 1
27/02	Quotient groups Homomorphism theorem and isomorphism theorems	Section 2
06/03	Ideals, Principal Ideal Domains Ex: Quotient groups, sums and intersections of Ideals	Section 3	HW1 due 20.03.
13/03	Ring homomorphisms, quotient rings Isomorphism theorems for rings, prime/maximal ideals	Section 4
20/03	Ring and field extensions Ex: quotient rings	Section 5
27/03	Cancelled due to illness
03/04	Algebraic numbers, minimal polynomials, degrees of simple/multiple extensions Ex: Examples, constructibility in classic geometry	Section 6, 7	HW2 due 17.04.
10/04	Uniqueness of rupture fields and splitting fields	Section 7, 8
17/04	The classification of finite fields Ex: Constructability of regular n-gons	Section 9
24/04	Modular representations, Fast Fourier Transform	Section 10	HW3 due 15/05
01/05	International Workers' Day
08/05	V day
15/05	fast polynomial multiplication and division using FFT Ex: square-free decomposition	Section 11, 12.1
22/05	Berlekamp's algorithm	Section 12

Consultation:
If you have questions, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but if required, a personal meeting can be arranged. Please make also use of the exercise classes to discuss your questions.

Spring term 2025
Universal Algebra II (NMAG450)

Lecture: Tuesday 09:00 - 10:30, lecture room K2
Practicals: even weeks, Tuesday 10:40 - 12:10, lecture room K10C, run by Max Hadek

Lecture notes

Evaluation:
To obtain the credit (Zápočet) for the course you need to score at least 60% on 3 homework assignments.
The final grade will be determined by an oral exam, admission to the exam requires getting ''Zápočet'' first.

Date	Topics	Lecture notes	Exercises	Homework
17/02	Equational theories are fully invariant congruences, completeness theorem for equational logic.	Section 1.1
25/02	Term rewriting systems (finitely terminating/normal/convergent) Knuth-Bendix completion algorithm	Section 1.2, 1.3	1.3,1.4, (1.8),1.9
04/03	affine and Abelian algebras Fundamental theorem of Abelian algebras	Section 2.1, 2.2
11/03	The term conditions commutator, Examples (groups and lattices)	Section 2.3	EX2	HW1, due 25/03
18/03	Relational description of the commutator Characterization of congruence distributive varieties	Section 2.3, 2.4
25/03	finishing proof (CD varieties) Nilpotent algebras and the polynomial equivalence problem	Section 2.4, 2.5	EX3
01/04	Finitely based algebras Park's 4-element non-finitely based groupoid	Section 3
08/04	Park's conjecture McKenzies DPC result	Section 3.1	EX4	HW2, due 22/04
15/04	Jónsson' lemma, Proof outline of Baker's theorem CSPs over finite structures	Section 3.2, 4.1
22/04	the Pol-Inv Galois connection revisited Clone homomorphisms	Section 4.1, 4.2	EX5
29/04	Birkhoffs theorem for clones, minion homomorphisms Taylor's theorem	Section 4.2, 4.3	EX6
06/05	Proof of Taylor's theorem characterizations of finite Taylor algebras	Section 4.3.	EX6	HW3
13/05	Dean's sports day
20/05	finite Taylor implies 6-ary Siggers	Section 4.4.

Consultation:
If you have questions on the material, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but personal meetings can be arranged. Please make also use of the exercise classes to discuss your questions.

Winter term 2024/25
Convex Optimization (NMMB409)

Lecture: Thursday 12:20 - 13:50, K7; Friday 12:20 - 13:50, K8
Practicals: Wednesday 12:20 - 13:50, K8; run by Alexey Barsukov.

Literature: The lecture follows mainly the book and slides on Convex Optimization by Boyd and Vandenberghe [BV], which are freely available online on Boyd's website. If alternative material is used, it will be shared here. Practicals and homework assignments will also be published here. Homeworks will include programming assignments that are based on using the Python package CVXPY (CVXPY).

Evaluation:
There will be 4 homework assignments, on each of which you need to score at least 60% to obtain the credit (zápočet) for the course. If this condition cannot be met (e.g. due to illness, or some other significant reasons), there is the possibility of solving an extra 5th homework assignment.
Exam: oral examination. It is necessary to have the credit in order to take the exam.

Consulation: If you have any questions, do not hesitate to ask! Best in my office hours, Fr: 11:00-12:20.

Overview:

Date	Topics	Reference	Homework
2.10	Pr.: Introduction to Python and the CVXPY package	Pr0, Pr1
3.10	Optimization problems Convex problems can be solved efficiently (e.g. linear programming, least-squares)	BV 1
4.10	Convex sets: Important examples (affine spaces, halfspaces, balls, cones,...) closedness under intersection and affine/perspective functions	BV 2.1-2.3
9.10	Pr.: Examples of LPs and least-squares problems	Pr2
10.10	Separating hyperplane theorem convex/concave function: important examples, first and second order criteria	BV 2.5, 3.1
11.10	the epigraph, operations that preserve convexity (weighted sums, suprema, infima, composition)	BV 3.1., 3.2
16.10	Pr.: Convex sets and functions, the perspective of a function	Pr3	[HW1] - 30.10
17.10	Quasiconvex functions; Important definition for general optimization problems Convex OPs: local optima are optima; optimality criterion in differentiable case	BV 3.4, 4.1, 4.2
18.10	LP, QP, QCQP, SOCP + Examples (Chebyshev center, distance of polyhedra, robust LP...); Transforming Optimization Problems	BV 4.3, 4.4, 4.2
23.10	Pr.:Transforming Optimization Problems, standard form of LP	Pr4
24.10	Geometric programming, linear-fractional programs bisection method for quasiconvex problems, proper cones	BV 4.5, 4.3.2 4.2,5, 2.4
25.10	Generalized inequality constraints (conic problems), SDPs the SDP-relaxation of Max-Cut, LP relaxations	BV 4.6 Notes
30.10	Pr.: Examples of SDPs, reduction of LP, QCQP, SOCP to SDPs	Pr5
31.10	Multiobjective optimization problems, finding Pareto optima via scalarization; scalarization for general K via dual cones K*	BV 4.7, 2.6
1.11	Duality: Lagrangian, dual function, dual problem, weak duality Slater's condition for strong duality	BV 5.1, 5.2
6.11	Pr.: Duality	Pr6	[HW2] - 20.11
7.11	Different interpretations of duality (geometrical, saddle point interpretation) Examples, randomized strategies for randomized matrix games	BV 5.3, 5.7 5.2.5
8.11	Farkas lemma, strong duality for LPs	BV 5.8, Notes
13.11	Pr.: Duality, Slater's condition	Pr7
14.11	KKT conditions, perturbation analysis	BV 5.5, 5.6
15.11	Duality for generalized inequalities Norm and penality function approximation	BV 5.9, 6.1
20.11	Pr.: KKT conditions, perturbation analysis; log barrier penalty function	Pr8	[HW3] - 4.12
21.11	Comparisons of different penalty functions, Huber penalty for robust approximation least-norm problems, regularization problems and applications in signal processing	BV 6
22.11	maximimum likelihood estimates and examples: linear measurement models, Poisson distributon, logistic regression, covariance matrix	BV 7.1
27.11	Pr.:Function fitting	Pr9
28.11	Function fitting (discussion practicals Pr9), MAP estimates Binary hypothesis testing	BV 7.1, 7.3
29.11	Binary hypothesis testing, Optimal experiment design	BV 7.3, 7.5
4.12	Pr.:statistical estimation	Pr10	[HW4] - 22.12
5.12	Geometric problems: distance between convex sets, outer and inner Loewner-John ellipsoids, centering	BV 8.1,8.2, 8.4,8.5
6.12	Linear discriminators, support vector machines Newton's method to approximate roots of a real-valued function	BV 8.6, [wiki]
11.12	Pr.: Geometric problems (projections onto convex sets)	Pr11
12.12	Unconstraint optimization: Strong convexity and some consequences the (gradient) descent method, backtracking line search	BV 9.1-9.3
13.12	convergence analysis for gradient descent Newton descent (motivation for Newton step; convergence analysis without proof)	BV 9.3-9.5
18.12	Pr.: Steepest descent and Newton descent	Pr12	[HW5] - 10.1
19.12	Newton descent for problems with equality constraints (feasible and infeasible initial point)	BV 10
20.12	the (log-)barrier method (for general convex problems), central path proof of convergence, discussion of examples	BV 11.1-11.6
8.1	Pr.: the barrier method	Pr13
9.1	Linear Programming revisited; the Simplex method
10.1	LP and LP-relaxations in theoretical computer science

Spring term 2024
Algebra 2 (NMAI076)

Lecture: Thursday 14:00 - 15:30, lecture room S6
Exercises: Thursdays 15:40 - 17:10 on odd weeks, lecture room S6

Lecture notes	Czech	English
Algebra 1	alg1_cz	alg1_en
Algebra 2	alg1_cz	alg2_en

Evaluation:
To obtain the credit (Zápočet) for the course you need to score at least 54 out of 90 points. Points can be obtained from 3 homework assigments (3*30 points). The final grade will be determined by an oral exam, admission to the exam requires getting ''Zápočet'' first.

Syllabus: This course is a continuation of Algebra 1 and aims to introduce computer science students to some topics from abstract algebra:

1. Homomorphisms (group homomorphism, quotient groups, ring homomorphisms, ideals, classification of finite fields)
2. Number fields (ring and field extensions, algebraic elements, and finite degree extensions)
3. Algorithms in polynomial arithmetic (fast polynomial multiplication and division, decomposition)
4. Other algebraic structures (lattices and Boolean algebras)

Overview:

Date	Topics	Lecture notes	Homework
22/02	Repetition groups, group homomorphisms and isomorphisms, invariants Ex: Examples	Section 1.1-1.3
29/02	Group classifications; Normal subgroups, quotient groups	Section 1.4, 2
06/03	The homomomorphism theorem and isomorphism theorems for groups; Ideals, PIDs Ex: determining quotient groups, sums and intersections of ideas in Z	Section 2, 3	HW1 due 21/03
13/03	Ring homomorphisms, quotient rings	Section 4
20/03	Isomorphism theorems for rings, prime/maximal ideals, ring and field extensions Ex:computing quotient rings, ring extensions	Section 4,5.1
28/03	Algebraic and transcendental elements, the degree of a field extension, minimal polynomials	Section 5.2,6.1,6.2
04/04	minimal polynomials, degrees of general extensions, algebraic numbers are a field Ex: computing minimal polynomials, degrees of extensions, splitting fields	Section 6.2, 6.3	HW2 due 18/04
11/04	Problems solvable by ruler and compass Uniqueness of rupture fields and splitting fields	Section 7, 8
18/04	The classification of finite fields Ex: Constructability of regular n-gons	Section 9
25/04	Modular representations, Fast Fourier Transform	Section 10
02/05	(self study) fast polynomial multiplication and division using FFT Ex: primitive roots, FFT	Section 11	HW3 due 16/05
09/05	fast polynomial multiplication and division using FFT square-free decomposition	Section 11, 12.1
16/05	Berlekamp's algorithm Ex: formal power series, discussion of 3rd homework	Section 12
23/05	Examples of other algebraic structures	Section 13

Consultation:
If you have questions, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but if required, a personal meeting can be arranged. Please make also use of the exercise classes to discuss your questions.

Spring term 2024
Algebra Proseminar (NMAG261)

See David Stanovský's website.

Winter term 2023/24
Convex Optimization (NMMB409)

The course was organized via the following Moodle course. The practicals were run by Mykyta Narusevych.

Winter term 2023/24
Practicals in Universal Algebra 1 (NMAG405)

See Libor Barto's website.

Spring term 2023
Algebra 2 (NMAI076)

Lecture: Monday 09:00 - 10:30, lecture room S6
Exercises: Monday 10:40 - 12:10 on odd weeks, lecture room S6, held by Filippo Spaggiari

Lecture notes	Czech	English
Algebra 1	alg1_cz	alg1_en
Algebra 2	alg1_cz	alg2_en

Evaluation:
To get ''Zápočet'' (i.e. to pass the exercise classes) you need to score at least 45 out of 70 points. Points can be obtained from 2 homework assigments (2*30 points), and in-class presentation (10 points). For more details see Filippo Spaggiari' website.
The final grade will be determined by an oral exam, admission to the exam requires passing the exercise class.

Syllabus: This course is a continuation of Algebra 1 and aims to introduce computer science students to some topics from abstract algebra:

1. Homomorphisms (group homomorphism, quotient groups, ring homomorphisms, ideals, classification of finite fields)
2. Number fields (ring and field extensions, algebraic elements, and finite degree extensions)
3. Algorithms in polynomial arithmetic (fast polynomial multiplication and division, decomposition)
4. Other algebraic structures (lattices and Boolean algebras)

Overview:

Date	Topics	Lecture notes	Homework
13/02	Group homomorphisms and isomorphisms, invariants, classifications Ex: Examples	Section 1
20/02	Normal subgroups, quotient groups, homomophism theorem, 1st isomorphism theorem	Section 2
27/02	Ideals and divisibility, PIDs, ideals in fields Ex: quotient groups, intersection and sum of ideals	Section 3
06/03	Quotient rings, homomorphism theorem, 1st and 2nd isomorphism theorem for rings	Section 4.1,4.2
13/03	prime and maximal ideals; Ring and field extensions, degree Ex:quotient rings, ring and field extensions	Sections 4.3, 5	1st HW due 27.3
20/03	Algebraic and transcendental numbers Minimal polynomials of algebraic numbers	Section 6
27/03	Extensions by more than one element, constructability, ruler-and-circle constructions Ex: minimal polynomials and algebraic numbers	Section 6.3, 7
03/04	Uniqueness of splitting fields (up to isomorphism), Classification of finite fields	Sections 8, 9
10/04	Easter Monday
17/04	Modular representations of rings, Fast Fourier Transformation	Section 10
24/04	Fast polynomial multiplication and division, formal power series Ex: general field extensions and their degree	Section 11
01/05	International Workers' Day
08/05	V-Day		2nd HW due 24.5
15/05	Square-free factorizations of polynomials Berlekamp's algorithm for decomposition into irreducibles	Section 12
22/05	Berlekamp's algorithm; algebraic structures, substructures, homomorphisms Ex: ordered sets, lattices and Boolean algebras	Sections 12, 13

Consultation:
If you have questions, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but if required, a personal meeting can be arranged. Please make also use of the exercise classes to discuss your questions.

Spring term 2023
Practicals in Universal Algebra II (NMAG450)

See Libor Barto's website.

Spring term 2022
Universal Algebra II (NMAG450)

Lecture: Monday 10:40 - 12:10, lecture room K7
Exercise classes: even weeks, Monday 12:20 - 13:50, lecture room K7, given by Kevin Berg

Lecture notes

Syllabus:This course discusses selected topics from Universal Algebra. This includes

1. Equational logic: the equational completeness theorem, term rewriting systems, Knuth-Bendix algorithm
2. Commutator theory: Abelianness, the term condition commutator, applications
3. Finitely based algebras: McKenzie's theorem on algebras with DPC
4. Maltsev conditions: Taylor terms, polymorphism clones and CSPs, absorption theory

Evaluation:
Exercises: there will be 3 homework assignments, on which you need to score 60% to get ''Zápočet''
Lecture: oral examination (appointment by mail: michael@logic.at).

Date	Topics	Lecture notes	Exercises	Homework
14/02	Equational theories, fully invariant congruences; completeness theorem for equational logic.	Section 1.1
21/02	term rewrite systems, convergence, Knuth-Bendix	Section 1.2, 1.3	1.2,1.3,1.4
28/02	Abelian and affine algebras Herrmann's fundamental theorem	Section 2.1, 2.2
07/03	The term conditions commutator, Examples (groups and lattices)	Section 2.3	1.2,1.3,1.4 2.12, 2.13	HW1: 1.6, 1.8 (first point) 2.10, 2.14
14/03	A characterization of CD varieties by the commutator	Section 2.4
21/03	Birkhoff's theorem on Id_n a non-finitely based algebra	Chapter 3	2.19,2.20	HW1 due
28/03	Park's conjecture McKenzie's DPC theorem	Section 3.1
04/04	Jonsson's lemma DPSC varieties	Section 3.2	3.2,3.3, 3.11	HW2: 3.4, 3.5, 3.6, and 4.1
11/04	Baker's theorem CSPs: Definition and Examples	Section 3.2, 4.1
18/04	Easter holiday
25/04	Pol-Inv revisited, clone homomorphisms	Section 4.1., 4.2.		HW2 due
02/05	Minion homomorphisms, Taylor's theorem	Section 4.2.	4.3, 4.13	HW3: 4.6,4.7,4.8 and 4.12
09/05	Loop lemma (for triangles) Siggers terms	Section 4.3
16/05	only Exercise class today!			HW3 due

Consultation:
If you have questions on the material, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but personal meetings can be arranged. Please make also use of the exercise classes to discuss your questions.

Further reading:

• Clifford Bergman: Universal Algebra: Fundamentals and Selected Topics - our library has a few copies!
• Jaroslav Ježek: Universal Algebra
• Barto, Krokhin, Willard: Polymorphisms, and how to use them.
• Barto, Kozik: Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Burris, Sankappanavar: A Course in Universal Algebra

Winter term 2021/22
Algebra 1 (NMAI062)

Please register to the !! Moodle course !!

Lecture notes

Lecture: Wednesday 10:40 - 12:10, lecture room S4
Exercise classes: Tuesdays 15:40 - 17:10, lecture room S10, given by Kevin Berg
(current covid regulations)

Evaluation:
To get ''Zápočet'' (i.e. to pass the exercise classes) you need to score at least 60/100 points. These can be obtained from 3 homework assignments (3*30 points), or weekly quizzed (10 points), which will be posted on the Moodle course
The final grade will be determined by a written exam. Admission to the exam requires passing the exercise class.

Syllabus:This course aims to give an introduction to algebra for computer science students. It will cover the following topics:

1. Number theory: prime factorization, congruences, Euler's theorem and RSA, the Chinese remainder theorem
2. Polynomials: rings and integral domains, polynomial rings, irreducibility, GCD, the Chinese remainder theorem and interpolation, the construction of finite fields and applications (error correcting codes, secret sharing,...)
3. Group theory: permutation groups, subgroups, Langrange's theorem, group actions and Burnsides's theorem, cyclic groups, discrete logarithm and applications in cryptography

Literature:The course has its own lecture notes, which are based on David Stanovsky's material from last year, and will be constantly updated during the semester. Complementary resources are for instance

• J. Rotman, A First Course in Abstract Algebra (available in our library),
• C. Pinter A Book of Abstract Algebra (freely available online),
• or any other undergraduate level textbook on abstract algebra.

Consultation:
If you have open questions, do not hesitate to ask (either in person or via e-mail)! I have no official office hours, but if required, a personal meeting can be arranged. Please make also use of the exercise classes to discuss your questions.

Spring term 2020
Universal Algebra II (NMAG450)

Lecture notes

Grading:
Exercises: homeworks (you need to score 60% on the 3 best out of 4 homeworks)
Lecture: oral examination (appointment by mail: michael@logic.at).
Not available from 17.07.-27.07, 17.08-28.08

Additional literature:

• Clifford Bergman: Universal Algebra: Fundamentals and Selected Topics - our library has a few copies!
• Jaroslav Ježek: Universal Algebra
• (BKW) Barto, Krokhin, Willard: Polymorphisms, and how to use them.
• (BK) Barto, Kozik: Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Burris, Sankappanavar: A Course in Universal Algebra (an alternative source of examples and exercises)

Date	Topics	Lecture notes	Exercises	Homework
24/02	Equational theories, fully invariant congruences; completeness theorem for equational logic.	Section 1.1	1.1-1.3
02/03	Convergent term rewriting systems	Section 1.2
09/03	Critical pairs, Knuth-Bendix algorithm; Affine algebras	Section 1.2, 1.3 Section 2.1	1.4, 1.8,1.9	1.5,1.6,1.7 due on 24/03
16/03	Abelian algebras Herrmann's fundamental theorem	Section 2.1, 2.2	2.1-2.9; in particular 2.2, 2.6
23/03	Centralizer relation and commutator Example: groups	Section 2.3	2.11, 2.12	2.10, 2.13, 2.14 due on 07/04
30/03	Properties of the commutator Characterization of CD varieties	Section 2.3, 2.4	2.15-2.20; in particular 2.18,2.19
06/04	Nilpotent algebras and open questions	Section 2.5	Section 2.5
20/04	Birkhoff's theorem on Id_n(A) Example of a non-finitely based algebra	Chapter 3	3.1-3.4
27/04	McKenzies DPC theorem	Section 3.1	3.5-3.8
04/05	CSPs, pp-definable relations Pol-Inv	Section 4.1	4.1-4.5	3.5,3.6,4.3 due on 19/05
11/05	Clone and minion homomorphisms	Section 4.2	4.6-4.8
18/05	Taylor operations the CSP dichotomy conjecture/theorem	Section 4.3	4.9-4.11	4.6,4.7,4.8 until your exam

Winter term 2019/20
Practicals in Universal Algebra I (NMAG405)

See Libor's website.

Spring term 2019
Universal Algebra II (NMAG450)

The course will roughly follow Libor Barto's lecture from 17/18.

Lecture: Thurday 9:00 - 10:30 Seminar room of KA
Exercises: Thurday 10:40 - 12:10 Seminar room of KA (only odd semester weeks = even calendar weeks)

Grading:
Exercises: homeworks (60% from 3 best scores out of 4 homeworks)
Lecture: oral examination (appointment by mail: michael@logic.at).
next available dates 27/05-07/06; 17/06-20/06; 04/07-

Literature:

• Clifford Bergman: Universal Algebra: Fundamentals and Selected Topics - our library has a few copies!
• Jaroslav Jezek: Universal Algebra
• (BKW) Barto, Krokhin, Willard: Polymorphisms, and how to use them.
• (BK) Barto, Kozik: Absorbing Subalgebras, Cyclic Terms, and the Constraint Satisfaction Problem
• Burris, Sankappanavar: A Course in Universal Algebra (an alternative source of examples and exercises)

Date	Topics	Recommended reading	Exercises	Homework
28/02	Abelian and affine algebras, Fundamental theorem.	Bergman 7.3	Ex. 1
07/03	Checking identities, Relational description of Abelianness; Centralizer relation (in general and in groups)	Bergman 7.4
14/03	Properties of the commutator Characterization of CD varieties	Bergman 7.4	Ex. 2	HW 1 due 28/03
21/03	Equational theories, fully invariant congruences; completeness theorem for equational logic.	Bergman 4.6 Jezek 13
28/03	Reduction order, critical pairs Knuth-Bendix algorithm	Jezek 13	Ex. 3
04/04	Examples of finitely based and non finitely based algebras	Bergman 5.4		HW 2 due 25/04
11/04	McKenzie's result on definable principal congruences	Bergman 5.5	Ex. 4
18/04	Constraint satisfaction problems over finite templates Pol-Inv revisited	BKW
25/04	(h1-)clone homomorphisms Taylor terms	BKW	Ex. 5	HW 3 due 09/05
02/05	Taylor's theorem	Bergman 8.4.
09/05	Smooth digraphs, algebraic length 1,absorption	BK
16/05	Absorption, transitive terms	BK	Ex. 6	HW 4
23/05	Absorption theorem, LLL (loop lemma 'light', for linked digraphs)	BK

Winter term 2018/19
Practicals in Universal Algebra I (NMAG405)

see David Stanovsky's website.