Search Results for ""

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

A nonzero vector v=(v_0,v_1,...,v_(n-1)) in n-dimensional Lorentzian space R^(1,n-1) is said to be negative lightlike if it has zero (Lorentzian) norm and if its first ...

Nonparametric estimation is a statistical method that allows the functional form of a fit to data to be obtained in the absence of any guidance or constraints from theory. As ...

A set X is said to be nowhere dense if the interior of the set closure of X is the empty set. For example, the Cantor set is nowhere dense. There exist nowhere dense sets of ...

In order to recover all Fourier components of a periodic waveform, it is necessary to use a sampling rate nu at least twice the highest waveform frequency. The Nyquist ...