Search Results for ""

A square matrix U is a special unitary matrix if UU^*=I, (1) where I is the identity matrix and U^* is the conjugate transpose matrix, and the determinant is detU=1. (2) The ...

A graph for which the relations between pairs of vertices are symmetric, so that each edge has no directional character (as opposed to a directed graph). Unless otherwise ...

A left Hilbert Algebra A whose involution is an antilinear isometry is called a unimodular Hilbert algebra. The involution is usually denoted xi|->xi^*.

The van der Pol equation is an ordinary differential equation that can be derived from the Rayleigh differential equation by differentiating and setting y=y^'. It is an ...

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

The parameter r (sometimes also denoted mu) in the logistic equation x_(n+1)=rx_n(1-x_n).

A ring is commutative if the multiplication operation is commutative.

x^(2n)+1=[x^2-2xcos(pi/(2n))+1] ×[x^2-2xcos((3pi)/(2n))+1]×...× ×[x^2-2xcos(((2n-1)pi)/(2n))+1].

The exists quantifier exists .

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...