Search Results for ""

The toroidal crossing number cr_(1)(G) of a graph G is the minimum number of crossings with which G can be drawn on a torus. A planar graph has toroidal crossing number 0, ...

The nth k-statistic k_n is the unique symmetric unbiased estimator of the cumulant kappa_n of a given statistical distribution, i.e., k_n is defined so that <k_n>=kappa_n, ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

A function is a relation that uniquely associates members of one set with members of another set. More formally, a function from A to B is an object f such that every a in A ...

The set A^2 of all ordered pairs of complex numbers.

A set of values of similar meaning obtained in any manner.

The kernel of a symmetric bilinear form Q:V×V-->R is the set Ker(Q)={v in V|Q(v,w)=0 for all w in V}.

A set of points which do not lie on any of a certain class of hyperplanes.

The problem of determining (or counting) the set of all solutions to a given problem.

The manipulation of Dehn surgery descriptions by a certain set of operations.