Address:
Institut für Computersprachen
Theory and Logic Group
Technische Universität Wien
Favoritenstrasse 9/E1852
A1040 Wien
Austria
Room: HD0423 (Stiege 3 / 4.Stock)
Telephone: +43 (1) 58801  185 44
Email: michael@logic.at
I am a PhD student in Mathematics at TU Wien since 2015, my supervisor is Michael Pinsker. I am employed in the project P27600 Oligomorphic clones of the Austrian Science Fund (FWF), which is carried out at the Theory and Logic Group of TU Wien.
My research interests include model theory, universal algebra, Ramsey theory and theoretical computer science. In particular I am interested in clones, homogeneous structures and their applications in constraint satisfaction.
Equations in oligomorphic clones and the constraint satisfaction problem for ⍵categorical structures [arXiv]
with Libor Barto, Mirek Olšák, Michael Pinsker and Trung Van Pham
Preprint, 25 pages.
A complexity dichotomy for poset constraint satisfaction. [full version (arXiv)] [conference version]
with Trung Van Pham
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017), p47:1–47:12
Uncountably many maximal subgroups of Sym(N) via reducts of Henson digraphs. [arXiv]
with Lovkush Agarwal
Submitted, 16 pages.
A counterexample to the reconstruction of ⍵categorical structures from their endomorphism monoids. [arXiv]
with Manuel Bodirsky, David Evans, and Michael Pinsker
To appear in the Israel Journal of Mathematics, 17 pages.
Gegenbeispiele zu drei Vermutungen über Kategorizität. [pdf]
Master thesis, supervised by Martin Goldstern.
2017/03  A complexity dichotomy for poset constraint satisfaction  STACS2017, Hannover  
2017/02  A new proof of the existence of cores of ⍵categorical structures  AAA93, FH Bern  [slides]  
2017/01  The two dichotomy conjectures for infinite domain CSPs  talk in the Theory and Logic Seminar of TU Wien  
2016/11  An introduction to Ramsey theory, at the Fall school of the Algebra department of Charles University  [slides]  
2016/08  Constraint satisfaction problems over the random poset, at the Logic Colloquium 2016, Leeds  
2016/05  CSPs over the random partial order, at AAA92 in Prague  [slides]  
2016/04  Constraint satisfaction problems over infinite domains with Trung Van Pham, in the Theory and Logic Seminar of TU Wien  [slides] 

2016/04  A complexity dichotomy for PosetSAT in the Algebra Seminar of TU Wien  [slides]  
2016/02  2^{⍵} many maximalclosed subgroups of Sym(⍵) via Henson digraphs at New Pathways between Group Theory and Model Theory in Mülheim an der Ruhr  [slides] 

2015/12  Maximal subgroups of Sym(⍵) via Henson digraphs in the KAFKA Seminar, CharlesUniversity Prague  [slides] 

2015/11  A counterexample on the reconstruction of oligomorphic clones at the workshop Homogeneous structures at BIRS, Banff  [video] 

2015/10  Algebraic methods in constraint satisfaction at Matej Bel University, Banská Bystrica  
2015/10  Reducts of Henson digraphs in the Wiener Algebra Seminar of TU Wien  
2015/06  Endomorphism monoids of ⍵categorical structures at TACL 2015, Ischia, Italy  [slides]  
2015/05  Dichotomy results for constraint satisfaction problems at PhDs in Logic VII, TU Wien  [slides]  
2015/04  Reconstruction of ⍵categorical structures in the KAFKA Seminar, CharlesUniversity Prague  
2015/04  Endomorphism monoids of ⍵categorical structures in the International Seminar of the Institut für Algebra, TU Dresden  [slides]  
2014/10  Definierbare Strukturen in the Algebra Seminar of TU Wien 