Bounds for resultants of univariate and bivariate polynomials

The paper considers bounds on the size of the resultant for univariate and bivariate polynomials. For univariate polynomials we also extend the traditional representation of the resultant by the zeros of the argument polynomials to formal resultants, defined as the determinants of the Sylvester matrix for a pair of polynomials whose actual degree may be lower than their formal degree due to vanishing leading coefficients. For bivariate polynomials, the resultant is a univariate polynomial resulting by the elimination of one of the variables, and our main result is a bound on the largest coefficient of this univariate polynomial. We bring a simple example that shows that our bound is attainable and that a previous sharper bound is not correct.     

Analytic sets extending the graphs of holomorphic mappings

Let D, D′ ⊂ ℂⁿ be bounded domains with smooth real analytic boundaries and ƒ: D → D′ be a proper holomorphic map. Our main result implies that if the graph of ƒ extends as an analytic set to a neighborhood of a poìnt (a, a′) ∈ ∂D × 3D′ with a′ ∈ cl_ƒ(a), then ƒ extends holomorphically to a neighborhood of a.     

Finite-Term Relations for Planar Orthogonal Polynomials

We prove by elementary means that, if the Bergman orthogonal polynomials of a bounded simply-connected planar domain, with sufficiently regular boundary, satisfy a finite-term relation, then the domain is algebraic and characterized by the fact that Dirichlet’s problem with boundary polynomial data has a polynomial solution. This, and an additional compactness assumption, is known to imply that the domain is an ellipse. In particular, we show that if the Bergman orthogonal polynomials satisfy a three-term relation then the domain is an ellipse. This completes an inquiry started forty years ago by Peter Duren. To Peter Duren on the occasion of his seventieth birthday The first author was partially supported by the National Science Foundation Grant DMS- 0350911. Received: October 15, 2006. Revised: January 22, 2007.     

Invariant theory and reversible-equivariant vector fields

In this paper we present results for the systematic study of reversible-equivariant vector fields-namely, in the simultaneous presence of symmetries and reversing symmetries-by employing algebraic techniques from invariant theory for compact Lie groups. The Hilbert-Poincaré series and their associated Molien formulae are introduced, and we prove the character formulae for the computation of dimensions of spaces of homogeneous anti-invariant polynomial functions and reversible-equivariant polynomial mappings. A symbolic algorithm is obtained for the computation of generators for the module of reversible-equivariant polynomial mappings over the ring of invariant polynomials. We show that this computation can be obtained directly from a well-known situation, namely from the generators of the ring of invariants and the module of the equivariants.     

Condition R and proper holomorphic maps between equidimensional product domains

We consider proper holomorphic mappings of equidimensional pseudoconvex domains in complex Euclidean space, where both source and target can be represented as Cartesian products of smoothly bounded domains. It is shown that such mappings extend smoothly up to the closures of the domains, provided each factor of the source satisfies Condition R. It also shown that the number of smoothly bounded factors in the source and target must be the same, and the proper holomorphic map splits as a product of proper mappings between the factor domains.     

An algebraic characterization of holomorphic nondegeneracy for real algebraic hypersurfaces and its application to CR mappings

We give a new algebraic characterization of holomorphic nondegeneracy for embedded real algebraic hypersurfaces in , . We then use this criterion to prove the following result about real analyticity of smooth CR mappings: any smooth CR mapping H between a real analytic hypersurface and a rigid polynomial holomorphically nondegenerate hypersurface is real analytic, provided the map H is not totally degenerate in the sense of Baouendi and Rothschild. Received September 19, 1997     

Diophantine m-tuples for linear polynomials II. Equal degrees

In this paper we prove the best possible upper bounds for the number of elements in a set of polynomials with integer coefficients all having the same degree, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. Moreover, we prove that there does not exist a set of more than 12 polynomials with integer coefficients and with the property from above. This significantly improves a recent result of the first two authors with Tichy [A. Dujella, C. Fuchs, R.F. Tichy, Diophantine m-tuples for linear polynomials, Period. Math. Hungar. 45 (2002) 21-33].     

Localization principle of automorphisms on generalized pseudoellipsoids

We deduce global biholomorphic equivalence from local biholomorphic equivalence near boundary points in the class of generalized pseudoellipsoids, extending local biholomorphisms to global ones. We discuss related results on holomorphic proper maps.     

A local version of Levenberg's theorem on determining measures and Leja's polynomial condition

A local version of Levenberg's theorem characterizing Leja's polynomial condition in terms of determining measures is given. This yields a very short proof of the invariance of Leja's property under non-degenerate holomorphic maps.Research supported, in part, by KBN grant 2 1077 91 01.     

On proper holomorphic self-maps of generalized complex ellipsoids

The purpose of this paper is to prove that every proper holomorphic self-mapping of a Reinhardt domain Ω in C ⁿ which is a generalization of a complex ellipsoid is biholomorphic. The main novelty of our result is that Ω is a domain in C ⁿ such that it is allowed to have a boundary point at which the Levi determinant has infinite order of vanishing.     

Weakly continuous mappings on Banach spaces

It is shown that every n-homogeneous continuous polynomial on a Banach space E which is weakly continuous on the unit ball of E is weakly uniformly continuous on the unit ball of E. Applications of the result to spaces of polynomials and holomorphic mappings on E are given.     

Polynomials with and without determinantal representations

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov [9] have proved that any real zero polynomial in two variables has a determinantal representation. Brändén [2] has shown that the result does not extend to arbitrary numbers of variables, disproving the generalized Lax conjecture. We prove that in fact almost no real zero polynomial admits a determinantal representation; there are dimensional differences between the two sets. The result follows from a general upper bound on the size of linear matrix polynomials. We then provide a large class of surprisingly simple explicit real zero polynomials that do not have a determinantal representation. We finally characterize polynomials of which some power has a determinantal representation, in terms of an algebra with involution having a finite dimensional representation. We use the characterization to prove that any quadratic real zero polynomial has a determinantal representation, after taking a high enough power. Taking powers is thereby really necessary in general. The representations emerge explicitly, and we characterize them up to unitary equivalence.     

Rigidity of proper holomorphic mappings between nonequidimensional bounded symmetric domains

We prove that any proper holomorphic mapping from to is necessarily a totally geodesic isometric embedding with respect to their Bergman metrics and therefore is the standard linear embedding up to their automorphisms. The proof of the main result in this paper will be achieved by a differential-geometric study of a special class of complex geodesic curves on the bounded symmetric domains with respect to their Bergman metrics. Received: 31 October 2000; in final form: 2 July 2001/ Published online: 4 April 2002     

There are Salem Numbers of Every Trace

The existence of Salem numbers of every trace is proved; thenontrivial part of this result concerns Salem numbers of negativetrace. The proof has two main ingredients. The first is a novelconstruction, using pairs of polynomials whose zeros interlaceon the unit circle, of polynomials of specified negative tracehaving one factor a Salem polynomial, with any other factorsbeing cyclotomic. The second is an upper bound for the exponentof a maximal torsion coset of an algebraic torus in a varietydefined over the rationals. This second result, which may beof independent interest, has enabled the construction to berefined so as to avoid cyclotomic factors, giving a Salem polynomialof any specified trace, with a trace-dependent bound for itsdegree. It is also shown how this new interlacing constructioncan be easily adapted to produce Pisot polynomials, giving asimpler, and more explicit, construction for Pisot numbers ofarbitrary trace than was previously known. 2000 MathematicsSubject Classification 11R06.     

Irreducibility of polynomials modulo p via Newton polytopes

Ostrowski established in 1919 that an absolutely irreducible integral polynomial remains absolutely irreducible modulo all sufficiently large prime numbers. We obtain a new lower bound for the size of such primes in terms of the number of integral points in the Newton polytope of the polynomial, significantly improving previous estimates for sparse polynomials.     

On chromatic and flow polynomial unique graphs

It is known that the chromatic polynomial and flow polynomial of a graph are two important evaluations of its Tutte polynomial, both of which contain much information of the graph. Much research is done on graphs determined entirely by their chromatic polynomials and Tutte polynomials, respectively. Oxley asked which classes of graphs or matroids are determined by their chromatic and flow polynomials together. In this paper, we found several classes of graphs with this property. We first study which graphic parameters are determined by the flow polynomials. Then we study flow-unique graphs. Finally, we show that several classes of graphs, ladders, Möbius ladders and squares of n-cycle are determined by their chromatic polynomials and flow polynomials together. A direct consequence of our theorem is a result of de Mier and Noy [A. de Mier, M. Noy, On graphs determined by their Tutte polynomial, Graphs Comb. 20 (2004) 105-119] that these classes of graphs are Tutte polynomial unique.     

The Degree of Proper Holomorphic MappingsBetween Special Domains in C^n

Let Gi be closed Lie groups of U (n), Ω i be bounded Gi-invariant domains in C^n which contains 0, and O(C^n)^Gi = C, for i = 1, 2. It is known that if f : Ω 1 → Ω 2 is a proper holomorphic mapping, and f^-1{0} = {0}, then f is a polynomial mapping. In this paper, we provide an upper bound for the degree of such a polynomial mapping using the multiplicity of f .     

Complexity of solving parametric polynomial systems

In this paper, we present three algorithms: the first one solves zero-dimensional parametric homogeneous polynomial systems within single exponential time in the number n of unknowns; it decomposes the parameter space into a finite number of constructible sets and computes the finite number of solutions by parametric rational representations uniformly in each constructible set. The second algorithm factirizes absolutely multivariate parametic polynomials within single exponential time in n and in the upper bound d on the degree of the factorized polynomials. The third algorithm decomposes algebraic varieties defined by parametric polynomial systems of positive dimension into absolutely irreducible components uniformly in the values of the parameters. The complexity bound for this algorithm is double exponential in n. On the other hand, the lower bound on the complexity of the problem of resolution of parametric polynomial systems is double exponential in n. Bibliography: 72 titles.     

Number-theoretic properties of certain CR mappings

We first prove a uniqueness result for certain group-invariant CR mappings to hyperquadrics. For cyclic groups these mappings lead to a collection of polynomials ƒ_p,q (with integer coefficients) in two variables; here p and q are positive integers. We use the uniqueness result to prove some surprising number-theoretic results about the ƒ_p,q, in particular, ƒ_p,q is congruent to x^P + y^P modulo (p) (for P ≥ 2) if and only if p is prime. We also determine recurrence relations for these polynomials for q ≤ 3 and determine a functional equation for a generating function. Finally, we discuss the invariant polynomials that arise for certain representations of dihedral groups to illustrate the non-Abelian case.