field theory, a branch of mathematics, the minimal polynomial of an element α of an extension field of a field is, roughly speaking, the polynomial of...
10 KB (1,451 words) - 07:22, 28 May 2025
Minimal polynomial can mean: Minimal polynomial (field theory) Minimal polynomial (linear algebra) This disambiguation page lists mathematics articles...
129 bytes (44 words) - 18:20, 6 March 2025
Minimum polynomial can refer to: Minimal polynomial (field theory) Minimal polynomial (linear algebra) This disambiguation page lists articles associated...
131 bytes (45 words) - 15:26, 28 July 2022
In finite field theory, a branch of mathematics, a primitive polynomial is the minimal polynomial of a primitive element of the finite field GF(pm). This...
10 KB (1,353 words) - 03:41, 19 July 2025
particular field theory, the conjugate elements or algebraic conjugates of an algebraic element α, over a field extension L/K, are the roots of the minimal polynomial...
4 KB (542 words) - 05:15, 23 June 2025
linear algebra, the minimal polynomial μA of an n × n {\displaystyle n\times n} matrix A over a field F is the monic polynomial P over F of least degree...
11 KB (1,546 words) - 20:43, 13 July 2025
mathematics, especially in the field of algebra, a polynomial ring or polynomial algebra is a ring formed from the set of polynomials in one or more indeterminates...
54 KB (8,657 words) - 19:01, 29 July 2025
complex numbers. Field extensions are fundamental in algebraic number theory, and in the study of polynomial roots through Galois theory, and are widely...
20 KB (3,321 words) - 22:16, 2 June 2025
Time complexity (redirect from Polynomial time)
deterministic polynomial-time algorithm exists belong to the complexity class P, which is central in the field of computational complexity theory. Cobham's...
41 KB (4,997 words) - 07:38, 21 July 2025
the minimal polynomial of every element of E over F is a separable polynomial, that is, has distinct roots. Galois extension A normal, separable field extension...
16 KB (2,063 words) - 21:47, 28 October 2023
In number theory, the real parts of the roots of unity are related to one-another by means of the minimal polynomial of 2 cos ( 2 π / n ) . {\displaystyle...
10 KB (2,522 words) - 23:53, 31 March 2025
place of polynomials.) In the case of RCF, the definable sets are the semialgebraic sets. Thus the study of o-minimal structures and theories generalises...
11 KB (1,294 words) - 11:18, 24 June 2025
derivative of polynomials forms a differential field. These fields are central to differential Galois theory, a variant of Galois theory dealing with linear...
86 KB (10,330 words) - 20:24, 2 July 2025
characteristic polynomial to zero. In spectral graph theory, the characteristic polynomial of a graph is the characteristic polynomial of its adjacency...
19 KB (3,050 words) - 23:34, 28 July 2025
Gröbner basis (redirect from Minimal Gröbner basis)
generating set of an ideal in a polynomial ring K [ x 1 , … , x n ] {\displaystyle K[x_{1},\ldots ,x_{n}]} over a field K {\displaystyle K} . A Gröbner...
63 KB (10,037 words) - 09:29, 30 July 2025
indeterminates, the generic polynomial of degree two in x is a x 2 + b x + c . {\displaystyle ax^{2}+bx+c.} However in Galois theory, a branch of algebra, and...
4 KB (560 words) - 15:00, 14 February 2024
of GF(7). The minimal polynomial of a primitive element is a primitive polynomial. The number of primitive elements in a finite field GF(q) is φ(q −...
3 KB (262 words) - 18:49, 23 January 2024
Ring of integers (category Ring theory)
the p-adic numbers Q p {\displaystyle \mathbb {Q} _{p}} . Minimal polynomial (field theory) Integral closure – gives a technique for computing integral...
8 KB (1,132 words) - 21:12, 27 June 2025
List of unsolved problems in computer science (redirect from Unsolved problems in information theory)
automata? Determine whether the length of the minimal uncompletable word of M {\displaystyle M} is polynomial in l ( M ) {\displaystyle l(M)} , or even in...
11 KB (1,199 words) - 11:45, 22 July 2025
be convenient for Galois theory, is no longer in use. Separable polynomials are used to define separable extensions: A field extension K ⊂ L is a separable...
6 KB (779 words) - 03:48, 19 May 2025
In mathematics, the Conway polynomial Cp,n for the finite field Fpn is a particular irreducible polynomial of degree n over Fp that can be used to define...
18 KB (1,777 words) - 21:05, 14 April 2025
In mathematics, exponential polynomials are functions on fields, rings, or abelian groups that take the form of polynomials in a variable and an exponential...
5 KB (615 words) - 21:48, 26 August 2024
Galois group (category Galois theory)
extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois...
18 KB (3,238 words) - 16:44, 30 July 2025
mathematics, a field F is algebraically closed if every non-constant polynomial with coefficients in F has a root in F. In other words, a field is algebraically...
14 KB (1,879 words) - 17:19, 22 July 2025
F} by adjoining a single element whose minimal polynomial is separable. To use a piece of jargon, finite fields are perfect. A more general algebraic structure...
46 KB (7,582 words) - 11:45, 24 July 2025
In mathematics, a polynomial is a mathematical expression consisting of indeterminates (also called variables) and coefficients, that involves only the...
60 KB (8,173 words) - 14:51, 27 July 2025
"extremal" polynomials for many other properties. In 1952, Cornelius Lanczos showed that the Chebyshev polynomials are important in approximation theory for...
58 KB (11,027 words) - 03:58, 3 August 2025
Transcendental number theory is a branch of number theory that investigates transcendental numbers (numbers that are not solutions of any polynomial equation with...
29 KB (3,907 words) - 01:54, 18 February 2025
polynomials over a field the polynomial GCD may be computed, like for the integer GCD, by the Euclidean algorithm using long division. The polynomial...
52 KB (7,886 words) - 23:12, 24 May 2025
Separable extension (redirect from Separable field extension)
, the minimal polynomial of α {\displaystyle \alpha } over F is a separable polynomial (i.e., its formal derivative is not the zero polynomial, or equivalently...
21 KB (3,075 words) - 06:19, 18 March 2025