Jakub Opršal

This page is a record of my research as a postdoc working on an ERC project of Manuel Bodirsky. My main focus was applications of universal algebra to complexity of infinite and promise CSP.

If you are interested in my current research go to https://community.dur.ac.uk/jakub.oprsal/. 

Preprints

My preprints on arXiv.

• with Jakub Bulín, Andrei Krokhin, Algebraic approach to promise constraint satisfaction, preprint on arXiv.
• with Víctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Robust algorithms with polynomial loss for near-unanimity CSPs, preprint on arXiv.

JOURNAL Papers

• with Erhard Aichinger, Nebojša Mudrinski, Complexity of term representations of finitary functions, Int. J. of Algebra and Computation. Vol. 28, No. 06, pp. 1101–1118 (2018) doi: 10.1142/S0218196718500480. preprint on arXiv.
• with Libor Barto, Michael Pinsker, The wonderland of reflections, Isr. J. Math. (2018) 223: pp 363–398. doi: 10.1007/s11856-017-1621-9. http://rdcu.be/zYj8.
• Taylors modularity conjecture and related problems for idempotent varieties, Order 35(2018) no. 3: pp 433–460. doi:10.1007/s11083-017-9441-4. http://rdcu.be/yAo1.
• A relational description of higher commutators in Mal’cev algebras, Algebra Univers. (2016), 76: 367–383. doi:10.1007/s00012-016-0391-2.
• with D. Donovan, T. Griggs T. McCourt, D. Stanovský, Distributive and Anti-distributive Mendelsohn Triple Systems, Canadian Mathematical Bulletin 59(2016), no. 1, 36–49. doi:10.4153/CMB-2015-053-2.

Conference papers

• with Víctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Robust algorithms with polynomial loss for near-unanimity CSPs, Proceeding on 28th ACM-SIAM Symp. on Discrete Algorithms, doi:10.1137/1.9781611974782.22.
• with A. Carpi, G. Fici Š. Holub, M. Sciortino, Universal Lyndon Words, MFCS 2014, LNCS, Vol. 8634, 2014, pp 135–146.

Conference talks

• Promise constraint satisfaction, SSAOS, Špindlerův mlýn, Sep 4, 2018.

• Blockers of linear Mal’cev conditions, First Algebra Week, Sienna, Jun 20, 2018.

• An algebraic view on promise constraint satisfaction and hardness of coloring a d-colorable graph with 2d-1 colors, Schloß Dagstuhl, Jun 5, 2018.
• On promise graph coloring and Mal'cev conditions, AAA96, Darmstadt, Jun 1, 2018.
• Adjunct to the polymorphism functor, AAA95, Bratislava, Feb 10, 2018.
• An algebraic approach to promise constraint satisfaction, BLAST 2017, Nashville, TN, Aug 15, 2017.
• Infinite algebras with few subpowers, NSAC+AAA94, Novi Sad, Jun 15, 2017.
• Term complexity in congruence modular algebras, AAA93, Bern, Feb 10, 2017.