Search Results for ""

Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...

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).

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.

In computer science, a pop is an action which removes the initial element from the top of a queue or stack, turning the list (a_1, a_2, ..., a_n) into (a_2, ..., a_n) and ...