Search Results for ""

A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...

A Cartesian tensor is a tensor in three-dimensional Euclidean space. Unlike general tensors, there is no distinction between covariant and contravariant indices for Cartesian ...

For any system that seeks to minimize a function, only seven different local forms of catastrophe "typically" occur for four or fewer variables: 1. Fold catastrophe, 2. Cusp ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

All closed surfaces, despite their seemingly diverse forms, are topologically equivalent to spheres with some number of handles or cross-caps. The traditional proof follows ...

A complemented lattice is an algebraic structure (L, ^ , v ,0,1,^') such that (L, ^ , v ,0,1) is a bounded lattice and for each element x in L, the element x^' in L is a ...

A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...