Algebraic curveIn mathematics, an affine algebraic plane curve is the zero set of a polynomial in two variables. A projective algebraic plane curve is the zero set in a projective plane of a homogeneous polynomial in three variables. An affine algebraic plane curve can be completed in a projective algebraic plane curve by homogenizing its defining polynomial. Conversely, a projective algebraic plane curve of homogeneous equation h(x, y, t) = 0 can be restricted to the affine algebraic plane curve of equation h(x, y, 1) = 0.
Linear combinationIn mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of x and y would be any expression of the form ax + by, where a and b are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field, with some generalizations given at the end of the article.
Field traceIn mathematics, the field trace is a particular function defined with respect to a finite field extension L/K, which is a K-linear map from L onto K. Let K be a field and L a finite extension (and hence an algebraic extension) of K. L can be viewed as a vector space over K. Multiplication by α, an element of L, is a K-linear transformation of this vector space into itself. The trace, TrL/K(α), is defined as the trace (in the linear algebra sense) of this linear transformation. For α in L, let σ_1(α), ...
Fixed-point subringIn algebra, the fixed-point subring of an automorphism f of a ring R is the subring of the fixed points of f, that is, More generally, if G is a group acting on R, then the subring of R is called the fixed subring or, more traditionally, the ring of invariants under G. If S is a set of automorphisms of R, the elements of R that are fixed by the elements of S form the ring of invariants under the group generated by S. In particular, the fixed-point subring of an automorphism f is the ring of invariants of the cyclic group generated by f.
Elementary algebraElementary algebra encompasses the basic concepts of algebra. It is often contrasted with arithmetic: arithmetic deals with specified numbers, whilst algebra introduces variables (quantities without fixed values). This use of variables entails use of algebraic notation and an understanding of the general rules of the operations introduced in arithmetic. Unlike abstract algebra, elementary algebra is not concerned with algebraic structures outside the realm of real and complex numbers.
Risch algorithmIn symbolic computation, the Risch algorithm is a method of indefinite integration used in some computer algebra systems to find antiderivatives. It is named after the American mathematician Robert Henry Risch, a specialist in computer algebra who developed it in 1968. The algorithm transforms the problem of integration into a problem in algebra. It is based on the form of the function being integrated and on methods for integrating rational functions, radicals, logarithms, and exponential functions.
Perfect fieldIn algebra, a field k is perfect if any one of the following equivalent conditions holds: Every irreducible polynomial over k has distinct roots. Every irreducible polynomial over k is separable. Every finite extension of k is separable. Every algebraic extension of k is separable. Either k has characteristic 0, or, when k has characteristic p > 0, every element of k is a pth power. Either k has characteristic 0, or, when k has characteristic p > 0, the Frobenius endomorphism x ↦ x^p is an automorphism of k.
Field with one elementIn mathematics, the field with one element is a suggestive name for an object that should behave similarly to a finite field with a single element, if such a field could exist. This object is denoted F1, or, in a French–English pun, Fun. The name "field with one element" and the notation F1 are only suggestive, as there is no field with one element in classical abstract algebra. Instead, F1 refers to the idea that there should be a way to replace sets and operations, the traditional building blocks for abstract algebra, with other, more flexible objects.
Algebraic cycleIn mathematics, an algebraic cycle on an algebraic variety V is a formal linear combination of subvarieties of V. These are the part of the algebraic topology of V that is directly accessible by algebraic methods. Understanding the algebraic cycles on a variety can give profound insights into the structure of the variety. The most trivial case is codimension zero cycles, which are linear combinations of the irreducible components of the variety. The first non-trivial case is of codimension one subvarieties, called divisors.
Factorization of polynomials over finite fieldsIn mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition is theoretically possible and is unique for polynomials with coefficients in any field, but rather strong restrictions on the field of the coefficients are needed to allow the computation of the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finite field, in the field of rationals or in a finitely generated field extension of one of them.
