Search Results for ""

The type of homology which results when the spaces being studied are restricted to simplicial complexes and subcomplexes.

Let f:K^((0))->L^((0)) be a bijective correspondence such that the vertices v_0, ..., v_n of K span a simplex of K iff f(v_0), ..., f(v_n) span a simplex of L. Then the ...

Let K and L be simplicial complexes, and let f:K^((0))->L^((0)) be a map. Suppose that whenever the vertices v_0, ..., v_n of K span a simplex of K, the points f(v_0), ..., ...

If L is a subcollection of a simplicial complex K that contains all faces of its elements, then L is another simplicial complex called a simplicial subcomplex.

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

A pathwise-connected domain is said to be simply connected (also called 1-connected) if any simple closed curve can be shrunk to a point continuously in the set. If the ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_4=f(x_4). Then Simpson's 3/8 rule ...

Simpson's paradox, also known as the amalgamation paradox, reversal paradox, or Yule-Simpson effect, is a paradox in which a statistical trend appears to be present when data ...

Simpson's rule is a Newton-Cotes formula for approximating the integral of a function f using quadratic polynomials (i.e., parabolic arcs instead of the straight line ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).