Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Concept

Irreducible polynomial

In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field to which the coefficients of the polynomial and its possible factors are supposed to belong. For example, the polynomial x2 − 2 is a polynomial with integer coefficients, but, as every integer is also a real number, it is also a polynomial with real coefficients. It is irreducible if it is considered as a polynomial with integer coefficients, but it factors as if it is considered as a polynomial with real coefficients. One says that the polynomial x2 − 2 is irreducible over the integers but not over the reals. Polynomial irreducibility can be considered for polynomials with coefficients in an integral domain, and there are two common definitions. Most often, a polynomial over an integral domain R is said to be irreducible if it is not the product of two polynomials that have their coefficients in R, and that are not unit in R. Equivalently, for this definition, an irreducible polynomial is an irreducible element in the rings of polynomials over R. If R is a field, the two definitions of irreducibility are equivalent. For the second definition, a polynomial is irreducible if it cannot be factored into polynomials with coefficients in the same domain that both have a positive degree. Equivalently, a polynomial is irreducible if it is irreducible over the field of fractions of the integral domain. For example, the polynomial is irreducible for the second definition, and not for the first one. On the other hand, is irreducible in for the two definitions, while it is reducible in A polynomial that is irreducible over any field containing the coefficients is absolutely irreducible. By the fundamental theorem of algebra, a univariate polynomial is absolutely irreducible if and only if its degree is one.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (5)

Related people (3)

Related concepts (68)

Related courses (21)

Related lectures (202)

Related MOOCs (9)

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 1)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

Algebra (part 2)

Un MOOC francophone d'algèbre linéaire accessible à tous, enseigné de manière rigoureuse et ne nécessitant aucun prérequis.

MATH-334: Representation theory

Study the basics of representation theory of groups and associative algebras.

MATH-310: Algebra

Study basic concepts of modern algebra: groups, rings, fields.

MATH-643: Applied l-adic cohomology

In this course we will describe in numerous examples how methods from l-adic cohomology as developed by Grothendieck, Deligne and Katz can interact with methods from analytic number theory (prime numb

Polynomial ring

In mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring (which is also a commutative algebra) formed from the set of polynomials in one or more indeterminates (traditionally also called variables) with coefficients in another ring, often a field. Often, the term "polynomial ring" refers implicitly to the special case of a polynomial ring in one indeterminate over a field. The importance of such polynomial rings relies on the high number of properties that they have in common with the ring of the integers.

Fundamental theorem of algebra

The fundamental theorem of algebra, also known as d'Alembert's theorem, or the d'Alembert–Gauss theorem, states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with its imaginary part equal to zero. Equivalently (by definition), the theorem states that the field of complex numbers is algebraically closed.

Irreducible polynomial

Jordan blocks of unipotent elements in some irreducible representations of classical groups in good characteristic

Mikko Tapani Korhonen

Let

G

be a classical group with natural module

V

over an algebraically closed field of good characteristic. For every unipotent element

u

G

, we describe the Jordan block sizes of

u

2019

Reductive overgroups of distinguished unipotent elements in simple algebraic groups

Mikko Tapani Korhonen

Let

G

be a simple linear algebraic group over an algebraically closed field

K

of characteristic

p \geq 0

. In this thesis, we investigate closed connected reductive subgroups

X < G

that contain

EPFL2018

Invariant forms on irreducible modules of simple algebraic groups

Mikko Tapani Korhonen

Let G be a simple linear algebraic group over an algebraically dosed field K of characteristic p >= 0 and let V be an irreducible rational G-module with highest weight A. When is self-dual, a basic qu

Elsevier2017

Generalized Integrals: Elementary Cases MATH-101(c): Analysis I

Explores elementary cases of generalized integrals, convergence criteria, and the interpretation of integrals of type i and ii.

Weyl character formula MATH-680: Monstrous moonshine

Explores the proof of the Weyl character formula for finite-dimensional representations of semisimple Lie algebras.

Kirillov Paradigm for Heisenberg Group

Explores the Kirillov paradigm for the Heisenberg group and unitary representations.