Search Results for ""

Let G be a group having normal subgroups H and K with H subset= K. Then K/H⊴G/H and (G/H)/(K/H)=G/K, where N⊴G indicates that N is a normal subgroup of G and G=H indicates ...

Let P be the set of primes, and let Q_p and Z_p(t) be the fields of p-adic numbers and formal power series over Z_p=(0,1,...,p-1). Further, suppose that D is a "nonprincipal ...

If two intersections of each pair of three conics S_1, S_2, and S_3 lie on a conic S_0, then the lines joining the other two intersections of each pair are concurrent (Evelyn ...

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.

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

In general, polynomial equations higher than fourth degree are incapable of algebraic solution in terms of a finite number of additions, subtractions, multiplications, ...