SearcharxivSearch

arXiv · 1307.6533

Universal commutator relations, Bogomolov multipliers, and commuting probability

Abstract

Let $G$ be a finite $p$-group. We prove that whenever the commuting probability of $G$ is greater than $(2p^2 + p - 2)/p^5$, the unramified Brauer group of the field of $G$-invariant functions is trivial. Equivalently, all relations between commutators in $G$ are consequences of some universal ones. The bound is best possible, and gives a global lower bound of $1/4$ for all finite groups. The result is attained by describing the structure of groups whose Bogomolov multipliers are nontrivial, and Bogomolov multipliers of all of their proper subgroups and quotients are trivial. Applications include a classification of $p$-groups of minimal order that have nontrivial Bogomolov multipliers and are of nilpotency class $2$, a nonprobabilistic criterion for the vanishing of the Bogomolov multiplier, and establishing a sequence of Bogomolov's absolute $γ$-minimal factors which are $2$-groups of arbitrarily large nilpotency class, thus providing counterexamples to some of Bogomolov's claims. In relation to this, we fill a gap in the proof of triviality of Bogomolov multipliers of finite simple groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Urban Jezernik, Primoz Moravec. 2013-12-17. Universal commutator relations, Bogomolov multipliers, and commuting probability. https://arxiv.org/abs/1307.6533

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