Abstract
Polynomial factorization over a field is very useful in algebraic number theory, in extensions of valuations, etc. For valued field extensions, the determination of irreducible polynomials was the focus of interest of many authors. In 1850, Eisenstein gave one of the most popular criterion to decide on irreducibility of a polynomial over Q. A criterion which was generalized in 1906 by Dumas. In 2008, R. Brown gave what is known to be the most general version of Eisenstein-Schönemann irreducibility criterion. Thanks to MacLane theory, key polynomials play a key role to extend absolute values. In this chapter, we give a sufficient condition on any monic plynomial to be a key polynomial of an absolute value, an irreducibly criterion will be given, and for any simple algebraic extension L=Kα, we give a method to describe all absolute values of L extending ∣∣, where K is a discrete rank one valued field.
Highlights
Polynomial factorization over a field is very useful in algebraic number theory, for prime ideal factorization
The determination of irreducible polynomials was the focus of interest of many authors
Brown gave what is known to be the most general version of Eisenstein-Schönemann irreducibility criterion [9]. He showed for a valued field ðK, νÞ and for a monic polynomial f ðxÞ 1⁄4 φnðxÞ þ anÀ1ðxÞφnÀ1ðxÞ þ ... þ a0ðxÞ ∈ Rν1⁄2x, where Rν is a valuation ring of a discrete rank one valuation and φ being a monic polynomial in Rν1⁄2x whose reduction φ is irreducible over ν, aiðxÞ ∈ Rν1⁄2x, degðaiÞ < degðφÞ for every i 1⁄4 0, ... , n À 1, if νðaiÞ ≤ ð1 À i=nÞνða0Þ for every i 1⁄4 0, ... , n À 1 and gcdðνða0Þ, nÞ 1⁄4 1, f ðxÞ is irreducible over the field K
Summary
Polynomial factorization over a field is very useful in algebraic number theory, for prime ideal factorization It is important in extensions of valuations, etc. Brown gave what is known to be the most general version of Eisenstein-Schönemann irreducibility criterion [9]. He showed for a valued field ðK, νÞ and for a monic polynomial f ðxÞ 1⁄4 φnðxÞ þ anÀ1ðxÞφnÀ1ðxÞ þ ... Þ a0ðxÞ ∈ Rν1⁄2x, where Rν is a valuation ring of a discrete rank one valuation and φ being a monic polynomial in Rν1⁄2x whose reduction φ is irreducible over ν, aiðxÞ ∈ Rν1⁄2x, degðaiÞ < degðφÞ for every i 1⁄4 0, ...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.