Search Results for ""

A technique in set theory invented by P. Cohen (1963, 1964, 1966) and used to prove that the axiom of choice and continuum hypothesis are independent of one another in ...

A matrix A for which A^(H)=A^(T)^_=A, where the conjugate transpose is denoted A^(H), A^(T) is the transpose, and z^_ is the complex conjugate. If a matrix is self-adjoint, ...

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...

The McGee graph is a cubic symmetric graph on 24 nodes and 36 edges which is the unique 7-cage graph. It can be constructed as the union of the two leftmost subgraphs ...

Isolated resonances in a dynamical system can cause considerable distortion of preserved tori in their neighborhood, but they do not introduce any chaos into a system. ...

A transformation of the form A^'=UAU^(H), where U^(H) denotes the conjugate transpose.

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...

A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...

A (2n)×(2n) complex matrix A in C^(2n×2n) is said to be Hamiltonian if J_nA=(J_nA)^(H), (1) where J_n in R^(2n×2n) is the matrix of the form J_n=[0 I_n; I_n 0], (2) I_n is ...