Search Results for ""

Let the elements in a payoff matrix be denoted a_(ij), where the is are player A's strategies and the js are player B's strategies. Player A can get at least min_(j<=n)a_(ij) ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

Special cases of general formulas due to Bessel. J_0(sqrt(z^2-y^2))=1/piint_0^pie^(ycostheta)cos(zsintheta)dtheta, where J_0(z) is a Bessel function of the first kind. Now, ...

sum_(k=0)^(infty)[((m)_k)/(k!)]^3 = 1+(m/1)^3+[(m(m+1))/(1·2)]^3+... (1) = (Gamma(1-3/2m))/([Gamma(1-1/2m)]^3)cos(1/2mpi), (2) where (m)_k is a Pochhammer symbol and Gamma(z) ...

A sum which includes both the Jacobi triple product and the q-binomial theorem as special cases. Ramanujan's sum is ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

A theorem due to Conway et al. (1997) which states that, if a positive definite quadratic form with integer matrix entries represents all natural numbers up to 15, then it ...

A representation of a Lie algebra g is a linear transformation psi:g->M(V), where M(V) is the set of all linear transformations of a vector space V. In particular, if V=R^n, ...

The Cayley-Menger determinant is a determinant that gives the volume of a simplex in j dimensions. If S is a j-simplex in R^n with vertices v_1,...,v_(j+1) and B=(beta_(ik)) ...

The energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...