Related papers: Multiplicity Estimates: a Morse-theoretic approach

Mahler's measure is generalized to create the class of {\it multiplicative distance functions}. These functions measure the complexity of polynomials based on the location of their zeros in the complex plane. Following work of S.-J. Chern…

In this paper we consider images of (ordinary) noncommutative polynomials on matrix algebras endowed with a graded structure. We give necessary and sufficient conditions to verify that some multilinear polynomial is a central polynomial, or…

This paper considers Bayesian multiple testing under sparsity for polynomial-tailed distributions satisfying a monotone likelihood ratio property. Included in this class of distributions are the Student's t, the Pareto, and many other…

A theorem of Kushnirenko and Bernstein shows that the number of isolated roots of a system of polynomials in a torus is bounded above by the mixed volume of the Newton polytopes of the given polynomials, and this upper bound is generically…

In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…

We develop a number of general techniques for comparing analytifications and tropicalizations of algebraic varieties. Our basic results include a projection formula for tropical multiplicities and a generalization of the Sturmfels-Tevelev…

We exhibit some nontrivial evaluations of the areal Mahler measure of multivariable polynomials, defined by Pritsker [Pri08] by considering the integral over the product of unit disks instead of the unit torus as in the standard case. As in…

Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…

The Mahler measure of a nonzero $n$-variable polynomial $P$ is the integral of $\log|P|$ on the unit $n$-torus. A result of Boyd and Lawton says that the Mahler measure of a multivariate polynomial is the limit of Mahler measures of…

We consider the problem of interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Building on the algorithm of Ben-Or and Tiwari for interpolating polynomials over rings with characteristic zero,…

We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…

Given a graph $G$ and collection of subgraphs $T$ (called tiles), we consider covering $G$ with copies of tiles in $T$ so that each vertex $v\in G$ is covered with a predetermined multiplicity. The multinomial tiling model is a natural…

Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…

We review the theory of optimal polynomial and rational Chebyshev approximations, and Zolotarev's formula for the sign function over the range (\epsilon \leq |z| \leq1). We explain how rational approximations can be applied to large sparse…

A new approximation method for inverting the Poisson's equation is presented for a continuously distributed and finite-sized source in an unbound domain. The advantage of this image multipole method arises from its ability to place the…

In this paper, we consider periodic solutions of the $n$-body problem that satisfy symmetry constraints, expressed through invariance under finite group actions. We focus on their stability properties and present algorithms specifically…

By defining multiplicities for zeros of polynomials over hyperfields, Baker and Lorscheid were able to provide a unifying perspective on Descartes's rule and the Newton polygon rule for polynomials over a formally-real and valued field…

Closely following recent ideas of J. Borcea, we discuss various modifications and relaxations of Sendov's conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated…

First a formula for the number of zeros of the orthogonal polynomial in the intervals is presented. Then a criteria about the appearance of a zero in a gap is given. Finally a necessary and sufficient condition is derived such that the…

In this work, we develop a variant of a bundle method in order to find a zero of a maximal monotone operator. This algorithm relies on two polyhedral approximations of the epsilon-enlargement of the considered operator, via a systematic use…