Search Results for ""

A parameterization is isothermal if, for zeta=u+iv and phi_k(zeta)=(partialx_k)/(partialu)-i(partialx_k)/(partialv), the identity phi_1^2(zeta)+phi_2^2(zeta)+phi_3^2(zeta)=0 ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

Every complex matrix A can be broken into a Hermitian part A_H=1/2(A+A^(H)) (i.e., A_H is a Hermitian matrix) and an antihermitian part A_(AH)=1/2(A-A^(H)) (i.e., A_(AH) is ...

Two square matrices A and B are called congruent if there exists a nonsingular matrix P such that B=P^(T)AP, where P^(T) is the transpose.

Every complex matrix can be broken into a Hermitian part A_H=1/2(A+A^(H)) (i.e., A_H is a Hermitian matrix) and an antihermitian part A_(AH)=1/2(A-A^(H)) (i.e., A_(AH) is an ...

A pullback is a general categorical operation appearing in a number of mathematical contexts, sometimes going under a different name. If T:V->W is a linear transformation ...

Let kappa_1 and kappa_2 be the principal curvatures, then their mean H=1/2(kappa_1+kappa_2) (1) is called the mean curvature. Let R_1 and R_2 be the radii corresponding to ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...

The Wiener-Araya graph (Wiener and Araya 2009) is the 42-vertex graph illustrated above that was the smallest known example of a planar hypohamiltonian graph, beating the ...

The Hoffman-Singleton graph is the graph on 50 nodes and 175 edges that is the only regular graph of vertex degree 7, diameter 2, and girth 5. It is the unique (7,5)-cage ...