Search Results for ""

A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...

Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...

The square torus is the quotient of the plane by the integer lattice.

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

Graph Strength

A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...

A vector space V is a set that is closed under finite vector addition and scalar multiplication. The basic example is n-dimensional Euclidean space R^n, where every element ...

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

sum_(n=0)^(infty)[(q)_infty-(q)_n] = g(q)+(q)_inftysum_(k=1)^(infty)(q^k)/(1-q^k) (1) = g(q)+(q)_inftyL(q) (2) = g(q)+(q)_infty(psi_q(1)+ln(1-q))/(lnq) (3) = ...

Analysis