Search Results for ""

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

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 vector field X on a compact foliated manifold (M,F) is nice if X is transverse to F and if X has a closed orbit C (called a nice orbit) such that the intersection C ...

Given a triangle DeltaABC, construct the contact triangle DeltaDEF. Then the Nobbs points are the intersections of the corresponding sides of triangles DeltaABC and DeltaDEF, ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

An orthodiagonal quadrangle is a quadrangle whose diagonals are perpendicular to each other. If a, b, c, and d are the sides of a quadrangle, then this quadrangle is ...

In elementary geometry, orthogonal is the same as perpendicular. Two lines or curves are orthogonal if they are perpendicular at their point of intersection. Two vectors v ...