Related papers: Polynomial Roots and Calabi-Yau Geometries

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

An overview is given of the construction of a differential polynomial ring of functions on the moduli space of Calabi-Yau threefolds. These rings coincide with the rings of quasi modular forms for geometries with duality groups for which…

These notes contain a brief introduction to the construction of toric Calabi--Yau hypersurfaces and complete intersections with a focus on issues relevant for string duality calculations. The last two sections can be read independently and…

The algorithms of Pan (1995) and(2002) approximate the roots of a complex univariate polynomial in nearly optimal arithmetic and Boolean time but require precision of computing that exceeds the degree of the polynomial. This causes…

We introduce a family of 3-variable "Farey polynomials" that are closely connected with the geometry and topology of $3$-manifolds and orbifolds as they can be used to produce concrete realisations of the boundaries and local coordinates…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…

In this paper, we study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is either an arc,…

The paper studies the question of existence of polynomials with given roots over associative non-commutative rings with identity. It is shown that in the case of an associative division ring for arbitrary n elements of this ring there…

For certain polynomials we relate the number of roots inside the unit circle with the index of a non-degenerate isolated umbilic point on a real analytic surface in Euclidean 3-space. In particular, for $N>0$ we prove that for a certain…

A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…

This paper is concerned with the distribution in the complex plane of the roots of a polynomial sequence $\{W_n(x)\}_{n\ge0}$ given by a recursion $W_n(x)=aW_{n-1}(x)+(bx+c)W_{n-2}(x)$, with $W_0(x)=1$ and $W_1(x)=t(x-r)$, where $a>0$,…

We study classical twists of Lie bialgebra structures on the polynomial current algebra $\mathfrak{g}[u]$, where $\mathfrak{g}$ is a simple complex finite-dimensional Lie algebra. We focus on the structures induced by the so-called…

Cyclotomic polynomials play an important role in several areas of mathematics and their study has a very long history, which goes back at least to Gauss (1801). In particular, the properties of their coefficients have been intensively…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

We give a short overview over recent work on finding constraints on partition functions of 2d CFTs from modular invariance. We summarize the constraints on the spectrum and their connection to Calabi-Yau compactifications.

The moduli space of the Calabi-Yau three-folds, which play a role as superstring ground states, exhibits the same {\em special geometry} that is known from nonlinear sigma models in $N=2$ supergravity theories. We discuss the symmetry…

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. The chain polynomials of the partition lattices and their standard type $B$ analogues are shown to have only real roots.…

Univariate polynomial root-finding is both classical and 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 polynomial…

The present paper is a continuation of [5], where Lie bialgebra structures on g[u] were studied. These structures fall into different classes labelled by the vertices of the extended Dynkin diagram of g. In [5] the Lie bialgebras…

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…