TOPICS
Search

Search Results for ""


7091 - 7100 of 13135 for Computational GeometrySearch Results
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 Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).
A finite set of equations in the same unknowns of which the common solutions have to be determined. Solution of simultaneous equations in implemented in the Wolfram Language ...
The single bar | is a notation variously used to denote the absolute value |x|, complex modulus |z|, vector norm |x|, determinant |A|, or "divides" (a|b).
The function from a given nonempty set X to the power set P(X) that maps every element x of X to the set {x}.
A set having exactly one element a. A singleton set is denoted by {a} and is the simplest example of a nonempty set.
An even number of the form 4n+2 (i.e., an integer which is divisible by 2 but not by 4). The first few for n=0, 1, 2, ... are 2, 6, 10, 14, 18, ... (OEIS A016825)
A function possessing a single period in the complex plane is said to be singly periodic, of often simply periodic. Singly periodic functions include the trigonometric ...
A smooth map f:S^1->R^3 whose image has singularities. In particular, in the theory of Vassiliev's knot invariants, singular knots with a finite number of ordinary double ...
1 ... 707|708|709|710|711|712|713 ... 1314 Previous Next

...