6 citations · 23 across the 15 of their papers we have counts for
16 papers
Nonsofic wreath products of residually finite groups
Gabor Kun, Andreas Thom
This work builds on the breakthrough of OpenAI in finding the first nonsofic group. We analyze the underlying proof mechanism and find further applications. Let be such that…
Posets are easily testable
Panna Tímea Fekete, Gábor Kun
Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either…
The uniform Gardner conjecture and rounding Borel flows
Matthew Bowen, Gábor Kun, Marcin Sabok
We study groups which satisfy Gardner's equidecomposition conjecture for uniformly distributed sets. We prove that an amenable group has this property if and only if it does not ad…
On pattern-avoiding permutons
Frederik Garbe, Jan Hladký, Gábor Kun +1
The theory of limits of permutations leads to limit objects called permutons, which are certain Borel measures on the unit square. We prove that permutons avoiding a given permutat…
The measurable Hall theorem fails for treeings
Gábor Kun
We construct, for every , a -regular acyclic measurably bipartite graphing that admits no measurable perfect matching, resolving a problem of Kechris and Marks. A dens…
Perfect matchings in hyperfinite graphings
Matthew Bowen, Gabor Kun, Marcin Sabok
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particular, we prove that every regular hyperfinite bipartite graphing admits a measurab…