Related papers: Polynomial Roots and Calabi-Yau Geometries

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In…

We present new complete Calabi-Yau metrics defined on the complement of a smooth anticanonical divisor with ample normal bundle, approaching the Calabi model space at a polynomial rate. Moreover, we establish the uniqueness of this type of…

This paper gives a leisurely introduction to Calabi-Yau manifolds and special Lagrangian submanifolds from the differential geometric point of view, followed by a survey of recent results on singularities of special Lagrangian submanifolds,…

The Poincare conjecture is analyzed in the context of Calabi-Yau $n$-folds. A simple treatment is given by embedding the three-manifolds into these CY manifolds, and then taking the orbifold limit. The higher-dimensional proofs are also…

We investigate the construction of circulant matrices derived from primitive roots over finite fields. Our approach reduces exponential sums to Jacobi sums, thereby establishing explicit connections between character theory and matrix…

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

In this article, we study the global dynamics of Halley's method applied to complex polynomials. Specifically, we analyze the structure and connectivity of the Julia set of this method. The convergence behavior, symmetry properties, and…

We study the differential polynomial rings which are defined using the special geometry of the moduli spaces of Calabi-Yau threefolds. The higher genus topological string amplitudes are expressed as polynomials in the generators of these…

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

This paper contains a preliminary study of the monodromy of certain fourth order differential equations, that were called of Calabi-Yau type in math.NT/0402386. Some of these equations can be interpreted as the Picard-Fuchs equations of a…

This article is divided in two parts. In the first part we review some recent results concerning the expected number of real roots of random system of polynomial equations. In the second part we deal with a different problem, namely, the…

A proof is sketched of the Polynomial Conjecture of the author (circulated as preprint "Brick Tiling and Monotone Boolean Functions", available at the http://www.math.ufl.edu/~squash/tilingstuff.html url) which says that the family of…

The theory of coverings of the two-dimensional torus is a standard part of algebraic topology and has applications in several topics in string theory, for example, in topological strings. This paper initiates applications of this theory to…

We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…

This work studies combinatorics and geometry of the Yoccoz puzzle for quadratic polynomials. It is proven that the moduli of the ``principal nest'' of annuli grow at linear rate. As a corollary we obtain complex a priori bounds and local…

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

We study rigidity of rational maps that come from Newton's root finding method for polynomials of arbitrary degrees. We establish dynamical rigidity of these maps: each point in the Julia set of a Newton map is either rigid (i.e. its orbit…