Search Results for ""
2321 - 2330 of 2959 for Crystallographic Point GroupsSearch Results
Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...
French curves are plastic (or wooden) templates having an edge composed of several different curves. French curves are used in drafting (or were before computer-aided design) ...
A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...
Finch (2010) gives an overview of known results for random Gaussian triangles. Let the vertices of a triangle in n dimensions be normal (normal) variates. The probability ...
The generalized diameter is the greatest distance between any two points on the boundary of a closed figure. The diameter of a subset E of a Euclidean space R^n is therefore ...
The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...
Generally speaking, a Green's function is an integral kernel that can be used to solve differential equations from a large number of families including simpler examples such ...
The Heine-Borel theorem states that a subspace of R^n (with the usual topology) is compact iff it is closed and bounded. The Heine-Borel theorem can be proved using the ...
A property that passes from a topological space to every subspace with respect to the relative topology. Examples are first and second countability, metrizability, the ...
The Hofstadter ellipses are a family of triangle ellipses introduced by P. Moses in February 2005. The Hofstadter ellipse E(r) for parameter 0<r<1 is defined by the trilinear ...
...
View search results from all Wolfram sites (31034 matches)

