SearcharxivSearch

arXiv · 1904.00471

The M\"obius function of ${\rm PSL}(3,2^p)$ for any prime $p$

Abstract

Let $G$ be the simple group ${\rm PSL}(3,2^p)$, where $p$ is a prime number. For any subgroup $H$ of $G$, we compute the M\"obius function of $H$ in the subgroup lattice of $G$. To this aim, we describe the intersections of maximal subgroups of $G$. We point out some connections of the M\"obius function with other combinatorial objects, and, in this context, we compute the reduced Euler characteristic of the order complex of the subposet of $r$-subgroups of ${\rm PGL}(3,q)$, for any prime $r$ and any prime power $q$.

Explore related subjects

Keep this discovery

BibTeXRIS

Martino Borello, Francesca Dalla Volta, Giovanni Zini. 2019-03-31. The M\"obius function of ${\rm PSL}(3,2^p)$ for any prime $p$. https://arxiv.org/abs/1904.00471

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