Search Results for ""

Let k be a field of finite characteristic p. Then a polynomial P(x) in k[x] is said to be additive iff P(a)+P(b)=P(a+b) for {a,b,a+b} subset k. For example, P(x)=x^2+x+4 is ...

A mathematical object S is said to be additively closed if a,b in S implies that a+b in S.

An element of an adèle group, sometimes called a repartition in older literature (e.g., Chevalley 1951, p. 25). Adèles arise in both number fields and function fields. The ...

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 ...

A class of knots containing the class of alternating knots. Let c(K) be the link crossing number. Then for knot sum K_1#K_2 which is an adequate knot, ...

A property of motion which is conserved to exponential accuracy in the small parameter representing the typical rate of change of the gross properties of the body.

The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

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 ...