PermutationIn mathematics, a permutation of a set is, loosely speaking, an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements. The word "permutation" also refers to the act or process of changing the linear order of an ordered set. Permutations differ from combinations, which are selections of some members of a set regardless of order. For example, written as tuples, there are six permutations of the set {1, 2, 3}, namely (1, 2, 3), (1, 3, 2), (2, 1, 3), (2, 3, 1), (3, 1, 2), and (3, 2, 1).
Primitive part and contentIn algebra, the content of a nonzero polynomial with integer coefficients (or, more generally, with coefficients in a unique factorization domain) is the greatest common divisor of its coefficients. The primitive part of such a polynomial is the quotient of the polynomial by its content. Thus a polynomial is the product of its primitive part and its content, and this factorization is unique up to the multiplication of the content by a unit of the ring of the coefficients (and the multiplication of the primitive part by the inverse of the unit).
Multiplicative groupIn mathematics and group theory, the term multiplicative group refers to one of the following concepts: the group under multiplication of the invertible elements of a field, ring, or other structure for which one of its operations is referred to as multiplication. In the case of a field F, the group is (F ∖ {0}, •), where 0 refers to the zero element of F and the binary operation • is the field multiplication, the algebraic torus GL(1).. The multiplicative group of integers modulo n is the group under multiplication of the invertible elements of .
Horner's methodIn mathematics and computer science, Horner's method (or Horner's scheme) is an algorithm for polynomial evaluation. Although named after William George Horner, this method is much older, as it has been attributed to Joseph-Louis Lagrange by Horner himself, and can be traced back many hundreds of years to Chinese and Persian mathematicians. After the introduction of computers, this algorithm became fundamental for computing efficiently with polynomials.
Indeterminate (variable)In mathematics, particularly in formal algebra, an indeterminate is a symbol that is treated as a variable, but does not stand for anything else except itself. It may be used as a placeholder in objects such as polynomials and formal power series. In particular: It does not designate a constant or a parameter of the problem. It is not an unknown that could be solved for. It is not a variable designating a function argument, or a variable being summed or integrated over. It is not any type of bound variable.
Lebesgue constantIn mathematics, the Lebesgue constants (depending on a set of nodes and of its size) give an idea of how good the interpolant of a function (at the given nodes) is in comparison with the best polynomial approximation of the function (the degree of the polynomials are fixed). The Lebesgue constant for polynomials of degree at most n and for the set of n + 1 nodes T is generally denoted by Λn(T ). These constants are named after Henri Lebesgue. We fix the interpolation nodes and an interval containing all the interpolation nodes.
Cycles and fixed pointsIn mathematics, the cycles of a permutation pi of a finite set S correspond bijectively to the orbits of the subgroup generated by pi acting on S. These orbits are subsets of S that can be written as , such that pi(ci) = ci + 1 for i = 1, ..., n − 1, and pi(cn) = c1. The corresponding cycle of pi is written as ( c1 c2 ... cn ); this expression is not unique since c1 can be chosen to be any element of the orbit. The size n of the orbit is called the length of the corresponding cycle; when n = 1, the single element in the orbit is called a fixed point of the permutation.
Symmetric functionIn mathematics, a function of variables is symmetric if its value is the same no matter the order of its arguments. For example, a function of two arguments is a symmetric function if and only if for all and such that and are in the domain of The most commonly encountered symmetric functions are polynomial functions, which are given by the symmetric polynomials. A related notion is alternating polynomials, which change sign under an interchange of variables.
Aurifeuillean factorizationIn number theory, an aurifeuillean factorization, named after Léon-François-Antoine Aurifeuille, is factorization of certain integer values of the cyclotomic polynomials. Because cyclotomic polynomials are irreducible polynomials over the integers, such a factorization cannot come from an algebraic factorization of the polynomial. Nevertheless, certain families of integers coming from cyclotomic polynomials have factorizations given by formulas applying to the whole family, as in the examples below.
Algebraic independenceIn abstract algebra, a subset of a field is algebraically independent over a subfield if the elements of do not satisfy any non-trivial polynomial equation with coefficients in . In particular, a one element set is algebraically independent over if and only if is transcendental over . In general, all the elements of an algebraically independent set over are by necessity transcendental over , and over all of the field extensions over generated by the remaining elements of .
