Search Results for ""

Direct sums are defined for a number of different sorts of mathematical objects, including subspaces, matrices, modules, and groups. The matrix direct sum is defined by ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

The roots of a semisimple Lie algebra g are the Lie algebra weights occurring in its adjoint representation. The set of roots form the root system, and are completely ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The central beta function is defined by beta(p)=B(p,p), (1) where B(p,q) is the beta function. It satisfies the identities beta(p) = 2^(1-2p)B(p,1/2) (2) = ...

An experiment in which s trials are made of an event, with probability p of success in any given trial.

Using a set of corners of a solid that lie in a plane to form the polygon vertices of a new polygon is called faceting. Such polygons may outline new faces that join to ...

A necessary and sufficient condition that there should exist at least one nondecreasing function alpha(t) such that mu_n=int_(-infty)^inftyt^ndalpha(t) for n=0, 1, 2, ..., ...