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 symbol O(x), pronounced "big-O of x," is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function. In particular, if n is ...

A bilinear form on a real vector space is a function b:V×V->R that satisfies the following axioms for any scalar alpha and any choice of vectors v,w,v_1,v_2,w_1, and w_2. 1. ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

There are two types of bordism groups: bordism groups, also called cobordism groups or cobordism rings, and there are singular bordism groups. The bordism groups give a ...

A Borel set is an element of a Borel sigma-algebra. Roughly speaking, Borel sets are the sets that can be constructed from open or closed sets by repeatedly taking countable ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

Calabi's triangle is the unique triangle other that the equilateral triangle for which the largest inscribed square can be inscribed in three different ways (Calabi 1997). ...

As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...

A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...