Related papers: Polynomial Roots and Calabi-Yau Geometries

We study the Poincare polynomials of all known Calabi-Yau three-folds as constrained polynomials of Littlewood type, thus generalising the well-known investigation into the distribution of the Euler characteristic and Hodge numbers. We find…

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

We introduce certain polynomials, so-called H.Weyl and H.Minkowski polynomials, which have a geometric origin. The location of roots of these polynomials is studied.

With a bird's-eye view, we survey the landscape of Calabi-Yau threefolds, compact and non-compact, smooth and singular. Emphasis will be placed on the algorithms and databases which have been established over the years, and how they have…

A "Littlewood polynomial" is a polynomial whose coefficients are all 1 or -1. The set of all complex roots of all Littlewood polynomials exhibits many complicated, beautiful and fascinating patterns. Some fractal regions of this set closely…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…

Polynomials whose coefficients, roots, and critical points lie in the ring of rational integers are called nice polynomials. In this paper, we present a general method for investigating such polynomials. We extend our results from the ring…

The algebraic approach to the construction of the reflexive polyhedra that yield Calabi-Yau spaces in three or more complex dimensions with K3 fibres reveals graphs that include and generalize the Dynkin diagrams associated with gauge…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…

We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…

Landau's work on the singularities of Feynman diagrams suggests that they can only be of three types: either poles, logarithmic divergences, or the roots of quadratic polynomials. On the other hand, many Feynman integrals exist whose…

We study the location and the size of the roots of Steiner polynomials of convex bodies in the Minkowski relative geometry. Based on a problem of Teissier on the intersection numbers of Cartier divisors of compact algebraic varieties it was…

At special loci in their moduli spaces, Calabi-Yau manifolds are endowed with discrete symmetries. Over the years, such spaces have been intensely studied and have found a variety of important applications. As string compactifications they…

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada…

This paper is devoted to several new results concerning (standard) octonion polynomials. The first is the determination of the roots of all right scalar multiples of octonion polynomials. The roots of left multiples are also discussed,…