Search Results for ""

The number of outward directed graph edges from a given graph vertex in a directed graph.

An inner automorphism of a group G is an automorphism of the form phi(g)=h^(-1)gh, where h is a fixed element of G. An outer automorphism of G is an automorphism which cannot ...

A particular type of automorphism group which exists only for groups. For a group G, the outer automorphism group is the quotient group Aut(G)/Inn(G), which is the ...

A popular acronym for "principal ideal domain." In engineering circles, the acronym PID refers to the "proportional-integral-derivative method" algorithm for controlling ...

Given an amicable pair (m,n), the quantity sigma(m) = sigma(n) (1) = =s(m)+s(n) (2) = m+n (3) is called the pair sum, where sigma(n) is the divisor function and s(n) is the ...

The paper folding constant is the constant given by P = sum_(k=0)^(infty)1/(2^(2^k))(1-1/(2^(2^(k+2))))^(-1) (1) = sum_(k=0)^(infty)(8^(2^k))/(2^(2^(k+2))-1) (2) = ...

The nth partial denominator in a generalized continued fraction b_0+K_(n=1)^infty(a_n)/(b_n) or simple continued fraction b_0+K_(n=1)^infty1/(b_n) is the expression b_n. For ...

The nth partial numerator in a generalized continued fraction b_0+K_(n=1)^infty(a_n)/(b_n) is the expression a_n. For a simple continued fraction b_0+K_(n=1)^infty1/(b_n), ...

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...

For a partial order, the size of the longest chain is called the length.