A Study of monogenity of Binomial Composition
Abstract
Let θ be a root of a monic polynomial h(x) ∈ [x] of degree n ≥ 2. We say h(x) is monogenic if it is irreducible over and \ 1, θ, θ2, …, θn-1 \ is a basis for the ring K of integers of K = (θ). In this article, we study about the monogenity of number fields generated by a root of composition of two binomials. We characterise all the primes dividing the index of the subgroup [θ] in K where K = (θ) with θ having minimal polynomial F(x) = (xm-b)n - a ∈ [x], m≥ 1 and n ≥ 2. As an application, we provide a class of pairs of binomials f(x)=xn-a and g(x)=xm-b having the property that both f(x) and f(g(x)) are monogenic.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.