TOPICS
Search

Search Results for ""


1331 - 1340 of 2399 for Set ClosureSearch Results
A scatter diagram, also called a scatterplot or a scatter plot, is a visualization of the relationship between two variables measured on the same set of individuals. Scatter ...
One of the set of symbols C_i, C_s, C_1, C_2, C_3, C_4, C_5, C_6, C_7, C_8, C_(2h), C_(3h), C_(4h), C_(5h), C_(6h), C_(2v), C_(3v), C_(4v), C_(5v), C_(6v), C_(inftyv), D_2, ...
The Schwarz triangles are spherical triangles which, by repeated reflection in their indices, lead to a set of congruent spherical triangles covering the sphere a finite ...
A mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a ...
Two complex measures mu and nu on a measure space X, are mutually singular if they are supported on different subsets. More precisely, X=A union B where A and B are two ...
The 12-faced convex deltahedra also known as the Siamese dodecahedron, which is also Johnson solid J_(84). It is implemented in the Wolfram Language as ...
A spatial-temporal point process is a point process which models data that is localized at a discrete set of locations in both space and time. In particular, a ...
The special unitary group SU_n(q) is the set of n×n unitary matrices with determinant +1 (having n^2-1 independent parameters). SU(2) is homeomorphic with the orthogonal ...
Let G be a permutation group on a set Omega and x be an element of Omega. Then G_x={g in G:g(x)=x} (1) is called the stabilizer of x and consists of all the permutations of G ...
The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G ...
1 ... 131|132|133|134|135|136|137 ... 240 Previous Next

...