Search Results for ""

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

The associahedron is the n-dimensional generalization of the pentagon. It was discovered by Stasheff in 1963 and it is also known as the Stasheff polytope. The number of ...

There are two types of bordism groups: bordism groups, also called cobordism groups or cobordism rings, and there are singular bordism groups. The bordism groups give a ...

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

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

A number of attractive cube 6-compounds can be constructed. A first (left figures) is obtained by combining six cubes, each rotated by 1/6 of a turn about the line joining ...

A number of attractive polyhedron compounds consisting of three octahedra. The first (left figues) is the polyhedron dual of the cube 3-compound. These compounds will be ...

A point process is a probabilistic model for random scatterings of points on some space X often assumed to be a subset of R^d for some d. Oftentimes, point processes describe ...

A perspective collineation with center O and axis o not incident is called a geometric homology. A geometric homology is said to be harmonic if the points A and A^' on a line ...

A rotation combined with an expansion or geometric contraction.