SearcharxivSearch

arXiv · 2411.03846

Transfinite hypercentral iterated wreath product of integral domains

Abstract

Starting with an integral domain $D$ of characteristic $0$, we consider a class of iterated wreath product $W_n$ of $n$ copies of $D$. In order that $W_n$ be transfinite hypercentral, it is necessary to restrict to the case of wreath products defined by way of numerical polynomials. We also associate to each of these groups a Lie ring, providing a correspondence preserving most of the structure. This construction generalizes a result of \cite{netreba} which characterizes the Lie algebras associated to the Sylow \(p\)-subgroups of the symmetric group \(\Sym(p^n)\). As an application, we explore the normalizer chain $\lbrace\mathbf{N}_{i}\rbrace_{i\geq -1}$ starting from the canonical regular abelian subgroup $T$ of $W_n$. Finally, we characterize the regular abelian normal subgroups of $\mathbf{N}_0$ that are isomorphic to $D^n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Riccardo Aragona, Norberto Gavioli, Giuseppe Nozzi. 2024-11-06. Transfinite hypercentral iterated wreath product of integral domains. https://doi.org/10.1007/s10231-025-01616-6

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