Search Results for ""
1901 - 1910 of 13135 for Four Point GeometrySearch Results
A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...
The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...
A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...
The ideal generated by a set in a vector space.
A (symmetrical) boundary set of radius r and center x_0 is the set of all points x such that |x-x_0|=r. Let x_0 be the origin. In R^1, the boundary set is then the pair of ...
The closed ball with center x and radius r is defined by B_r(x)={y:|y-x|<=r}.
A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.
An open interval is an interval that does not include its end points. The open interval {x:a<x<b} is denoted (a,b), although the nonstandard notation ]a,b[ is sometimes also ...
An outer measure mu on R^n is Borel regular if, for each set X subset R^n, there exists a Borel set B superset X such that mu(B)=mu(X). The d-dimensional Hausdorff outer ...
Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...
...
View search results from all Wolfram sites (47935 matches)

