Search Results for ""

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

An algorithm which finds rational function extrapolations of the form R_(i(i+1)...(i+m))=(P_mu(x))/(P_nu(x))=(p_0+p_1x+...+p_mux^mu)/(q_0+q_1x+...+q_nux^nu) and can be used ...

The Bump-Ng theorem (and also the title of the paper in which it was proved) states that the zeros of the Mellin transform of Hermite functions have real part equal to 1/2.

Given any open set U in R^n with compact closure K=U^_, there exist smooth functions which are identically one on U and vanish arbitrarily close to U. One way to express this ...

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