SearcharxivSearch

arXiv · 2405.06825

Cluster Magnification, Root Capacity, Unique Chains and Base Change

Abstract

This article is inspired from the work of M Krithika and P Vanchinathan on Cluster Magnification and the work of Alexander Perlis on Cluster Size. We establish the existence of polynomials for given degree and cluster size over number fields which generalises a result of Perlis. We state the Strong cluster magnification problem and establish an equivalent criterion for that. We also discuss the notion of weak cluster magnification and prove some properties. We provide an important example answering a question about Cluster Towers. We introduce the concept of Root capacity and prove some of its properties. We also introduce the concept of unique descending and ascending chains for extensions and establish some properties and explicitly compute some interesting examples. We establish results about all these phenomena under a particular type of base change and discuss some other related results about strong cluster magnification and unique chains. The article concludes with results about ascending index for a field extension which are analogous to results about cluster size.

Explore related subjects

Keep this discovery

BibTeXRIS

Chandrasheel Bhagwat, Shubham Jaiswal. 2024-05-10. Cluster Magnification, Root Capacity, Unique Chains and Base Change. https://arxiv.org/abs/2405.06825

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