Search Results for ""

The areas of the regions illustrated above can be found from the equations A+4B+4C=1 (1) A+3B+2C=1/4pi. (2) Since we want to solve for three variables, we need a third ...

The third Morley adjunct triangle has trilinear vertex matrix [2 sec[1/3(C-4pi)] sec[1/3(B-4pi)]; sec[1/3(C-4pi)] 2 sec[1/3(A-4pi)]; sec[1/3(B-4pi)] sec[1/3(A-4pi)] 2]. The ...

Solution of a system of second-order homogeneous ordinary differential equations with constant coefficients of the form (d^2x)/(dt^2)+bx=0, where b is a positive definite ...

In the Wolfram Language, WignerD[{j, m ,n}, psi, theta, phi] gives the m×n matrix element of a (2j+1)-dimensional unitary representation of SU(2) parametrized by three Euler ...

Direct sums are defined for a number of different sorts of mathematical objects, including subspaces, matrices, modules, and groups. The matrix direct sum is defined by ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...