Search Results for ""

Let x:U->R^3 be a regular patch, where U is an open subset of R^2. Then (partiale)/(partialv)-(partialf)/(partialu) = eGamma_(12)^1+f(Gamma_(12)^2-Gamma_(11)^1)-gGamma_(11)^2 ...

A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...

Let H be a complex Hilbert space, and define a nest as a set N of closed subspaces of H satisfying the conditions: 1. 0,H in N, 2. If N_1,N_2 in N, then either N_1 subset= ...

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...

An injective module is the dual notion to the projective module. A module M over a unit ring R is called injective iff whenever M is contained as a submodule in a module N, ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...

Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...