nonnegative
81Jacobi polynomials — In mathematics, Jacobi polynomials are a class of orthogonal polynomials. They are obtained from hypergeometric series in cases where the series is in fact finite::P n^{(alpha,eta)}(z)=frac{(alpha+1) n}{n!}, 2F 1left(… …
82Farkas' lemma — is a result in mathematics stating that a vector is either in a given cone or that there exists a (hyper)plane separating the vector from the cone, but not both. It was originally proved by harvtxt|Farkas|1902. It is used amongst other things in… …
83Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… …
84Hamburger moment problem — In mathematics, the Hamburger moment problem, named after Hans Ludwig Hamburger, is formulated as follows: given a sequence { αn : n = 1, 2, 3, ... }, does there exist a positive Borel measure μ on the real line such that:alpha n = int {… …
85Convex cone — In linear algebra, a convex cone is a subset of a vector space over an ordered field that is closed under linear combinations with positive coefficients. A convex cone (light blue). Inside of it, the light red convex cone consists of all points… …
86Thom conjecture — In mathematics, a smooth algebraic curve C in the complex projective plane, of degree d, has genus given by the formula :g = (d 1)(d 2)/2. The Thom conjecture, named after the 20th century mathematician René Thom, states that if Sigma is any… …
87Operation (mathematics) — The general operation as explained on this page should not be confused with the more specific operators on vector spaces. For a notion in elementary mathematics, see arithmetic operation. In its simplest meaning in mathematics and logic, an… …
88Additive number theory — In mathematics, additive number theory is a branch of number theory that studies ways to express an integer as the sum of integers in a set. Two classical problem in this area of number theory are the Goldbach conjecture and Waring s problem.… …
89Semidefinite programming — (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function over the intersection of the cone of positive semidefinite matrices with an affine space.Semidefinite programming is a relatively new field… …
90Topological entropy — In mathematics, the topological entropy of a topological dynamical system is a nonnegative real number that measures the complexity of the system. Topological entropy was first introduced in 1965 by Adler, Konheim and McAndrew. Their definition… …
