SearcharxivSearch

arXiv · 2602.01318

Non-stability of Liouville measures under convex combinations

Abstract

For every non-hyper-FC-central countable amenable group and every $k\geq 2$, we provide a sequence of symmetric, fully supported probability measures such that their convex combination is non-Liouville (that is it admits a non-constant bounded harmonic function, equivalently, the Poisson boundary is non-trivial) if and only if at least $k$ of them appear in the convex combination. Particularly, our result implies that the set of Liouville measures is not closed under convex combination, which answers a question of Kaimanovich. We also provide a similar result under the additional assumption of finite entropy for those non-hyper-FC-central countable groups with the property that every symmetric, finitely supported probability measure is Liouville. These groups are the only known non-trivial examples of countable groups that admit Liouville measures with finite entropy. Examples include the lamplighter group over $\mathbb{Z}$ and $\mathbb{Z}^2$, and the infinite symmetric group of finite permutations on $\mathbb{Z}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Behrang Forghani, Joshua Frisch. 2026-02-01. Non-stability of Liouville measures under convex combinations. https://arxiv.org/abs/2602.01318

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

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR