On an inequality concerning the polar derivative of a polynomial

In this paper, we present a correct proof of an L _p -inequality concerning the polar derivative of a polynomial with restricted zeros. We also extend Zygmund’s inequality to the polar derivative of a polynomial.     

Light affine lambda calculus and polynomial time strong normalization

Light Linear Logic (LLL) and Intuitionistic Light Affine Logic (ILAL) are logics that capture polynomial time computation. It is known that every polynomial time function can be represented by a proof of these logics via the proofs-as-programs correspondence. Furthermore, there is a reduction strategy which normalizes a given proof in polynomial time. Given the latter polynomial time “weak” normalization theorem, it is natural to ask whether a “strong” form of polynomial time normalization theorem holds or not. In this paper, we introduce an untyped term calculus, called Light Affine Lambda Calculus (λLA), which corresponds to ILAL. λLA is a bi-modal λ-calculus with certain constraints, endowed with very simple reduction rules. The main property of LALC is the polynomial time strong normalization: any reduction strategy normalizes a given λLA term in a polynomial number of reduction steps, and indeed in polynomial time. Since proofs of ILAL are structurally representable by terms of λLA, we conclude that the same holds for ILAL. This is a full version of the paper [21] presented at LICS 2001.     

The bernsteim polynomial in one variable

The lemma on b-functions is a result due to I.N.Bernstein about the existence of certain differential operators with polynomial coefficients.In this paper we give an elementary and constructive proof of this result that works well in one variable.Our method results in a simple formula for the Bernstein polynomial b(λ)and a recursive definition for a differential operator d(λ)that produces b(λ).As an application we consider two consequences about the poles of certain meromorphic functions defined by the analytic continuation of distributions.     

Density of the circular chromatic numbers of series‐parallel graphs

In this paper we show that every simple cubic graph on n vertices has a set of at least ? n/4 ? disjoint 2‐edge paths and that this bound is sharp. Our proof provides a polynomial time algorithm for finding such a set in a simple cubic graph. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 57–79, 2003     

ON POLYNOMIAL AUTOMORPHISM IDENTITY SETS AND IDENTITY POLYNOMIALS

In this paper, we propose a new condition for hypersurfaces to be polynomial automorphism identity sets. This new condition can be used to give a new proof of Mckay-Wang's problem. Moreover, we also study the concepts of identity polynomials, and give a criterion for a polynomial to be identity polynomial.     

Approximations of almost periodic functions by entire ones

In this paper we propose a new proof of the well-known theorem by S. N. Bernstein, according to which among entire functions which give on (−∞,∞) the best uniform approximation of order σ of periodic functions there exists a trigonometric polynomial whose order does not exceed σ. We also prove an analog of this Bernstein theorem and an analog of the Jackson theorem for uniform almost periodic functions with an arbitrary spectrum.     

On a mild generalization of the Schönemann - Eisenstein - Dumas irreducibility criterion

We state a mild generalization of the classical Schönemann and Eisenstein- Dumas irreducibility criterion in ?[x] and provide an elementary proof. In the end of the paper, we also provide a concrete example of a polynomial which is irreducible by the main result of the paper but whose irreducibility does not follow from existing criteria.     

A variational proof for the existence of a conformal metric with preassigned negative Gaussian curvature for compact Riemann surfaces of genus > 1

Given a smooth functionK < 0 we prove a result by Berger, Kazhdan and others that in every conformal class there exists a metric which attains this function as its Gaussian curvature for a compact Riemann surface of genusg > 1. We do so by minimizing an appropriate functional using elementary analysis. In particular forK a negative constant, this provides an elementary proof of the uniformization theorem for compact Riemann surfaces of genusg > 1. An erratum to this article is available at .     

Curvature Symmetries

An alternative construction of Riemann curvature appeared in Acta Appl. Math. 59 (1999), 215–227, with a promise of a short direct proof of its symmetries. The present Section 5 repairs a flaw in the original Section 5, with the promised proof.     

Limit cycles of quadratic systems

In this paper, the global qualitative analysis of planar quadratic dynamical systems is established and a new geometric approach to solving Hilbert’s Sixteenth Problem in this special case of polynomial systems is suggested. Using geometric properties of four field rotation parameters of a new canonical system which is constructed in this paper, we present a proof of our earlier conjecture that the maximum number of limit cycles in a quadratic system is equal to four and their only possible distribution is (3:1) [V.A. Gaiko, Global Bifurcation Theory and Hilbert’s Sixteenth Problem, Kluwer, Boston, 2003]. Besides, applying the Wintner–Perko termination principle for multiple limit cycles to our canonical system, we prove in a different way that a quadratic system has at most three limit cycles around a singular point (focus) and give another proof of the same conjecture.     

Interpolation and convergence of Bernstein-Bézier coefficients

In this paper, two ways of the proof are given for the fact that the Bernstein-Bézier coefficients (BB-coefficients) of a multivariate polynomial converge uniformly to the polynomial under repeated degree elevation over the simplex. We show that the partial derivatives of the inverse Bernstein polynomial A _n (g) converge uniformly to the corresponding partial derivatives of g at the rate 1/n. We also consider multivariate interpolation for the BB-coefficients, and provide effective interpolation formulas by using Bernstein polynomials with ridge form which essentially possess the nature of univariate polynomials in computation, and show that Bernstein polynomials with ridge form with least degree can be constructed for interpolation purpose, and thus a computational algorithm is provided correspondingly.     

Correction to Generic polynomial vector fields are not integrable

In the paper Generic polynomial vector fields are not integrable [1], we study some generic aspects of polynomial vector fields or polynomial derivations with respect to their integration. Using direct sums of derivations together with our previous results we showed that, for all n ≥ 3 and s ≥ 2, the absence of polynomial first integrals, or even of Darboux polynomials, is generic for homogeneous polynomial vector fields of degree s in n variables. To achieve this task, we need an example of such vector fields of degree s ≥ 2 for any prime number n ≥ 3 of variables and also for n = 4. The purpose of this note is to correct a gap in our paper for n = 4 by completing the corresponding proof.     

Zum Nachweis arithmetischer Cohen-Macaulay Varietäten

There exist some useful methods for the calculation of Hilbert's function without using a free resolution of polynomial ideals (see for example [4], [10], [11] and the references in these papers). Using Bezout's theorem (in the sense ofW. Gröbner [3], 144.5) these methods are suited for a proof that special homogeneous polynomial ideals are imperfect, but not for the arithmetically Cohen-Macaulay property. It is the theorem of this paper that these gaps can be filled. This theorem therefore provides some proof that an arbitrary homogeneous polynomial ideal is perfect or imperfect. Our methods are demonstrated in three examples, taking the third example from the paper ofG. A. Reisner [7], p. 35 and, using our methods, we rather easily obtain the result of [7], that the Cohen-Macaulay property depends on the characteristic of the field. In the second example, we give some remarks on the usefulness of the definition for perfeet ideals ofF. S. Macaulay [5] (see also [6]). This also illustrates whyF. S. macaulay could only construct imperfect ideals-except such one obtainable by using ideals of the principal class.

---

---

Unserem Lehrer, Herrn Professor Dr. W. Gröbner, zum 80. Geburtstag in Verehrung gewidmet     

Real-root property of the spectral polynomial of the Treibich–Verdier potential and related problems

We study the spectral polynomial of the Treibich–Verdier potential. Such spectral polynomial, which is a generalization of the classical Lamé polynomial, plays fundamental roles in both the finite-gap theory and the ODE theory of Heun's equation. In this paper, we prove that all the roots of such spectral polynomial are real and distinct under some assumptions. The proof uses the classical concept of Sturm sequence and isomonodromic theories. We also prove an analogous result for a polynomial associated with a generalized Lamé equation, where we apply a new approach based on the viewpoint of the monodromy data.     

Hook Length Polynomials for Plane Forests of a Certain Type

The original motivation for the study of hook length polynomials was to find a combinatorial proof for a hook length formula for binary trees given by Postnikov, as well as a proof for a hook length polynomial formula conjectured by Lascoux. In this paper, we define the hook length polynomial for plane forests of a given degree sequence type and show that it can be factored into a product of linear forms. Some other enumerative results on forests are also given.     

Some Special Tauberian Theorems for Fourier Type Integrals and Eigenfunction Expansions of Sturm-Liouville Equations on the Whole Line

We offer a new proof of a special Tauberian theorem for Fourier type integrals. This Tauberian theorem was already considered by us in the papers [1] and [2]. The idea of our initial proof was simple, but the details were complicated because we used Bochner's definition of generalized Fourier transform for functions of polynomial growth. In the present paper we work with L. Schwartz's generalization. This leads to significant simplification. The paper consists of six sections. In Section 1 we establish an integral representation of functions of polynomial growth (subjected to some Tauberian conditions), in Section 2 we prove our main Tauberian theorems (Theorems 2.1 and 2.2.), using the integral representation of Section 1, in Section 3 we study the asymptotic behavior of M. Riesz's means of functions of polynomial growth, in Sections 4 and 5 we apply our Tauberian theorems to the problem of equiconvergence of eigenfunction expansions of Sturm-Liouville equations and expansion in ordinary Fourier integrals, and in Section 6 we compare our general equiconvergence theorems of Sections 4 and 5 with the well known theorems on eigenfunction expansions in classical orthogonal polynomials. In some sense this paper is a re-made survey of our results obtained during the period 1953-58. Another proof of our Tauberian theorem and some generalization can be found in the papers [3] and [4].     

Candidates for nonzero Betti numbers of monomial ideals

Let I be a monomial ideal in the polynomial ring S generated by elements of degree at most d. In this paper, it is shown that, if the i-th syzygy of I has no elements of degrees j,…,j+(d?1) (where j≥i+d), then (i+1)-th syzygy of I does not have any element of degree j+d. Then we give several applications of this result, including an alternative proof for Green–Lazarsfeld index of the edge ideals of graphs as well as an alternative proof for Fröberg’s theorem on classification of square-free monomial ideals generated in degree 2 with linear resolution. Among all, we deduce a partial result on subadditivity of the syzygies for monomial ideals.     

Fault Tolerance of Cayley Graphs

It is a difficult problem in general to decide whether a Cayley graph Cay(G; S) is connected where G is an arbitrary finite group and S a subset of G. For example, testing primitivity of an element in a finite field is a special case of this problem but notoriously hard. In this paper, it is shown that if a Cayley graph Cay(G; S) is known to be connected then its fault tolerance can be determined in polynomial time in |S|log(|G|). This is accomplished by establishing a new structural result for Cayley graphs. This result also yields a simple proof of optimal fault tolerance for an infinite class of Cayley graphs, namely exchange graphs. We also use the proof technique for our structural result to give a new proof of a known result on quasiminimal graphs. Received March 10, 2006     

Generalized matrix functions and determinants

In this paper we prove that, up to a scalar multiple, the determinant is the unique generalized matrix function that preserves the product or remains invariant under similarity. Also, we present a new proof for the known result that, up to a scalar multiple, the ordinary characteristic polynomial is the unique generalized characteristic polynomial for which the Cayley-Hamilton theorem remains true.