Search Results for ""

The 4-polyhex illustrated above.

If a circular pizza is divided into 8, 12, 16, ... slices by making cuts at equal angles from an arbitrary point, then the sums of the areas of alternate slices are equal. ...

Consider n intersecting ellipses. The maximal number of regions into which these divide the plane are N(n)=2n^2-2n+2=2(n^2-n+1), giving values for n=1, 2, ... of 2, 6, 14, ...

The maximal number of regions into which n lines divide a plane are N(n)=1/2(n^2+n+2) which, for n=1, 2, ... gives 2, 4, 7, 11, 16, 22, ... (OEIS A000124), the same maximal ...

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

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

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

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

The power polynomials x^n are an associated Sheffer sequence with f(t)=t, (1) giving generating function sum_(k=0)^inftyx^kt^k=1/(1-tx) (2) and exponential generating ...

A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...