Search Results for ""

Define the correlation integral as C(epsilon)=lim_(N->infty)1/(N^2)sum_(i,j=1; i!=j)^inftyH(epsilon-|x_i-x_j|), (1) where H is the Heaviside step function. When the below ...

The Engel polyhedra are two 38-faced plesiohedra (and hence space-filling) discovered by Engel (Engel 1981; Engel 1986, p. 220; Grünbaum and Shephard 1980; Senechal 1990, ...

A functor is said to be faithful if it is injective on maps. This does not necessarily imply injectivity on objects. For example, the forgetful functor from the category of ...

The Georges graph, illustrated above, is 50-node graph which is the smallest currently known example of a 3-connected bicubic nonhamiltonian graph. It is implemented in the ...

The Goldner-Harary polyhedron is the term given in this work to the polyhedral embedding of the Goldner-Harary graph. This solid is an augmented triangular dipyramid, a ...

Let f be a function defined on a set A and taking values in a set B. Then f is said to be an injection (or injective map, or embedding) if, whenever f(x)=f(y), it must be the ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If K=L and h is a join-homomorphism, then we call h a join-endomorphism.

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.

A lattice graph, also known as a mesh graph or grid graph, is a graph possessing an embedding in a Euclidean space R^n that forms a regular tiling. Examples include grid ...