Search Results for ""

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

Also known as the first fundamental form, ds^2=g_(ab)dx^adx^b. In the principal axis frame for three dimensions, ds^2=g_(11)(dx^1)^2+g_(22)(dx^2)^2+g_(33)(dx^3)^2. At ...

Given a matrix A, let |A| denote its determinant. Then |A||A_(rs,pq)|=|A_(r,p)||A_(s,q)|-|A_(r,q)||A_(s,p)|, (1) where A_(u,w) is the submatrix of A formed by the ...

A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...

A magic square for which the number of letters in the word for each number generates another magic square. This definition depends, of course, on the language being used. In ...

The Berlekamp-van Lint-Seidel graph is the Hamiltonian strongly regular graph on 243 vertices with parameters (243,22,1,2). It is also distance-regular with intersection ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

Given A = |a_(11)-x a_(12) ... a_(1m); a_(21) a_(22)-x ... a_(2m); | | ... |; a_(m1) a_(m2) ... a_(mm)-x| (1) = x^m+c_(m-1)x^(m-1)+...+c_0, (2) then ...

The characteristic equation is the equation which is solved to find a matrix's eigenvalues, also called the characteristic polynomial. For a general k×k matrix A, the ...

y approx m+sigmaw, (1) where w = (2) where h_1(x) = 1/6He_2(x) (3) h_2(x) = 1/(24)He_3(x) (4) h_(11)(x) = -1/(36)[2He_3(x)+He_1(x)] (5) h_3(x) = 1/(120)He_4(x) (6) h_(12)(x) ...