Related papers: Experiments on the zeros of harmonic polynomials u…
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
We study the stratification of the space of monic polynomials with real coefficients according to the number and multiplicities of real zeros. In the first part, for each of these strata we provide a purely combinatorial chain complex…
We study a family of symmetric polynomials that we refer to as the Boolean product polynomials. The motivation for studying these polynomials stems from the computation of the characteristic polynomial of the real matroid spanned by the…
We present the results of systematic numerical computations relating to the extreme value statistics of the characteristic polynomials of random unitary matrices drawn from the Circular Unitary Ensemble (CUE) of Random Matrix Theory. In…
We construct an effective algorithmic method to compute the homological monodromy of a complex polynomial which is tame. As an application we show the existence of conjugated polynomials in a number field which are not topologically…
Some years ago, the harmonic polynomial was introduced in order to understand better the harmonic topological index; for instance, it allows to obtain bounds of the harmonic index of the main products of graphs. Here, we obtain several…
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…
Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…
In this paper, we determine the numb er of zeros and the zero inclusion regions of a two-parameter family of harmonic quadrinomials. We also determine a curve that separates sense-preserving and sense-reversing regions for these families of…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…
This paper gives the first algorithm for finding a set of natural $\epsilon$-clusters of complex zeros of a triangular system of polynomials within a given polybox in $\mathbb{C}^n$, for any given $\epsilon>0$. Our algorithm is based on a…
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…
We study the supremum of some random Dirichlet polynomials and obtain sharp upper and lower bounds for supremum expectation that extend the optimal estimate of Hal\'asz-Queff\'elec and enable to cunstruct random polynomials with unusually…
Various methods can obtain certified estimates for roots of polynomials. Many applications in science and engineering additionally utilize the value of functions evaluated at roots. For example, critical values are obtained by evaluating an…
Quaternions, introduced by Hamilton in 1843 as a generalization of complex numbers, have found, in more recent years, a wealth of applications in a number of different areas which motivated the design of efficient methods for numerically…
The main aim of this work is to apply the matrix approach of ortho\-gonal polynomials associated with infinite Hermitian definite positive matrices in relation with an important question regarding the location of zeros of Sobolev orthogonal…
The expected number of real zeros of an algebraic polynomial $a_0+a_1x+a_2x^2+a_3x^3+....+a_{n-1}x^{n-1}$ depends on the types of random coefficients, with large $n.$ In this article, we show that when the random coefficients…
We consider the problem of determining the maximum number of common zeros in a projective space over a finite field for a system of linearly independent multivariate homogeneous polynomials defined over that field. There is an elaborate…