The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The present paper shows that for any sequences of real numbers, each with infinitely many distinct elements, , j=1,...,s, the rational combinations of are always dense in .
We present here a new method for approximating functions defined on superreflexive Banach spaces by differentiable functions with α-Hölder derivatives (for some 0 < α≤ 1). The smooth approximation is given by means of an explicit formula enjoying good properties from the minimization point of view. For instance, for any function f which is bounded below and uniformly continuous on bounded sets this formula gives a sequence of Δ-convex functions converging to f uniformly on bounded sets and...
* The author was supported by NSF Grant No. DMS 9706883.Let P be a bi-variate algebraic polynomial of degree n with the
real senior part, and Y = {yj }1,n an n-element collection of pairwise
noncolinear unit vectors on the real plane. It is proved that there exists a rigid
rotation Y^φ of Y by an angle φ = φ(P, Y ) ∈ [0, π/n] such that P equals the
sum of n plane wave polynomials, that propagate in the directions ∈ Y^φ .
The approximation in the uniform norm of a continuous function f(x) = f(x₁,...,xₙ) by continuous sums g₁(h₁(x)) + g₂(h₂(x)), where the functions h₁ and h₂ are fixed, is considered. A Chebyshev type criterion for best approximation is established in terms of paths with respect to the functions h₁ and h₂.
Currently displaying 1 –
20 of
23