Search Results for ""

A hypergeometric series sum_(k)c_k is a series for which c_0=1 and the ratio of consecutive terms is a rational function of the summation index k, i.e., one for which ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

A Turán graph, sometimes called a maximally saturated graph (Zykov 1952, Chao and Novacky 1982), with positive integer parameters n and k is a type of extremal graph on n ...

A smooth manifold M=(M,g) is said to be semi-Riemannian if the indexMetric Tensor Index of g is nonzero. Alternatively, a smooth manifold is semi-Riemannian provided that it ...

Einstein summation is a notational convention for simplifying expressions including summations of vectors, matrices, and general tensors. There are essentially three rules of ...

The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...

The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...