TOPICS
Search

Search Results for ""


1231 - 1240 of 2033 for Clebsch graphSearch Results
A map T:(M_1,omega_1)->(M_2,omega_2) between the symplectic manifolds (M_1,omega_1) and (M_2,omega_2) which is a diffeomorphism and T^*(omega_2)=omega_1, where T^* is the ...
In an exterior algebra ^ V, a top-dimensional form has degree n where n=dimV. Any form of higher degree must be zero. For example, if V=R^4 then alpha=e_1 ^ e_2 ^ e_3 ^ e_4 ...
The topological entropy of a map M is defined as h_T(M)=sup_({W_i})h(M,{W_i}), where {W_i} is a partition of a bounded region W containing a probability measure which is ...
A pair of zips, each zip being half a zipper, which can be zippered up to close a surface along a curve. The concept of a zip-pair can be extremely useful in topological ...
One would think that by analogy with the matching-generating polynomial, independence polynomial, etc., a cycle polynomial whose coefficients are the numbers of cycles of ...
LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...
The Loupekine snarks are the two snarks on 22 vertices and 33 edges illustrated above. They are implemented in the Wolfram Language as GraphData["LoupekineSnark1"] and ...
The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...
A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...
The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.
1 ... 121|122|123|124|125|126|127 ... 204 Previous Next

...