Searcharxiv⌕ Search

arXiv · 2611.20262

A counterexample to the subgraphings approximate the cost problem

Abstract

We prove that for every $k\ge 2$, the free group $\mathbb{F}_k$ on $k$ generators admits a finite generating set $S$ such that the Schreier graphing of the Bernoulli action of $\mathbb{F}_k$ with respect to $S$ does not admit spanning subgraphings that would approximate the cost of the action. In particular, this gives an example of a graphing that spans a treeable countable pmp equivalence relation, but does not admit a spanning subtreeing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Balázs Bursics, Jan Grebík, Zoltán Vidnyánszky. 2026-11-15. A counterexample to the subgraphings approximate the cost problem. https://searcharxiv.com/abs/2611.20262

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗