Searcharxiv⌕ Search

arXiv · 2610.05581

Uniquely Ergodic Branching Subset Currents on Free and Surface Groups

Abstract

\emph{Subset currents} on free groups, on surface groups and, more generally, on word-hyperbolic groups, were introduced by Kapovich and Nagnibeda, and further studied by Sasaki. Subset currents extend ordinary geodesic currents and provide measure-theoretic generalizations of conjugacy classes of infinite quasiconvex subgroups. Their supports can be viewed as ``branching laminations". For free groups and surface groups, we construct non-rational subset currents with genuinely branching supports that carry no other subset currents except scalar multiples. For every nonabelian finite rank free group and every closed hyperbolic surface group, we show that such a current can be chosen so that its support is uncountable, is disjoint from the locus of two-point boundary subsets, and consists entirely of Cantor subsets of the boundary. More generally, we prove that every nonempty metrizable Choquet simplex occurs as a compact convex base for the cone of currents carried by a minimal genuinely branching subset lamination. The same universality phenomenon extends, apart from the usual rational-current terminology, to every non-elementary torsion-free hyperbolic group. We also study finite-pattern complexity. We prove that if $R_L(n)$ counts the allowed \emph{round patterns} of radius $n$ in a minimal subset lamination $L$, then $R_L(n)=O(n)$ forces the carried-current cone to be finite-dimensional, while infinite-dimensionality forces $R_L(n)/n\to\infty$; this universal threshold is sharp. We show that the coarse growth type of $R_L$ is independent of the chosen free basis and, more generally, of the chosen finite marked graph. We also show that a refined switch system recovers the exact dimension of the carried-current cone.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ilya Kapovich. 2026-10-04. Uniquely Ergodic Branching Subset Currents on Free and Surface Groups. https://arxiv.org/abs/2610.05581

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Unsolved Problems in Group Theory. The Kourovka Notebook

This is a collection of open problems in group theory proposed by hundreds of mathematicians from all over the world. It has been published every 2--4 years since 1965. This is the 21st edition, which contains 150 new problems and a number of comments on problems from the previous editions.

math.GR↗

On embeddings of the difference graph of the intersection power graph and the power graph

The power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices are adjacent if one is a power of the other. The intersection power graph of a finite group $G$ is a simple undirected graph with vertex set $G$ and two vertices $x$, $y$ are adjacent if $\langle x\rangle \cap \langle y \rangle \neq \{e\}$. The difference graph $\mathcal{D}(G)$ of a finite group $G$ is the difference of the intersection power graph $\mathcal{G}_{1}(G)$ and power graph $\mathcal{P}(G)$ with all isolated vertices removed. We characterized all the finite nilpotent groups $G$ such that the difference graph is planar. Further, we determine all the finite nilpotent groups whose difference graph has genus at most $2$. Moreover, we prove that there does not exist any group whose difference graph is projective planar.

math.GR↗

Soficity of One-Relator Groups and Reducible Presentations

We prove that every one-relator group is sofic, answering a question of Nate Brown. More generally, every group admitting a reducible presentation without proper powers is sofic, with one proper-power relation allowed at the final reducible step. The proof starts from the endpoint-preserving edge replacements of Poulin--Wróbel. We retain the free-group word carried by each terminal replacement and use it to define an \(F(S)\)-valued cocycle repair; in its relative form, the repair preserves the previously chosen generator coordinates while controlling the new relator defect. Coinduction transports the lower cocycle through successive one-relator-product extensions, allowing the construction to be iterated along reducible presentations. For a final relator \(w^m\), cyclic translates of the repaired set amplify a zero-defect set of measure close to \(1/m\) to one of measure close to one. A cocycle criterion then converts arbitrarily small relator defect into finite permutation approximations via a treeable skew-product orbit relation.

math.GR↗