Searcharxiv⌕ Search

arXiv subjects

Łukasz Grabowski

Publications and source records attributed to Łukasz Grabowski.

14 recordsLinked to original sources
arXiv2026

Moser-Tardos Algorithm with small number of random bits

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 the expected total number of random bits used by the algorithm is constant; in particular, it is independent from the number of variables. This is achieved by using the same random bits to resample variables which are far enough in the dependency graph. There are two corollaries. First, we obtain a deterministic algorithm for finding a satisfying assignment, which for any class of problems as in the previous paragraph runs in time O(n), where n is the number of variables. Second, we present a Borel version of the Lovász Local Lemma.

math.CO↗
arXiv2025

Unimodular random graphs with Property (T) have cost one

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, and extend it both to locally compact second countable groups and unimodular random graphs. We prove unimodular random graph analogues of the Connes--Weiss and Glasner--Weiss theorem characterising Property (T).

math.GR↗
arXiv2024

Borel version of the Local Lemma

We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying assignment which is a Borel function. The main tool which we develop for the proof, which is of independent interest, is a parallel version of the Moser-Tardos algorithm which uses the same random bits to resample clauses that are far enough in the dependency graph.

math.CO↗
arXiv2023

Measurable equidecompositions for group actions with an expansion property

Given an action of a group $Γ$ on a measure space $Ω$, we provide a sufficient criterion under which two sets $A, B\subseteq Ω$ are measurably equidecomposable, i.e., $A$ can be partitioned into finitely many measurable pieces which can be rearranged using the elements of $Γ$ to form a partition of $B$. In particular, we prove that every bounded measurable subset of $R^n$, $n\ge 3$, with non-empty interior is measurably equidecomposable to a ball via isometries. The analogous result also holds for some other spaces, such as the sphere or the hyperbolic space of dimension $n\ge 2$.

math.MG↗
arXiv2021

On directed analogues of expander and hyperfinite graph sequences

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, respectively. Our main result is a probabilistic construction of non-hypershallow graph sequences.

math.CO↗
arXiv2021

On random compact sets, equidecomposition, and domains of expansion in R^3

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 the same positive measure, such that A can be covered by finitely many translates of B, B can be covered by finitely many translates of A, and yet A and B are not equidecomposable. Furthermore, we construct the first example of a compact subset of R^3 of positive measure which is not a domain of expansion. This answers a question of Adrian Ioana.

math.MG↗
arXiv2021

Almost commuting matrices with respect to the rank metric

We show that if A_1, A_2, ... , A_n are square matrices, each of them is either unitary or self-adjoint, and they almost commute with respect to the rank metric, then one can find commuting matrices B_1, B_2, ... , B_n that are close to the matrices A_i in the rank metric.

math.RA↗
arXiv2016

Measurable circle squaring

Laczkovich proved that if bounded subsets $A$ and $B$ of $R^k$ have the same non-zero Lebesgue measure and the box dimension of the boundary of each set is less than $k$, then there is a partition of $A$ into finitely many parts that can be translated to form a partition of $B$. Here we show that it can be additionally required that each part is both Baire and Lebesgue measurable. As special cases, this gives measurable and translation-only versions of Tarski's circle squaring and Hilbert's third problem.

math.MG↗
arXiv2016

On computing homology gradients over finite fields

Recently the so-called Atiyah conjecture about l^2-Betti numbers has been disproved. The counterexamples were found using a specific method of computing the spectral measure of a matrix over a complex group ring. We show that in many situations the same method allows to compute homology gradients, i.e. generalizations of l^2-Betti numbers to fields of arbitrary characteristic. As an application we point out that (i) the homology gradient over any field of characteristic different than 2 can be an irrational number, and (ii) there exists a finite CW-complex with the property that the homology gradients of its universal cover taken over different fields have infinitely many different values.

math.GT↗
arXiv2015

Irrational l2-invariants arising from the lamplighter group

We show that the Novikov-Shubin invariant of an element of the integral group ring of the lamplighter group Z_2 \wr Z can be irrational. This disproves a conjecture of Lott and Lueck. Furthermore we show that every positive real number is equal to the Novikov-Shubin invariant of some element of the real group ring of Z_2 \wr Z. Finally we show that the l2-Betti number of a matrix over the integral group ring of the group Z_p \wr Z, p>1, can be irrational, and so the groups Z_p \wr Z become the simplest known groups which give rise to irrational l2-Betti numbers.

math.GR↗
arXiv2015

Group ring elements with large spectral density

Given an arbitrary d>0 we construct a group G and a group ring element S in Z[G] such that the spectral measure mu of S has the property that mu((0,eps)) > C/|log(eps)|^(1+d) for small eps. In particular the Novikov-Shubin invariant of any such S is 0. The constructed examples show that the best known upper bounds on mu((0,eps)) are not far from being optimal.

math.GR↗
arXiv2014

On Turing dynamical systems and the Atiyah problem

Main theorems of the article concern the problem of M. Atiyah on possible values of l^2-Betti numbers. It is shown that all non-negative real numbers are l^2-Betti numbers, and that "many" (for example all non-negative algebraic) real numbers are l^2-Betti numbers of simply connected manifolds with respect to a free cocompact action. Also an explicit example is constructed which leads to a simply connected manifold with a transcendental l^2-Betti number with respect to an action of the threefold direct product of the lamplighter group Z/2 wr Z. The main new idea is embedding Turing machines into integral group rings. The main tool developed generalizes known techniques of spectral computations for certain random walk operators to arbitrary operators in groupoid rings of discrete measured groupoids.

math.GR↗
arXiv2014

Vanishing of l^2-cohomology as a computational problem

We show that it is impossible to algorithmically decide if the l^2-cohomology of the universal cover of a finite CW complex is trivial, even if we only consider complexes whose fundamental group is equal to the elementary amenable group (Z_2 \wr Z)^3. A corollary of the proof is that there is no algorithm which decides if an element of the integral group ring of the group (\Z_2 \wr Z)^4 is a zero-divisor. On the other hand, we show, assuming some standard conjectures, that such an algorithm exists for the integral group ring of any group with a decidable word problem and a bound on the sizes of finite subgroups.

math.GR↗