SearcharxivSearch

arXiv · 2303.06454

Discrete valuation rings, partitions and $p$-groups I

Abstract

A finite abelian $p$-group having an automorphism $x$ such that $1+\ldots+x^{p-1}=0$, can be viewed as a module over an appropriate discrete valuation ring $\mathcal{O}$ containing $\mathbb{Z}_p$ (the ring of $p$-adic integer). This yields the natural problem of comparing the invariants of $A$ as a $\mathbb{Z}_p$-module to its invariants as an $\mathcal{O}$-module. We solve the latter problem in a more general context, and give some applications to the structure of some $p$-groups and their automorphisms.

Explore related subjects

Keep this discovery

BibTeXRIS

Boubakeur Bahri, Yassine Guerboussa. 2023-03-11. Discrete valuation rings, partitions and $p$-groups I. https://arxiv.org/abs/2303.06454

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