Search Results for ""

Using a Tschirnhausen transformation, the principal quintic form can be transformed to the one-parameter form w^5-10cw^3+45c^2w-c^2=0 (1) named after Francesco Brioschi ...

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

Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...

The set of all sets is its own power set. Therefore, the cardinal number of the set of all sets must be bigger than itself.

A coordinate system obtained by inversion of the bicyclide coordinates. They are given by the transformation equations x = Lambda/(aUpsilon)snmudnnucospsi (1) y = ...

A coordinate system (mu,nu,psi) defined by the coordinate transformation x = (munu)/((mu^2+nu^2)^2)cospsi (1) y = (munu)/((mu^2+nu^2)^2)sinpsi (2) z = ...

Assume that f is a nonnegative real function on [0,infty) and that the two integrals int_0^inftyx^(p-1-lambda)[f(x)]^pdx (1) int_0^inftyx^(q-1+mu)[f(x)]^qdx (2) exist and are ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...