Search Results for ""

A toroidal polyhedron is a polyhedron with genus g>=1 (i.e., one having one or more holes). Examples of toroidal polyhedra include the Császár polyhedron and Szilassi ...

The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...

Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...

A uniquely pancyclic graph is a graph that has exactly one cycle of each length between 3 and the graph's vertex count. Uniquely pancyclic graphs are therefore a special case ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

The Wigner 9j-symbols are a generalization of Clebsch-Gordan coefficients and Wigner 3j- and 6j-symbols which arises in the coupling of four angular momenta. They can be ...

The Wythoff array is an interspersion array that can be constructed by beginning with the Fibonacci numbers {F_2,F_3,F_4,F_5,...} in the first row and then building up ...

A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...