Search Results for ""

The class of all regular sequences of particularly well-behaved functions equivalent to a given regular sequence. A distribution is sometimes also called a "generalized ...

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

The great dirhombicosidodecahedral graph is the skeleton of the great dirhombicosidodecahedron and the second octahedron 20-compound. It is illustrated above in a few ...

The great stellated dodecahedron is one of the Kepler-Poinsot polyhedra. It is also the uniform polyhedron with Maeder index 52 (Maeder 1997), Wenninger index 22 (Wenninger ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The Heilbronn triangle problem is to place n>=3 points in a disk (square, equilateral triangle, etc.) of unit area so as to maximize the area Delta(n) of the smallest of the ...

Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), the Hilbert function of M is the map ...

Let two points x and y be picked randomly from a unit n-dimensional hypercube. The expected distance between the points Delta(n), i.e., the mean line segment length, is then ...

The curve produced by fixed point P on the circumference of a small circle of radius b rolling around the inside of a large circle of radius a>b. A hypocycloid is therefore a ...

There are a number of algebraic equations known as the icosahedral equation, all of which derive from the projective geometry of the icosahedron. Consider an icosahedron ...