Search Results for ""

A minimal surface that contains lemniscates as geodesics which is given by the parametric equations x = R[sqrt(2)cos(1/3zeta)sqrt(cos(2/3zeta))] (1) y = ...

The distance between two skew lines with equations x = x_1+(x_2-x_1)s (1) x = x_3+(x_4-x_3)t (2) is given by D=(|(x_3-x_1)·[(x_2-x_1)x(x_4-x_3)]|)/(|(x_2-x_1)x(x_4-x_3)|) (3) ...

The Livingstone graph is a distance-transitive graph on 266 vertices defined in terms of the Janko group J_1. It has intersection array {11,10,6,1;1,1,5,11}. The Livingstone ...

A graph Gamma is locally Petersen if, for each point t of Gamma, the graph induced by Gamma on all points adjacent to t (i.e., the neighborhood graph) is isomorphic to the ...

A point x^* which is mapped to itself under a map G, so that x^*=G(x^*). Such points are sometimes also called invariant points or fixed elements (Woods 1961). Stable fixed ...

The mid-arc triangle is the triangle DeltaA^'B^'C^' whose vertices consist of the intersections of the internal angle bisectors with the incircle, where the points of ...

Let five circles with concyclic centers be drawn such that each intersects its neighbors in two points, with one of these intersections lying itself on the circle of centers. ...

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

NAND, also known as the Sheffer stroke, is a connective in logic equivalent to the composition NOT AND that yields true if any condition is false, and false if all conditions ...

A predicate in logic equivalent to the composition NOT OR that yields false if any condition is true, and true if all conditions are false. A NOR B is equivalent to !(A v B), ...