Search Results for ""

The essential supremum is the proper generalization to measurable functions of the maximum. The technical difference is that the values of a function on a set of measure zero ...

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...

An exterior angle beta of a polygon is the angle formed externally between two adjacent sides. It is therefore equal to 2pi-alpha, where alpha is the corresponding internal ...

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...

A forgetful functor (also called underlying functor) is defined from a category of algebraic gadgets (groups, Abelian groups, modules, rings, vector spaces, etc.) to the ...

A set of algebraic invariants for a quantic such that any invariant of the quantic is expressible as a polynomial in members of the set. Gordan (1868) proved the existence of ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...

A algebraic loop L is a generalized Bol loop if for all elements x, y, and z of L, ((xy)z)alpha(y)=x((yz)alpha(y)) for some map alpha:L->L. As the name suggests, these are ...

A d-dimensional framework is a pair (G,p) where G=(V,E) is a graph with vertex set V and edge set E and p:V->R^d is a map that assigns a point in R^d to each vertex of G. The ...