Search Results for ""

_3F_2[n,-x,-y; x+n+1,y+n+1] =Gamma(x+n+1)Gamma(y+n+1)Gamma(1/2n+1)Gamma(x+y+1/2n+1) ×Gamma(n+1)Gamma(x+y+n+1)Gamma(x+1/2n+1)Gamma(y+1/2n+1), (1) where _3F_2(a,b,c;d,e;z) is a ...

A hypergeometric identity discovered by Ramanujan around 1910. From Hardy (1999, pp. 13 and 102-103), (1) where a^((n))=a(a+1)...(a+n-1) (2) is the rising factorial (a.k.a. ...

The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...

There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

The Gershgorin circle theorem (where "Gershgorin" is sometimes also spelled "Gersgorin" or "Gerschgorin") identifies a region in the complex plane that contains all the ...

Green's theorem is a vector identity which is equivalent to the curl theorem in the plane. Over a region D in the plane with boundary partialD, Green's theorem states ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

A representation of a group G is a group action of G on a vector space V by invertible linear maps. For example, the group of two elements Z_2={0,1} has a representation phi ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...