On Root Capacity, Intersection Indicium, Minimal Generating Sets of Galois Closure & Compositum Feasible Triplets
Shubham Jaiswal

TL;DR
This paper advances the theory of root clusters and related notions in field extensions, providing new results on minimal generating sets, compositum feasibility, and inverse problems over number fields using Galois theory.
Contribution
It introduces new concepts like root capacity and intersection indicium, and generalizes existing results on minimal generating sets and compositum feasibility over number fields.
Findings
Established that certain triplets are compositum feasible over any number field.
Proved the existence of arbitrarily large families of non-isomorphic extensions with specified properties.
Generalized a result of Drungilas et al. and proved a partial case of their conjecture.
Abstract
We carry on the work started by the author and Bhagwat and develop the theory of root clusters further in this article and also resolve certain problems in related areas. We introduce some new notions as well as recall earlier notions for field extensions over a perfect base field: root cluster size, its generalization root capacity, its dual notion ascending index and its generalization intersection indicium. We establish our results on the Inverse problems for these generalized notions over number fields which generalizes our earlier results. We give a field theoretic formulation for the concept of minimal generating sets of splitting fields which was introduced by the author and Vanchinathan. We present new results as well as generalizations of our earlier results on the cardinalities of minimal generating sets for extensions over number fields. We generalize a result of Drungilas et…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
