Search Results for ""

A q-analog of the Saalschütz theorem due to Jackson is given by where _3phi_2 is the q-hypergeometric function (Koepf 1998, p. 40; Schilling and Warnaar 1999).

A q-analog of Zeilberger's algorithm.

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

In the usual diagram of inclusion homomorphisms, if the upper two maps are injective, then so are the other two. More formally, consider a space X which is expressible as the ...

Divide a triangle by its three medians into six smaller triangles. Surprisingly, the circumcenters O_(AB), O_(BA), etc. of the six circumcircles of these smaller triangles ...

The Van Lint-Schrijver Graph graph is a weakly regular Hamiltonian graph on 162 vertices with parameters (nu,k,lambda,mu)=(162,(6),(0),(0,1)). It is distance-regular with ...

The van der Grinten projection is a map projection given by the transformation x = (1) y = sgn(phi)(pi|PQ-Asqrt((A^2+1)(P^2+A^2)-Q^2)|)/(P^2+A^2), (2) where A = ...

A continuous distribution defined on the range x in [0,2pi) with probability density function P(x)=(e^(bcos(x-a)))/(2piI_0(b)), (1) where I_0(x) is a modified Bessel function ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...