Search Results for ""

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

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

The arc length of the parabolic segment y=h(1-(x^2)/(a^2)) (1) illustrated above is given by s = int_(-a)^asqrt(1+y^('2))dx (2) = 2int_0^asqrt(1+y^('2))dx (3) = ...

Consider an n-dimensional deterministic dynamical system x^_^.=f^_(x) and let S be an n-1-dimensional surface of section that is traverse to the flow, i.e., all trajectories ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...