Search Results for ""

Polyrects are polyforms obtained from a rectangular grid, illustrated above. The numbers of polyrects with n=1, 2, ... components are 1, 2, 3, 9, 21, 68, 208, ... (OEIS ...

Polyrhombs are polyforms obtained from a rhombic grid, illustrated above. The numbers of polyrhombs with n=1, 2, ... components are 1, 1, 3, 7, 20, 62, 204, ... (OEIS ...

Lachlan's terms for a collection of n points.

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

A one-dimensional line segment where two two-dimensional faces of an n-dimensional polytope meet, also called a side.

There are 10 stellated regular 4-polytopes (Wells 1991, p. 209).

The ith Pontryagin class of a vector bundle is (-1)^i times the ith Chern class of the complexification of the vector bundle. It is also in the 4ith cohomology group of the ...

Let G be a locally compact Abelian group. Let G^* be the group of all continuous homeomorphisms G->R/Z, in the compact open topology. Then G^* is also a locally compact ...

A result in control theory. Define H(psi,x,u)=(psi,f(x,u))=sum_(a=0)^npsi_af^a(x,u). Then in order for a control u(t) and a trajectory x(t) to be optimal, it is necessary ...

The upper horizontal line segment in the above figure appears to be longer than the lower line segment despite the fact that both are the same length.