Search Results for ""

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 ...

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

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 ...

A cube can be divided into n subcubes for only n=1, 8, 15, 20, 22, 27, 29, 34, 36, 38, 39, 41, 43, 45, 46, and n>=48 (OEIS A014544; Hadwiger 1946; Scott 1947; Gardner 1992, ...

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...