Azza Gaysin

Research Assistant

University of Passau

About me

I am a research assistant at Chair of Mathematical Logic, Faculty of Computer science and Mathematics, University of Passau, Passau, Germany.

Research interests: Logic, Computational complexity theory, Proof complexity theory, Bounded arithmetic, Universal algebra.

Education

PhD in Mathematics, 2018 - 2023

Faculty of Mathematics and Physics,
Department of Algebra,
Charles University
Master's degree in Mathematics, 2014 - 2018

Faculty of Mathematics and Physics,
Department of Algebra,
Charles University
Master's degree in Mathematics, 2009 - 2011

Faculty of Mathematics and Mechanics,
Department of Algebra,
Ural State University

Contact

Universität Passau,
Lehrstuhl Mathematische Logik,
Dr.-Hans-Kapfinger Straße 30, 94032 Passau
Room: HK30 101
Email: azza.gaysin@uni-passau.de
ORCID: 0000-0001-6863-8156

Skills

Programming

Python, SQL, Lean, LateX

MatLab, SageMath, Microsoft SQL Server, Oracle SQL Developer, PL/SQL, Oracle Data Modeler, Aqua Data Studio, Bizagi Modeler, Service Desk, SVN, VBA, CMS

Languages

English (C1), Russian (mother tongue), Czech (C1)

Teaching:

Winter semester 2024/2025:

Constraint Satisfaction Problems (2V +2Ü)

Lecturer

A Constraint Satisfaction Problem (CSP) asks to decide whether there is an assignment to given variables, ranging over a certain domain, that satisfies a given set of constraints. Equivalently, this asks for a homomorphism between given structures. A famous example is the satisfiability problem for the Boolean domain (SAT).

The story of CSPs started 50 years ago, and during the last 25 years CSPs play a prominent role throughout computer science. On the one hand, they allow to model a wide variety of combinatorial problems (in mathematics, computer science, artificial intelligence...) in a natural and faithful way. On the other hand, they come together with general algorithmic techniques for their solution, or general reasons for their computational hardness. These techniques are based on universal algebra.

The course offers an introduction to the algebraic approach to CSPs. Knowledge of universal algebra is not assumed but developed as needed. Knowledge of mathematical logic is also not assumed. But students should have a basic knowledge of computational complexity, e.g., on the level of Theoretical Computer Science II.

Computational Complexity Theory (4V +2Ü)

Assistant lecturer

Computational complexity theory aims to classify computational problems according to the algorithmic resources required for their solution. Resources are for example time, space, nondeterminism, or randomness. A central role is played by the class P of problems solvable in polynomial time. The central problem is the P versus NP problem, one of the Clay institute's millenium problems of mathematics, and, according to Smale, one of the three greatest open problems of mathematics. The course offers an introduction to this problem and its surrounding theory.

Past Semesters:

Computational Logic (4V +2Ü)

Assistant lecturer

Advanced Model Theory (2V +2Ü)

Assistant lecturer

Model Theory (4V +2Ü)

Assistant lecturer

Introduction to Logic (4V +2Ü)

Assistant lecturer

Publications

Proof complexity of universal algebra in a CSP dichotomy proof

A. Gaysin, submitted

PDF

Lattices of Weighted clones

A. Gaysin, J. Vančura, in preparation

Proof complexity of CSP

A. Gaysin, submitted

PDF

H-colouring Dichotomy in Proof Complexity

A. Gaysin, Journal of Logic and Computation, 31(5):1206–1225

PDF

Block-groups and Hall relations

A. Gaysin, M. Volkov, Semigroups, Categories, and Partial Algebras, 25–32. Springer Singapore, (2021)

PDF

Theses

Proof Complexity of CSP

PhD Thesis, Charles University in Prague, Czech Republic, 2023

Supervisor: Jan Krajíček
Study Programme: Algebra, Theory of Numbers and Mathematical Logic

PDF

Lattices of Weighted Clones

Master's Thesis, Charles University in Prague, Czech Republic, 2017

Supervisor: Libor Barto
Study Programme: Mathematical structures

PDF

Semigroups of Hall relation and block-groups

Master's Thesis, Ural State University, Russia, 2011

Supervisor: Mikhail Volkov
Study Programme: Discrete Mathematics and Mathematical Logic (confirmed by Ostrava University, Applied Mathematics Study Program, Applied Mathematics)

Conferences

Computability in Europe 2025

07/2025, Lisbon (invited speaker)

43rd Weak Arithmetics Days

09/2024, Passau (the only local organizer, talk)

Algorithmic Model Theory meeting 2024

02/2024, Ilmenau (talk)

42nd Weak Arithmetics Days

09/2023, Karlovasi (participation)

Mathematics of Cellular automata Workshop

03/2023, Prague (organizer)

Student Workshop on Applied Mathematics (SWAM)

11/2022, Prague (talk)

FLoC Proof Complexity Workshop

08/2022, Haifa (talk)

Mathematical approaches to lower bounds: the complexity of proofs and computation at ICMS

online (talk)

Complexity Theory with a Human Face, 3rd Edition

06/2022, Špindlerův Mlýn (participation)

Logic Colloquium

07/2022, online (talk)

Kurt Gödel Day 2021

06/2021, Brno (talk)

WiL 2020

06/2020, online (poster)

Dagstuhl Seminar 20061: SAT and Interactions

02/2020, Dagstuhl (participation)

Logic Colloquium 2019

08/2019, Prague (participation)

16th INTERNATIONAL CONGRESS OF LOGIC, METHODOLOGY AND PHILOSOPHY OF SCIENCE AND TECHNOLOG

08/2019, Prague (participation)

FEALORA Workshop 2018

11/2018, Špindlerův Mlýn (talk)

55th Summer School on Algebra and Ordered Set

09/2017, High Tatras (talk)

Arbeitstagung Allgemeine Algebra + 5th Novi Sad Algebraic Conference

07/2017, Novi Sad (participation)

The 92th Arbeitstagung Allgemeine Algebr

06/2016, Prague (help in organization)

53rd Summer School on General Algebra and Ordered sets

09/2015, Srni (participation)

Workshop on Groups and Semigroups and Special Session on Algebraic Theory of Semigroups

06/2015, Porto (participation)

International conference Algebra and mathematical logic

09/2011, Kazan (talk)