
	Where results make sense

Topic: Digraph morphism

	Morphism Definition / Morphism Research (Site not responding. Last check: 2007-11-03)
		In mathematics, a morphism is an abstraction of a function or mapping between two spaces.
		morphism is a labeled, directed connection from one object to another, like a directed arc in a digraph.
		morphism is a function which is a monoid morphism for both the additive and multiplicative structures.
	www.elresearch.com /Morphism (492 words)

	Kernel (mathematics) - Wikipedia, the free encyclopedia
		In categories with zero morphisms one can define the kernel of a morphism f as the equalizer of f and the parallel zero morphism.
		A kernel pair is a categorical notion which is more closely related to the notion of a congruence relation in algebra.
		The kernel pair of a morphism f is defined as a pullback of f with itself.
	en.wikipedia.org /wiki/Kernel_(mathematics) (507 words)

	Objects and Morphisms
		The word morphism is derived from the concept of a homomorphism, a group homomorphism or a ring homomorphism or a module homomorphism etc. Yet a morphism is much more general.
		The morphism is completely described by the function on the underlying set, hence the identity map on a set has to be the identity morphism on the corresponding object, and a bijection between sets is usually an equivalence, provided the function and its inverse follow the rules for a morphism in the category.
		The source and target of a morphism m are s(m) and t(m) respectively, and again, s(m) and t(m) are always identity morphisms.
	www.mathreference.com /cat,def.html (1303 words)

	Commutative Diagrams
		Within the context of a category, a diagram is a digraph with objects as vertices and morphisms as edges.
		If a cycle starts and ends at v, the composition of those morphisms has to produce the morphism on v, which is the identity map.
		The composition is the identity map, the morphisms are inverses, and the points are equivalent.
	www.mathreference.com /cat,cdiag.html (514 words)

	Category theory, or its equivalent. (Site not responding. Last check: 2007-11-03)
		It is arguable that analysis should have applied to the hom-sets rather than to the morphisms themselves.
		The analysis then moved on to considering a category's composition as a constrained binary operator - it only combines things if they are suitably linked in the directed graphs; and the composite fits into the directed graph as a substitute for its components.
		Having now explored what the relevant digraph theory reduces to when expressed in terms of relations, I no longer consider it worth discussing separately from the composition.
	www.chaos.org.uk /~eddy/maths/gory (391 words)

	MATHS: Category Theory
		Any commutative diagram can be taken as a template or pattern for a set of objects in a new category and then morphisms between diagrams defined as lists of morphisms between corresponding nodes in the diagrams.
		The type of all Subsets (@T) of a given type(T) of element equipped with all mappings between subsets as morphisms is a category.
		A pushout is a kind of loose co-product: a pair of objects have a push out which has a an overlap allowed on a third object.
	www.csci.csusb.edu /dick/maths/math_25_Categories.html (3607 words)

	AMCA: Invariants for Approximately Finitely Acting Operator Algebras by Stephen Power (Site not responding. Last check: 2007-11-03)
		This approach is proving succesful for certain limits of cycle algebras, where the augmentation is by a partial isometry homology group H
		(Joint work with Allan Donsig.) Another augmentation which is effective for limits of digraph algebras which are ``nearly" self-adjoint comes via ``enlarged" Bratteli diagrams whose nodes correspond to digraph edges (rather than vertices) of the reduced digraph of the building block subalgebras.
		Moreover if the morphisms defining A are constrained one may similarly restrict morphisms to define the appropriate metrized abelian semigroup of morphism classes.
	at.yorku.ca /c/a/c/w/20.htm (261 words)

	digraph - OneLook Dictionary Search
		digraph : Compact Oxford English Dictionary [home, info]
		Digraph : Online Plain Text English Dictionary [home, info]
		Phrases that include digraph: digraph morphism, digraph sink, digraph topology, st digraph, strongly connected digraph, more...
	www.onelook.com /cgi-bin/cgiwrap/bware/dofind.cgi?word=digraph (225 words)

	Physics Help and Math Help - Physics Forums - View Single Post - mathematical structure
		FE ==> FV define finite digraphs, and every finite digraph can be obtained this way!
		and the morphism Fhead assigns to each e in FE the vertex which e enters,
		OK, so there are close interrelationships between graphs, digraphs and
	www.physicsforums.com /showpost.php?p=366706&postcount=5 (1360 words)

	Index M (Site not responding. Last check: 2007-11-03)
		Matrices and Vector Spaces Associated with a Graph or Digraph (GRAPHS)
		Matrix Group Actions on Polynomials (INVARIANT RINGS OF FINITE GROUPS)
		Morphism(E, F, psi, phi, omega) : CurveEll, CurveEll, RngMPolElt, RngMPolElt, RngMPolElt -> Map
	www.math.wisc.edu /help/magma/indM.html (754 words)

Try your search on: Qwika (all wikis)