Search Results for ""

"The" Sylvester graph is a quintic graph on 36 nodes and 90 edges that is the unique distance-regular graph with intersection array {5,4,2;1,1,4} (Brouwer et al. 1989, ...

For two polynomials P_1(x)=a_mx^m+...+a_0 and P_2=b_nx^n+...+b_0 of degrees m and n, respectively, the Sylvester matrix is an (m+n)×(m+n) matrix formed by filling the matrix ...

Sylvester's criterion states that a matrix M is positive definite iff the determinants associated with all upper-left submatrices of M are positive.

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 ...

Sylvester's four-point problem asks for the probability q(R) that four points chosen at random in a planar region R have a convex hull which is a quadrilateral (Sylvester ...

The numbers of eigenvalues that are positive, negative, or 0 do not change under a congruence transformation. Gradshteyn and Ryzhik (2000) state it as follows: when a ...

Sylvester's line problem, known as the Sylvester-Gallai theorem in proved form, states that it is not possible to arrange a finite number of points so that a line through ...

The sequence defined by e_0=2 and the quadratic recurrence equation e_n=1+product_(i=0)^(n-1)e_i=e_(n-1)^2-e_(n-1)+1. (1) This sequence arises in Euclid's proof that there ...

Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then Sylvester's signature is the ...

The resultant of the vectors represented by the three radii from the center of a triangle's circumcircle to its polygon vertices is the segment extending from the ...