Search Results for ""

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...

An extension of two-valued logic such that statements need not be true or false, but may have a degree of truth between 0 and 1. Such a system can be extremely useful in ...

Gauge theory studies principal bundle connections, called gauge fields, on a principal bundle. These connections correspond to fields, in physics, such as an electromagnetic ...

The Kubo-Martin-Schwinger (KMS) condition is a kind of boundary-value condition which naturally emerges in quantum statistical mechanics and related areas. Given a quantum ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A system of curvilinear coordinates in which two sets of coordinate surfaces are obtained by revolving the curves of the elliptic cylindrical coordinates about the y-axis ...

A sequence which arises in the hypothetical reproduction of a population of rabbits. Let the substitution system map 0->1 correspond to young rabbits growing old, and 1->10 ...

The Risch algorithm is a decision procedure for indefinite integration that determines whether a given integral is elementary, and if so, returns a closed-form result for the ...

The turning of an object or coordinate system by an angle about a fixed point. A rotation is an orientation-preserving orthogonal transformation. Euler's rotation theorem ...