Search Results for ""

The Suzuki graph is an edge-transitive strongly regular graph on 1782 vertices with parameters (nu,k,lambda,mu)=(1782,416,100,96) and automorphism group Suz.2. It is an ...

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

A symmetric matrix is a square matrix that satisfies A^(T)=A, (1) where A^(T) denotes the transpose, so a_(ij)=a_(ji). This also implies A^(-1)A^(T)=I, (2) where I is the ...

The symmetric successive overrelaxation (SSOR) method combines two successive overrelaxation method (SOR) sweeps together in such a way that the resulting iteration matrix is ...

Synergetics deals with systems composed of many subsystems which may each be of a very different nature. In particular, synergetics treats systems in which cooperation among ...

Synergetics coordinates are a set of triangular coordinates in their plane (or their generalization to tetrahedral coordinates in space, or the analogs in higher dimensions). ...

The tangential mid-arc triangle of a reference triangle DeltaABC is the triangle DeltaA^'B^'C^' whose sides are the tangents to the incircle at the intersections of the ...

The point T at which the lines through the polygon vertices of a triangle perpendicular to the corresponding sides of the first Brocard triangle, are concurrent. The Tarry ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...