Search Results for ""

Isomorphism is a very general concept that appears in several areas of mathematics. The word derives from the Greek iso, meaning "equal," and morphosis, meaning "to form" or ...

Let V(G) be the vertex set of a simple graph and E(G) its edge set. Then a graph isomorphism from a simple graph G to a simple graph H is a bijection f:V(G)->V(H) such that ...

A natural transformation Phi={Phi_C:F(C)->D(C)} between functors F,G:C->D of categories C and D is said to be a natural isomorphism if each of the components is an ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice isomorphism is a one-to-one and onto lattice homomorphism.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a meet-isomorphism provided that it preserves meets.

Let R be a ring. If phi:R->S is a ring homomorphism, then Ker(phi) is an ideal of R, phi(R) is a subring of S, and R/Ker(phi)=phi(R).

There exists no known P algorithm for graph isomorphism testing, although the problem has also not been shown to be NP-complete. In fact, the problem of identifying ...

The first group isomorphism theorem, also known as the fundamental homomorphism theorem, states that if phi:G->H is a group homomorphism, then Ker(phi)⊴G and ...

Let R be a ring, let A be a subring, and let B be an ideal of R. Then A+B={a+b:a in A,b in B} is a subring of R, A intersection B is an ideal of A and (A+B)/B=A/(A ...