Search Results for ""

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

The determinant G(f_1,f_2,...,f_n)=|intf_1^2dt intf_1f_2dt ... intf_1f_ndt; intf_2f_1dt intf_2^2dt ... intf_2f_ndt; | | ... |; intf_nf_1dt intf_nf_2dt ... intf_n^2dt|.

Given a set V of m vectors (points in R^n), the Gram matrix G is the matrix of all possible inner products of V, i.e., g_(ij)=v_i^(T)v_j. where A^(T) denotes the transpose. ...

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then a literal obtained from ...

If G is a group, then the torsion elements Tor(G) of G (also called the torsion of G) are defined to be the set of elements g in G such that g^n=e for some natural number n, ...

The system of partial differential equations S_t=SxS_(xx).

A function S_n(z) which satisfies the recurrence relation S_(n-1)(z)-S_(n+1)(z)=2S_n^'(z) together with S_1(z)=-S_0^'(z) is called a hemicylindrical function.

H=|aa^'a^('')|a_(x^(n-2))a_(x^(n-2))^'a_(x^(n-2))^('')=0. The nonsingular inflections of a curve are its nonsingular intersections with the Hessian.

A hexagonal antiprism is an antiprism having hexagons as its bases. A stretched hexagonal antiprism is the convex hull of the tetrahedron 3-compound. The dual polyhedron of ...