Factorization properties of birational mappings

We analyse birational mappings generated by transformations on q × q matrices which correspond respectively to two kinds of transformations: the matrix inversion and a permutation of the entries of the q × q matrix. Remarkable factorization properties emerge for quite general involutive permutations.

It is shown that factorization properties do exist, even for birational transformations associated with noninvolutive permutations of entries of q × q matrices, and even for more general transformation which are rational transformations but no longer birational. The existence of factorization relations independent of q, the size of the matrices, is underlined.

The relations between the polynomial growth of the complexity of the iterations, the existence of recursions in a single variable and the integrability of the mappings, are sketched for the permutations yielding these properties.

All these results show that permutations of the entries of the matrix yielding factorization properties are not so rare. In contrast, the occurrence of recursions in a single variable, or of the polynomial growth of the complexity are, of course, less frequent but not completely exceptional.     

Machines Over the Reals and Non-Uniformity

We survey the research performed in the last few years on a specific topic: the power of real machines over binary inputs. This research attempts to characterize the classes of decision problems over a finite alphabet - say {0,1} - which can be decided by real machines working under several resource restrictions. Non-uniformity appears here in a natural way. However, since this is a technical concept which is not widely known, we summarize in Section 2 some of the intuitive notions, as well as a few basic theorems related to it. In Section 3 we do this for the subject of real machines and then, in Section 4 we present the state of the art of the surveyed topic. We devote Section 1 to introduce the main concepts of complexity theory. Proofs in this article are quite sketchy and are included more to convey intuitive ideas than to completely prove the claimed statements. Bibliographical references to the original literature are supplied for the latter purpose.     

Robust Stability of Polynomials: New Approach

The problem of the robust stability of a Hurwitz polynomial which is the characteristic polynomial of a discrete-time linear time-invariant system is investigated. A new approach based on the Rouché theorem of classical complex analysis is adopted. An interesting sufficient condition for robust stability is derived. Three examples are included to support the theoretical result.     

On Measures Induced by Extremal Signatures in Best Real Polynomial Approximation

We consider the limit distribution of measures μ _n , that appear in extremal signatures in the best polynomial approximation of a real-valued function . Relations between structural properties of the function f and weak-star limit points of (μ _n ) _n are proved. April 4, 1996. Date revised: October 25, 1996.     

Witness sets of projections

Elimination is a basic algebraic operation which geometrically corresponds to projections. This article describes using the numerical algebraic geometric concept of witness sets to compute the projection of an algebraic set. The ideas described in this article apply to computing the image of an algebraic set under any linear map.     

The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method

For a compact set C, 1, we consider the Chebyshev problem

Relations between the support of a compactly supported function and the exponential-polynomials spanned by its integer translates

The interrelation between the shape of the support of a compactly supported function and the space of all exponential-polynomials spanned by its integer translates is examined. The results obtained are in terms of the behavior of these exponential-polynomials on certain finite subsets ofZ ^s , which are determined by the support of the given function. Several applications are discussed. Among these is the construction of quasi-interpolants of minimal support and the construction of a piecewise-polynomial whose integer translates span a polynomial space which is not scale-invariant. As to polynomial box splines, it is proved here that in many cases a polynomial box spline admits a certain optimality condition concerning the space of the total degree polynomials spanned by its integer translates: This space is maximal compared with the spaces corresponding to other functions with the same supportCommunicated by Klaus Höllig.     

On a Problem of Byrnes concerning Polynomials with Restricted Coefficients

We consider a question of Byrnes concerning the minimal degree of a polynomial with all coefficients in which has a zero of a given order at . For , we prove his conjecture that the monic polynomial of this type of minimal degree is given by , but we disprove this for . We prove that a polynomial of this type must have , which is in sharp contrast with the situation when one allows coefficients in . The proofs use simple number theoretic ideas and depend ultimately on the fact that .

     

A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems

There are many interior-point algorithms for LP (linear programming), QP (quadratic programming), and LCPs (linear complementarity problems). While the algebraic definitions of these problems are different from each other, we show that they are all of the same general form when we define the problems geometrically. We derive some basic properties related to such geometrical (monotone) LCPs and based on these properties, we propose and analyze a simple infeasible-interior-point algorithm for solving geometrical LCPs. The algorithm can solve any instance of the above classes without making any assumptions on the problem. It features global convergence, polynomial-time convergence if there is a solution that is smaller than the initial point, and quadratic convergence if there is a strictly complementary solution.This research was performed while the first author was visiting the Institute of Applied Mathematics and Statistics, Würzburg University as a Research Fellow of the Alexander von Humboldt Foundation.     

On the number of invariant lines for polynomial systems

In this paper we will revise the mistakes in a previous paper of Zhang Xikang (Number of integral lines of polynomial systems of degree three and four, J. Nanjing Univ. Math. Biquarterly, Supplement, 1993, pp. 209-212) for the proof of the conjecture on the maximum number of invariant straight lines of cubic and quartic polynomial differential systems; and also prove the conjecture in a previous paper of the second author (Qualitative theory of polynomial differential systems, Shanghai Science-Technical Publishers, Shanghai, 1995, p. 474) for a certain special case of the degree polynomial systems. Furthermore, we will prove that cubic and quartic differential systems have invariant straight lines along at most six and nine different directions, respectively, and also show that the maximum number of the directions can be obtained.