Recent Publications

Quickly discover relevant content by filtering publications.

We prove that $\operatorname{Aut}(F_n)$ has Kazhdan’s property (T) for every $n \geqslant 6$. Together with the previous result …

We establish a lower bound on the spectral gap of the Laplace operator on some special linear groups using conic optimisation.

We try to integrate group actions to the topological complexity setting, by introducing «jumps» in the planner. This approach is based …

We survey the results on group actions on Euclidean spaces, disks and spheres and summarise my results on perfect group actions on …



MATH+ Post-Doc

Technische Universität Berlin

Feb 2019 – Present Berlin, Germany
Main research topic: machine learning meets polytope theory


Mathematical Institute of Polish Academy of Sciences

Oct 2015 – Nov 2017 Warsaw, Poland
Main research topic: computational aspects of Kazhdan’s property (T)

Assistant Professor

Faculty of Mathematics and Computer Science of AMU

Oct 2014 – Present Poznań, Poland

Upcoming Talks

  • Rigidity, 24-28.06.2019, IMPAN, Warsaw, Poland (invited talk)
  • ICCOPT, 03-08.08.2019, TU Berlin, Berlin, Germany
  • 100 lat PTM, 03-07.09.2019, Jagiellonian University, Cracow, Poland
  • Outer Space in Bielefeld, 24-26.09.2019, University of Bielefeld, Bielefeld, Germany (invited talk)

Past talks

Recent Posts

Splitting Conic Solver or scs is a well established solver for conic optimization problems. It has bindings to julia via SCS.jl. Part …

Below are replication details for computations with special linear groups as described in Section 5.1 of paper On property (T) for …

This post documents replication details for paper $\operatorname{Aut}(\mathbb{F}_5)$ has property (T) by M. Kaluba, P.W. Nowak and N. …

This post documents replication details for paper Certifying numerical estimates of spectral gaps by M. Kaluba, P.W. Nowak. This guide …


  • (0048 61 829) 5497
  • Room B1-30, Faculty of Mathematics and Computer Science, ul. Uniwersytetu Poznańskiego 4, 61-614 Poznań, Poland
  • Tuesday 11:00 to 12:30,
    or appointment by e-mail