Search Results for ""

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

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...

The Bôcher Memorial Prize is awarded by the American Mathematical Society every five years for notable research in analysis that has appeared in a recognized North American ...

The term Bol loop refers to either of two classes of algebraic loops satisfying the so-called Bol identities. In particular, a left Bol loop is an algebraic loop L which, for ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

Let P(E_i) be the probability that E_i is true, and P( union _(i=1)^nE_i) be the probability that at least one of E_1, E_2, ..., E_n is true. Then "the" Bonferroni ...

The Bonne projection is a map projection that resembles the shape of a heart. Let phi_1 be the standard parallel, lambda_0 the central meridian, phi be the latitude, and ...

Every Boolean algebra is isomorphic to the Boolean algebra of sets. The theorem is equivalent to the maximal ideal theorem, which can be proved without using the axiom of ...

The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...