Search Results for ""

A graph vertex in a graph is said to be an even node if its vertex degree is even.

The kth exterior power of an element alpha in an exterior algebra LambdaV is given by the wedge product of alpha with itself k times. Note that if alpha has odd degree, then ...

The ring of integers of a number field K, denoted O_K, is the set of algebraic integers in K, which is a ring of dimension d over Z, where d is the extension degree of K over ...

Let K be a number field of extension degree d over Q. Then an order O of K is a subring of the ring of integers of K with d generators over Z, including 1. The ring of ...

A graph vertex in a graph is said to be an odd node if its vertex degree is odd.

In an exterior algebra ^ V, a top-dimensional form has degree n where n=dimV. Any form of higher degree must be zero. For example, if V=R^4 then alpha=e_1 ^ e_2 ^ e_3 ^ e_4 ...

A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...

The modular equation of degree n gives an algebraic connection of the form (K^'(l))/(K(l))=n(K^'(k))/(K(k)) (1) between the transcendental complete elliptic integrals of the ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

The primitive part of a polynomial P(x) is P(x)/k, where k is the content. For a general univariate polynomial P(x), the Wolfram Language function FactorTermsList[poly, x] ...