A Characterization Theorem for the K-functional Associated with the Algebraic Version of Trigonometric Jackson Integrals

2000 Mathematics Subject Classification: 41A25, 41A36.

Rolle's Theorem for Complex Polynomials with Real Coefficients

Let p(z) be an algebraic polynomial of degree n ¸ 2 with real coefficients and p(i) = p(¡i). According to Grace-Heawood Theorem, at least one zero of the derivative p0(z) is on the disk with center in the origin and radius cot(¼=n). In this paper is found the smallest domain containing at leas one zero of the derivative p0(z).

On the Algebraic Properties of Convex Bodies

AMS subject classification: 52A01, 13C99.

Complex Analogues of the Rolle's Theorem

2000 Mathematics Subject Classification: 30C10.

Extention of Apolarity and Grace Theorem

MSC 2010: 30C10

Improvements on the Juxtaposing Theorem

A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.

Algebraic Computations with Hausdorff Continuous Functions

The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006.

On the Various Bisection Methods Derived from Vincent’s Theorem

In 2000 A. Alesina and M. Galuzzi presented Vincent’s theorem “from a modern point of view” along with two new bisection methods derived from it, B and C. Their profound understanding of Vincent’s theorem is responsible for simplicity — the characteristic property of these two methods. In this paper we compare the performance of these two new bisection methods — i.e. the time they take, as well as the number of intervals they examine in order to isolate the real roots of polynomials — against that of the well-known Vincent-Collins-Akritas method, which is the first bisection method derived from Vincent’s theorem back in 1976. Experimental results indicate that REL, the fastest implementation of the Vincent-Collins-Akritas method, is still the fastest of the three bisection methods, but the number of intervals it examines is almost the same as that of B. Therefore, further research on speeding up B while preserving its simplicity looks promising.

On a New Approach to Williamson's Generalization of Pólya's Enumeration Theorem

Pólya’s fundamental enumeration theorem and some results from Williamson’s generalized setup of it are proved in terms of Schur- Macdonald’s theory (S-MT) of “invariant matrices”. Given a permutation group W ≤ Sd and a one-dimensional character χ of W , the polynomial functor Fχ corresponding via S-MT to the induced monomial representation Uχ = ind|Sdv/W (χ) of Sd , is studied. It turns out that the characteristic ch(Fχ ) is the weighted inventory of some set J(χ) of W -orbits in the integer-valued hypercube [0, ∞)d . The elements of J(χ) can be distinguished among all W -orbits by a maximum property. The identity ch(Fχ ) = ch(Uχ ) of both characteristics is a consequence of S-MT, and is equivalent to a result of Williamson. Pólya’s theorem can be obtained from the above identity by the specialization χ = 1W , where 1W is the unit character of W.

A Remark On S.M. Bates' Theorem

In his paper [1], Bates investigates the existence of nonlinear, but highly smooth, surjective operators between various classes of Banach spaces. Modifying his basic method, he obtains the following striking results.

Analog of Favard's Theorem for Polynomials Connected with Difference Equation of 4-th Order

Orthonormal polynomials on the real line {pn (λ)} n=0 ... ∞ satisfy the recurrent relation of the form: λn−1 pn−1 (λ) + αn pn (λ) + λn pn+1 (λ) = λpn (λ), n = 0, 1, 2, . . . , where λn > 0, αn ∈ R, n = 0, 1, . . . ; λ−1 = p−1 = 0, λ ∈ C. In this paper we study systems of polynomials {pn (λ)} n=0 ... ∞ which satisfy the equation: αn−2 pn−2 (λ) + βn−1 pn−1 (λ) + γn pn (λ) + βn pn+1 (λ) + αn pn+2 (λ) = λ2 pn (λ), n = 0, 1, 2, . . . , where αn > 0, βn ∈ C, γn ∈ R, n = 0, 1, 2, . . ., α−1 = α−2 = β−1 = 0, p−1 = p−2 = 0, p0 (λ) = 1, p1 (λ) = cλ + b, c > 0, b ∈ C, λ ∈ C. It is shown that they are orthonormal on the real and the imaginary axes in the complex plane ...

Cerami (C) Condition and Mountain Pass Theorem for Multivalued Mappings

Partially supported by Sapientia Foundation.

Generalization of a Conjecture in the Geometry of Polynomials

In this paper we survey work on and around the following conjecture, which was first stated about 45 years ago: If all the zeros of an algebraic polynomial p (of degree n ≥ 2) lie in a disk with radius r, then, for each zero z1 of p, the disk with center z1 and radius r contains at least one zero of the derivative p′ . Until now, this conjecture has been proved for n ≤ 8 only. We also put the conjecture in a more general framework involving higher order derivatives and sets defined by the zeros of the polynomials.

On Representations of Algebraic Polynomials by Superpositions of Plane Waves

* The author was supported by NSF Grant No. DMS 9706883.

Projectively Solid Sets and an N-dimensional Piccard's Theorem

We discuss functions f : X × Y → Z such that sets of the form f (A × B) have non-empty interiors provided that A and B are non-empty sets of second category and have the Baire property.