Search Results for ""

A number of attractive 70-compounds of the regular tetrahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 8-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...

With n cuts of a torus of genus 1, the maximum number of pieces which can be obtained is N(n)=1/6(n^3+3n^2+8n). The first few terms are 2, 6, 13, 24, 40, 62, 91, 128, 174, ...

A totally imaginary field is a field with no real embeddings. A general number field K of degree n has s real embeddings (0<=s<=n) and 2t imaginary embeddings (0<=t<=n/2), ...

A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...

In statistics, a trial is a single performance of well-defined experiment (Papoulis 1984, p. 25), such as the flipping of a coin, the generation of a random number, the ...

The truncated great dodecahedral graph is the skeleton of the small stellated truncated dodecahedron and truncated great dodecahedron. It is illustrated above in a number of ...

An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...