SearcharxivSearch

arXiv · 2108.10956

Gaussian Binomial Coefficients in Group Theory, Field Theory, and Topology

Abstract

In this article, we offer group-theoretic, field-theoretic, and topological interpretations of the Gaussian binomial coefficients and their sum. For a finite $p$-group $G$ of rank $n$, we show that the Gaussian binomial coefficient $\binom{n}{k}_p$ is the number of subgroups of $G$ that are minimally expressible as an intersection of $n - k$ maximal subgroups of $G$, and their sum is precisely the number of subgroups that are either $G$ or an intersection of maximal subgroups of $G$. We provide a field-theoretic interpretation of these quantities through the lens of Galois theory and a topological interpretation involving covering spaces

Explore related subjects

Keep this discovery

BibTeXRIS

Sunil K. Chebolu, Keir Lockridge. 2021-08-24. Gaussian Binomial Coefficients in Group Theory, Field Theory, and Topology. https://arxiv.org/abs/2108.10956

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