Search Results for ""

The polynomial giving the number of colorings with m colors of a structure defined by a permutation group.

A polybe is a polyform formed from a polycubes by removing of half of each cube such that at least half of the original join between cubes is retained. The numbers of polybes ...

Polycairos are polyforms obtained from the Cairo tessellation, illustrated above. The numbers of polycairos with n=1, 2, ... components are 1, 2, 5, 17, 55, 206, 781, 3099, ...

The term "polyedge" has been variously proposed to refer to a polystick or a simple connected graph on n edges (Muñiz 2011), the latter of which has also been termed an ...

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

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

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