Search Results for ""

Two partially ordered sets are said to be isomorphic if their "structures" are entirely analogous. Formally, partially ordered sets P=(X,<=) and Q=(X^',<=^') are isomorphic ...

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

800 The dual of the great rhombidodecahedron U_(73) and Wenninger dual W_(109).

The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...

z^p-y^p=(z-y)(z-zetay)...(z-zeta^(p-1)y), where zeta=e^(2pii/p) (a de Moivre number) and p is a prime.

A factorization of the form 2^(4n+2)+1=(2^(2n+1)-2^(n+1)+1)(2^(2n+1)+2^(n+1)+1). (1) The factorization for n=14 was discovered by Aurifeuille, and the general form was ...

Squarefree factorization is a first step in many factoring algorithms. It factors nonsquarefree polynomials in terms of squarefree factors that are relatively prime. It can ...

An ordered factorization is a factorization (not necessarily into prime factors) in which a×b is considered distinct from b×a. The following table lists the ordered ...