Search Results for ""

In n-dimensional Lorentzian space R^n=R^(1,n-1), the light cone C^(n-1) is defined to be the subset consisting of all vectors x=(x_0,x_1,...,x_(n-1)) (1) whose squared ...

A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...

The Mandart circle is the circumcircle of the extouch triangle. It has center at Kimberling center X_(1158), which has trilinear center function (1) and radius ...

(1) where H_n(x) is a Hermite polynomial (Watson 1933; Erdélyi 1938; Szegö 1975, p. 380). The generating function ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...

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

Consider a knot as being formed from two tangles. The following three operations are called mutations. 1. Cut the knot open along four points on each of the four strings ...

The first Napoleon point N is the concurrence of lines drawn between vertices of a given triangle DeltaABC and the opposite vertices of the corresponding inner Napoleon ...

The natural projection, also called the homomorphism, is a logical way of mapping an algebraic structure onto its quotient structures. The natural projection pi is defined ...