Search Results for ""

j_n(z)=(z^n)/(2^(n+1)n!)int_0^picos(zcostheta)sin^(2n+1)thetadtheta, where j_n(z) is a spherical Bessel function of the first kind.

A tensor g whose discriminant satisfies g=g_(11)g_(22)-g_(12)^2>0.

Denoted sl_n.

A quantity which transforms like a tensor except for a scalar factor of a Jacobian.

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

The Carlson elliptic integrals, also known as the Carlson symmetric forms, are a standard set of canonical elliptic integrals which provide a convenient alternative to ...

The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...