2 citations · 2 across the 5 of their papers we have counts for
5 papers
Unimodular random graphs with Property (T) have cost one
Łukasz Grabowski, Héctor Jardón-Sánchez, Sam Mellick
Hutchcroft and Pete showed that countably infinite groups with Property (T) admit cost one actions, resolving a question of Gaboriau. We give a streamlined proof of their theorem,…
On group rings of virtually abelian groups
Joan Claramunt, Lukasz Grabowski
Let be a finitely generated torsion-free group. We show that the statement of being virtually abelian is equivalent to the statement that the -regular closure of the gro…
Moser-Tardos Algorithm with small number of random bits
Endre Csóka, Łukasz Grabowski, András Máthé +2
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…
On random compact sets, equidecomposition, and domains of expansion in R^3
Tomasz Cieśla, Łukasz Grabowski
We study random compact subsets of R^3 which can be described as "random Menger sponges". We use those random sets to construct a pair of compact sets A and B in R^3 which are of t…
On directed analogues of expander and hyperfinite graph sequences
Endre Csóka, Łukasz Grabowski
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences,…