Search Results for ""

Calabi-Yau spaces are important in string theory, where one model posits the geometry of the universe to consist of a ten-dimensional space of the form M×V, where M is a four ...

The diamond graph is the simple graph on 4 nodes and 5 edges illustrated above (Brandstädt et al. 1987, p. 18). It is isomorphic to the complete tripartite graph K_(1,1,2) ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

Let X be an infinite set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A,B in V(X) be finitary algebras with finitely many operations, and ...

Given a compact manifold M and a transversely orientable codimension-one foliation F on M which is tangent to partialM, the pair (M,F) is called a generalized Reeb component ...

For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...

The tensor product of two vector spaces V and W, denoted V tensor W and also called the tensor direct product, is a way of creating a new vector space analogous to ...

A multiplicative factor (usually indexed) such as one of the constants a_i in the polynomial a_nx^n+a_(n-1)x^(n-1)+...+a_2x^2+a_1x+a_0. In this polynomial, the monomials are ...

Let a_1, a_2, ..., a_n be scalars not all equal to 0. Then the set S consisting of all vectors X=[x_1; x_2; |; x_n] in R^n such that a_1x_1+a_2x_2+...+a_nx_n=c for c a ...

A function f is said to have a lower bound c if c<=f(x) for all x in its domain. The greatest lower bound is called the infimum.