Search Results for ""

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×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, ...

Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...

A block matrix is a matrix that is defined using smaller matrices, called blocks. For example, [A B; C D], (1) where A, B, C, and D are themselves matrices, is a block ...

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

A quartic surface which can be constructed as follows. Given a circle C and plane E perpendicular to the plane of C, move a second circle K of the same radius as C through ...

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