Search Results for ""

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

The nth root of the content of the set sum of two sets in n-dimensional Euclidean space is greater than or equal to the sum of the nth roots of the contents of the individual ...

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 hypothetic building design problem in optimization with constraints proposed by Bhatti (2000, pp. 3-5). To save energy costs for heating and cooling, an architect wishes to ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...

A bundle map is a map between bundles along with a compatible map between the base manifolds. Suppose p:X->M and q:Y->N are two bundles, then F:X->Y is a bundle map if there ...

A real vector bundle pi:E->M has an orientation if there exists a covering by trivializations U_i×R^k such that the transition functions are vector space ...

The rank of a vector bundle is the dimension of its fiber. Equivalently, it is the maximum number of linearly independent local bundle sections in a trivialization. ...

In the theory of transfinite ordinal numbers, 1. Every well ordered set has a unique ordinal number, 2. Every segment of ordinals (i.e., any set of ordinals arranged in ...