Search Results for ""

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

Given a point P, the pedal triangle of P is the triangle whose polygon vertices are the feet of the perpendiculars from P to the side lines. The pedal triangle of a triangle ...

The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...

The phrase Tomita-Takesaki theory refers to a specific collection of results proven within the field of functional analysis regarding the theory of modular Hilbert algebras ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

The Zernike polynomials are a set of orthogonal polynomials that arise in the expansion of a wavefront function for optical systems with circular pupils. The odd and even ...

An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...

A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, every linear transformation can be represented by a ...

The Möbius-Kantor graph is the unique cubic symmetric graph on 16 nodes, illustrated above in several embeddings. Its unique canonical LCF notation is [5,-5]^8. The ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...