Search Results for ""

Relations in the definition of a Steenrod algebra which state that, for i<2j, Sq^i degreesSq^j(x)=sum_(k=0)^(|_i/2_|)(j-k-1; i-2k)Sq^(i+j-k) degreesSq^k(x), where f degreesg ...

The set E of edges of a loopless graph (V,E), being a set of unordered pairs of elements of V, constitutes an adjacency relation on V. Formally, an adjacency relation is any ...

Given an acute angle in a right triangle, the adjacent side is the leg of the triangle from which the angle to the hypotenuse is measured. Lengths of adjacent and opposite ...

The value nearest to but still inside an inner fence.

In a graph G, two graph vertices are adjacent if they are joined by a graph edge.

A curve which has at least multiplicity r_i-1 at each point where a given curve (having only ordinary singular points and cusps) has a multiplicity r_i is called the adjoint ...

Every finite-dimensional Lie algebra of characteristic p=0 has a faithful finite-dimensional representation.

"Aggregate" is an archaic word for infinite sets such as those considered by Georg Cantor. The term is sometimes also used to refer to a finite or infinite set in which ...

The Riemann's moduli space gives the solution to Riemann's moduli problem, which requires an analytic parameterization of the compact Riemann surfaces in a fixed ...

A map projection. The inverse equations for phi are computed by iteration. Let the angle of the projection plane be theta_b. Define a={0 for theta_b=1/2pi; ...