SearcharxivSearch

arXiv · 2404.00745

Directed graphs, Frattini-resistance, and maximal pro-$p$ Galois groups

Abstract

Let $p$ be a prime. Following Snopce-Tanushevski, a pro-$p$ group $G$ is called Frattini-resistant if the function $H\mapsto\Phi(H)$, from the poset of all closed finitely-generated subgroups of $G$ into itself, is a poset embedding. We prove that for an oriented right-angled Artin pro-$p$ group (oriented pro-$p$ RAAG) $G$ associated to a directed graph the following four conditions are equivalent: the associated directed graph is of elementary type; $G$ is Frattini-resistant; every topologically finitely generated closed subgroup of $G$ is an oriented pro-$p$ RAAG; $G$ is the maximal pro-$p$ Galois group of a field containing a root of 1 of order $p$. Also, we conjecture that in the $\mathbb{Z}/p$-cohomology of a Frattini-resistant pro-$p$ group there are no essential triple Massey products.

Explore related subjects

Keep this discovery

BibTeXRIS

Claudio Quadrelli. 2024-03-31. Directed graphs, Frattini-resistance, and maximal pro-$p$ Galois groups. https://doi.org/10.1016/j.jpaa.2024.107857

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