Relationship between the zeros of two polynomials

In this paper, we shall follow a companion matrix approach to study the relationship between zeros of a wide range of pairs of complex polynomials, for example, a polynomial and its polar derivative or Sz.-Nagy’s generalized derivative. We shall introduce some new companion matrices and obtain a generalization of the Weinstein-Aronszajn Formula which will then be used to prove some inequalities similar to Sendov conjecture and Schoenberg conjecture and to study the distribution of equilibrium points of logarithmic potentials for finitely many discrete charges. Our method can also be used to produce, in an easy and systematic way, a lot of identities relating the sums of powers of zeros of a polynomial to that of the other polynomial.     

Schanuel's Conjecture and Algebraic Roots of Exponential Polynomials

In this article, I will prove that assuming Schanuel's conjecture, an exponential polynomial with algebraic coefficients can have only finitely many algebraic roots. Furthermore, this proof demonstrates that there are no unexpected algebraic roots of any such exponential polynomial. This implies a special case of Shapiro's conjecture: if p(x) and q(x) are two exponential polynomials with algebraic coefficients, each involving only one iteration of the exponential map, and they have common factors only of the form exp (g) for some exponential polynomial g, then p and q have only finitely many common zeros.     

Some Inequalities for the Polar Derivative of Polynomials in Complex Domain

Let p(z) be a polynomial of degree n. In this paper we prove results concerning maximum modulus of the polar derivative of p(z) with restricted zeros. Our results refine and generalize certain well-known polynomial inequalities.     

Asymptotic positivity of Hurwitz product traces: Two proofs

Consider the polynomial tr(A+tB)^m in t for positive hermitian matrices A and B with m∈N. The Bessis-Moussa-Villani conjecture (in the equivalent form of Lieb and Seiringer) states that this polynomial has nonnegative coefficients only. We prove that they are at least asymptotically positive, for the nontrivial case of AB≠0. More precisely, we show—once complex-analytically, once combinatorially—that the k-th coefficient is positive for all integer m?m₀, where m₀ depends on A, B and k.     

On the zeros of basic finite Hankel transforms

In this article we prove that the basic finite Hankel transform whose kernel is the third-type Jackson q-Bessel function has only infinitely many real and simple zeros, provided that q satisfies a condition additional to the standard one. We also study the asymptotic behavior of the zeros. The obtained results are applied to investigate the zeros of q-Bessel functions as well as the zeros of q-trigonometric functions. A basic analog of a theorem of G. Pólya (1918) on the zeros of sine and cosine transformations is also given.     

Some generalizations involving the polar derivative for an inequality of Paul Turán

Let p(z) be a polynomial of degree n and for a complex number α, let D _α p(z) = np(z) + (α-z)p'(z) denote the polar derivative of the polynomial p(z) with respect to α. In this paper, we obtain inequalities for the polar derivative of a polynomial having all its zeros in |z| ≤ K. Our results generalize and sharpen a famous inequality of Turán and some other known results in this direction.     

The colored Jones polynomial and the A-polynomial of Knots

We study relationships between the colored Jones polynomial and the A-polynomial of a knot. The AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial is established for a large class of two-bridge knots, including all twist knots. We formulate a weaker conjecture and prove that it holds for all two-bridge knots. Along the way we also calculate the Kauffman bracket skein module of the complements of two-bridge knots. Some properties of the colored Jones polynomial are established.     

Extensions of some polynomial inequalities to the polar derivative

Let p(z) be a polynomial of degree n and for any real or complex number α, let Dαp(z)=np(z)+(α−z)p^′(z) denote the polar derivative of the polynomial p(z) with respect to α. In this paper, we obtain inequalities for the polar derivative of a polynomial having all its zeros inside or outside a circle. Our results shall generalize and sharpen some well-known polynomial inequalities.     

Polynomials whose coefficients coincide with their zeros

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results. We obtain estimates on the number of Ulam polynomials of degree N. We provide additional methods to obtain algebraic identities satisfied by the zeros of Ulam polynomials, beyond the straightforward comparison of their zeros and coefficients. To address the question about the existence of orthogonal Ulam polynomial sequences, we show that the only Ulam polynomial eigenfunctions of hypergeometric type differential operators are the trivial Ulam polynomials \(\{x^N\}_{N=0}^\infty \). We propose a family of solvable N-body problems such that their stable equilibria are the zeros of certain Ulam polynomials.     

Bi-orthogonality and zeros of transformed polynomials

Let D and E be two real intervals. We consider transformations that map polynomials with zeros in D into polynomials with zeros in E. A general technique for the derivation of such transformations is presented. It is based on identifying the transformation with a parametrised distribution φ (x, µ), x ∈ E, µ ∈ D, and forming the bi-orthogonal polynomial system with respect to φ. Several examples of such transformations are given.     

Weighing Matrices and String Sorting

In this paper we establish a fundamental link between the search for weighing matrices constructed from two circulants and the operation of sorting strings, an operation that has been studied extensively in computer science. In particular, we demonstrate that the search for weighing matrices constructed from two circulants using the power spectral density criterion and exploiting structural patterns for the locations of the zeros in candidate solutions, can be viewed as a string sorting problem together with a linear time algorithm to locate common strings in two sorted arrays. This allows us to bring into bear efficient algorithms from the string sorting literature. We also state and prove some new enhancements to the power spectral density criterion, that allow us to treat successfully the rounding error effect and speed up the algorithm. Finally, we use these ideas to find new weighing matrices of order 2n and weights 2n – 13, 2n – 17 constructed from two circulants.     

Attractors and recurrence for dendrite-critical polynomials

We call a rational map f dendrite-critical if all its recurrent critical points either belong to an invariant dendrite D or have minimal limit sets. We prove that if f is a dendrite-critical polynomial, then for any conformal measure μ either for almost every point its limit set coincides with the Julia set of f, or for almost every point its limit set coincides with the limit set of a critical point c of f. Moreover, if μ is non-atomic, then c can be chosen to be recurrent. A corollary is that for a dendrite-critical polynomial and a non-atomic conformal measure the limit set of almost every point contains a critical point.     

Polynomial time approximation schemes and parameterized complexity

In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP optimization problem has a fully polynomial time approximation scheme if and only if the problem is polynomial fixed-parameter tractable. By enforcing a constraint of planarity on the W-hierarchy studied in parameterized complexity theory, we obtain a class of NP optimization problems, the planar W-hierarchy, and prove that all problems in this class have efficient polynomial time approximation schemes (EPTAS). The planar W-hierarchy seems to contain most of the known EPTAS problems, and is significantly different from the class introduced by Khanna and Motwani in their efforts in characterizing optimization problems with polynomial time approximation schemes.     

Lemniscates and inequalities for the logarithmic capacities of continua

It is shown that if P(z) = z ⁿ + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2^?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.     

Applications of the monotonicity of extremal zeros of orthogonal polynomials in interlacing and optimization problems

We investigate monotonicity properties of extremal zeros of orthogonal polynomials depending on a parameter. Using a functional analysis method we prove the monotonicity of extreme zeros of associated Jacobi, associated Gegenbauer and q-Meixner-Pollaczek polynomials. We show how these results can be applied to prove interlacing of zeros of orthogonal polynomials with shifted parameters and to determine optimally localized polynomials on the unit ball.     

Extension of two theorems of Payne to some nonlinear Dirichlet problems

In this paper we prove that under certain convexity and symmetry assumptions on a domain in the plane any positive solutionu, of Δu+λf(u)=0, in,D,u=0 on ?D has only one interior critical point. This extends results of L. E. Payne [1].     

Asymptotic behavior of a class of nonlinear evolution equations

In this paper, using a new method (or technology), we prove the existence and upper semi-continuity of the global attractors A_ω for a class of nonlinear evolution equations in D(A)×D(A), where the nonlinear term f satisfies a critical exponential growth condition.     

Mesoscopic fluctuations of the zeta zeros

We prove a multidimensional extension of Selberg’s central limit theorem for log ζ, in which non-trivial correlations appear. In particular, this answers a question by Coram and Diaconis about the mesoscopic fluctuations of the zeros of the Riemann zeta function. Similar results are given in the context of random matrices from the unitary group. This shows the correspondence n ? log t not only between the dimension of the matrix and the height on the critical line, but also, in a local scale, for small deviations from the critical axis or the unit circle.     

On the convergence of Wang-Zheng's method

The choice of initial conditions ensuring safe convergence of the implemented iterative method is one of the most important problems in solving polynomial equations. These conditions should depend only on the coefficients of a given polynomial P and initial approximations to the zeros of P. In this paper we state initial conditions with the described properties for the Wang-Zheng method for the simultaneous approximation of all zeros of P. The safe convergence and the fourth-order convergence of this method are proved.