Search Results for ""

The third-order ordinary differential equation 2y^(''')+yy^('')=0. This equation arises in the theory of fluid boundary layers, and must be solved numerically (Rosenhead ...

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

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

The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...

A bra <psi| is a vector living in a dual vector space to that containing kets |psi>. Bras and kets are commonly encountered in quantum mechanics. Bras and kets can be ...

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...