Search Results for ""

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

A closed curve associated with a knot which is displaced along the normal by a small amount. For a knot K parameterized as x^mu(s) for 0<=s<=L along the length of the knot by ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

A cusp is a point at which two branches of a curve meet such that the tangents of each branch are equal. The above plot shows the semicubical parabola curve x^3-y^2=0, which ...

The central point (r=0) in polar coordinates, or the point with all zero coordinates (0, ..., 0) in Cartesian coordinates. In three dimensions, the x-axis, y-axis, and z-axis ...

Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...

A submodule N of a module M that is not the intersection of two submodules of M in which it is properly contained. In other words, for all submodules N_1 and N_2 of M, N=N_1 ...

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a polarity of L if and only if f is a decreasing join-endomorphism and g is an increasing ...