Minimal Hamiltonian graphs with prescribed degree sets

Translated from Matematicheskie Zametki, Vol. 47, No. 4, pp. 115–127, April, 1990.     

The numerical condition of univariate and bivariate degree elevated Bernstein polynomials

The numerical condition of the degree elevation operation on Bernstein polynomials is considered and it is shown that it does not change the condition of the polynomial. In particular, several condition numbers for univariate and bivariate Bernstein polynomials, and their degree elevated forms, are developed and it is shown that the condition numbers of the degree elevated polynomials are identically equal to their forms prior to degree elevation. Computational experiments that verify this theoretical result are presented. The results in this paper differ from those in [Comput. Aided Geom. Design 4 (1987) 191–216] and [Comput. Aided Geom. Design 5 (1988) 215–252], where it is claimed that degree elevation causes a reduction in the numerical condition of a Bernstein polynomial. It is shown, however, that there is an error in the derivation of this result.     

On polynomials with a prescribed zero

Let us denote byΛ _{n, 1} the supremum of (max_∥z∥=1∥p′ _n (z)∥)/ (max_∥z∥=1∥p _n (z)∥) taken over all polynomialsp _n of degree at mostn having a zero on the unit circle {z ∈ C∶∥z∥=1}. We show that Λn.1=n-(π ²/16)(1/n)+O(1/n ².     

Random polynomials with prescribed Newton polytope

The Newton polytope of a polynomial is well known to have a strong impact on its behavior. The Bernstein-Kouchnirenko Theorem asserts that even the number of simultaneous zeros in of a system of polynomials depends on their Newton polytopes. In this article, we show that Newton polytopes also have a strong impact on the distribution of zeros and pointwise norms of polynomials, the basic theme being that Newton polytopes determine allowed and forbidden regions in for these distributions.

Our results are statistical and asymptotic in the degree of the polynomials. We equip the space of polynomials of degree in complex variables with its usual SU-invariant Gaussian probability measure and then consider the conditional measure induced on the subspace of polynomials with fixed Newton polytope . We then determine the asymptotics of the conditional expectation of simultaneous zeros of polynomials with Newton polytope as . When , the unit simplex, it is clear that the expected zero distributions are uniform relative to the Fubini-Study form. For a convex polytope , we show that there is an allowed region on which is asymptotically uniform as the scaling factor . However, the zeros have an exotic distribution in the complementary forbidden region and when (the case of the Bernstein-Kouchnirenko Theorem), the expected percentage of simultaneous zeros in the forbidden region approaches 0 as .

     

Primitive polynomials with a prescribed coefficient

The Hansen–Mullen [Math. Comput. 59 (1992) 639–643, S47–S50] conjecture on primitive polynomials is established for polynomials of degree at least nine. It postulates the existence of a primitive polynomial over any finite field with any specified coefficient arbitrarily prescribed. The theory extends to polynomials of smaller degree: work is in hand to fashion a proof in these cases too.     

Zeros of univariate interval polynomials

Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros is exactly n if multiplicities are counted. The boundaries of complex block zeros on a complex plane are analyzed. Numeric algorithms to bound interval zeros and complex block zeros are presented.     

A heuristic verification of the degree of the approximate GCD of two univariate polynomials

We consider the problem of computing verified real interval perturbations of the coefficients of two univariate polynomials such that there exist corresponding perturbed polynomials which have an exact greatest common divisor (GCD) of a given degree k. Based on the certification of the rank deficiency of a submatrix of the Bezout matrix of two univariate polynomials, we propose an algorithm to compute verified real perturbations. Numerical experiments show the performance of our algorithm.     

Primitive normal polynomials with a prescribed coefficient

In this paper, we established the existence of a primitive normal polynomial over any finite field with any specified coefficient arbitrarily prescribed. Let n15 be a positive integer and q a prime power. We prove that for any aF_q and any 1m<n, there exists a primitive normal polynomial f(x)=xⁿ−σ₁xⁿ⁻¹++(−1)ⁿ⁻¹σ_n−1x+(−1)ⁿσ_n such that σ_m=a, with the only exceptions σ₁≠0. The theory can be extended to polynomials of smaller degree too.     

Sparse univariate polynomials with many roots over finite fields

Suppose q is a prime power and $f\in {\mathbb{F}}_q[x]$ is a univariate polynomial with exactly t monomial terms and degree $<q-1$. To establish a finite field analogue of Descartes' Rule, Bi, Cheng, and Rojas (2013) proved an upper bound of $2{(q-1)}^{\frac{t-2}{t-1}}$ on the number of cosets in ${\mathbb{F}}_q^{⁎}$ needed to cover the roots of f in ${\mathbb{F}}_q^{⁎}$. Here, we give explicit f with root structure approaching this bound: When q is a perfect $(t-1)$-st power we give an explicit t-nomial vanishing on $q^{\frac{t-2}{t-1}}$ distinct cosets of ${\mathbb{F}}_q^{⁎}$. Over prime fields ${\mathbb{F}}_p$, computational data we provide suggests that it is harder to construct explicit sparse polynomials with many roots. Nevertheless, assuming the Generalized Riemann Hypothesis, we find explicit trinomials having $\mathrm{\Omega }\left(\frac{\log p}{\log \log p}\right)$ distinct roots in ${\mathbb{F}}_p$.     

Sobolev inner products and orthogonal polynomials of Sobolev type

This survey paper deals with polynomials which are orthogonal with respect to scalar products of the form _R F ^T[A]G withF ^T=[f(x), f(Ⅎ(x),...f ^(y)(x)], [A] A _ji =A _ji =A _ij =d _ji (I _ji ) where d _ji is a measure of supportI _ij and [A] is positive semi-definite. Basic properties are indicated or proved in particular cases.     

Spline polynomials with a prescribed sequence of extrema

In the present note a theorem about strong suitability of the space of algebraic polynomials of degree n in C[a,b] (Theorem A in [1]) is generalized to the space of spline polynomials _{[a, b} ^{]n, k} (n2, 0) in C[a, b]. Namely, it is shown that the following theorem is valid: for arbitrary numbers ₀, ₁, ..., _n+k, satisfying the conditions (_i–_i–1) (_{i+1{ i}< 0(i=1, ..., n +k–1), there is a unique polynomials _n,k (t) _{[a, b} ^]/n,k and pointsa=₀,<₁<...< _n+k– 1< _n+k = b (₁1 <_n, ..., _kk<_n+k–1), such that s_n,k(_i) = _i(i=0, ..., n + k), s_n,k(_i)=0 (i=1, ..., n + k–1).Translated from Matematicheskii Zametki, Vol. 11, No. 3, pp. 251–258, March, 1972.     

An inequality for polynomials with a prescribed zero

Let p_n(z)=∑_(k-0)~n a_kz~k be a polynomial of degree n such that |p_n(z)|≤M for |z|≤1. It is well.known that for 0≤u相似文献