Search Results for ""

A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

The Watkins snark is the snark on 50 vertices ad 75 nodes illustrated above. It is implemented in the Wolfram Language as GraphData["WatkinsSnark"].

A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...

The q-series identity product_(n=1)^(infty)((1-q^(2n))(1-q^(3n))(1-q^(8n))(1-q^(12n)))/((1-q^n)(1-q^(24n))) = ...

The q-analog of pi pi_q can be defined by setting a=0 in the q-factorial [a]_q!=1(1+q)(1+q+q^2)...(1+q+...+q^(a-1)) (1) to obtain ...

The dual vector space to a real vector space V is the vector space of linear functions f:V->R, denoted V^*. In the dual of a complex vector space, the linear functions take ...

The operation of multiplication, i.e., a times b. Various notations are a×b, a·b, a*b, ab, and (a)(b). The "multiplication sign" × is based on Saint Andrew's cross (Bergamini ...

A group of three elements, also called a triad. A triple is therefore a 3-tuple.

The 16-cell beta_4 is the finite regular four-dimensional cross polytope with Schläfli symbol {3,3,4}. It is also known as the hyperoctahedron (Buekenhout and Parker 1998) or ...