Search Results for ""

Any continuous function G:B^n->B^n has a fixed point, where B^n={x in R^n:x_1^2+...+x_n^2<=1} is the unit n-ball.

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

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

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

Gives a matrix representation b_i of a braid group in terms of (n-1)×(n-1) matrices. A -t always appears in the (i,i) position. b_1 = [-t 0 0 ... 0; -1 1 0 ... 0; 0 0 1 ... ...