Search Results for ""

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...

Let [arg(f(z))] denote the change in the complex argument of a function f(z) around a contour gamma. Also let N denote the number of roots of f(z) in gamma and P denote the ...

One of the numbers 1, 2, 3, ... (OEIS A000027), also called the counting numbers or natural numbers. 0 is sometimes included in the list of "whole" numbers (Bourbaki 1968, ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

A cylinder can be dissected into unequal squares, with nine squares required at a minimum. Trivial squarings can be constructed by taking rectangle dissections and matching ...

A nowhere-neat dissection in which squares of the same size are not allowed to share any part of a side.

A nowhere-neat dissection is a dissection of an area into polygons such that no two polygons have a side in common. A nowhere-neat dissection in which squares of the same ...

A pentahedron is polyhedron having five faces. Because there are two pentahedral graphs, there are two convex pentahedra, corresponding to the topologies of the square ...

The numerical value of Khinchin's constant K is given by K=2.685452001... (OEIS A002210). However, the numerical value of K is notoriously difficult to calculate to high ...

Ramanujan calculated mu=1.45136380... (Hardy 1999, Le Lionnais 1983, Berndt 1994), while the correct value is mu=1.45136923488... (OEIS A070769; Derbyshire 2004, p. 114). The ...