Search Results for ""
5101 - 5110 of 13135 for binary numberSearch Results

An additive category is a category for which the morphism sets have the structure of Abelian groups. It satisfies some, but not all the properties of an Abelian category.
The identity element of an additive group G, usually denoted 0. In the additive group of vectors, the additive identity is the zero vector 0, in the additive group of ...
In an additive group G, the additive inverse of an element a is the element a^' such that a+a^'=a^'+a=0, where 0 is the additive identity of G. Usually, the additive inverse ...
The restricted topological group direct product of the group G_(k_nu) with distinct invariant open subgroups G_(0_nu).
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 ...

...