Related papers: Coamoebas of polynomials supported on circuits

We link the study of positive quantum maps, block positive operators, and entanglement witnesses with problems related to multivariate polynomials. For instance, we show how indecomposable block positive operators relate to biquadratic…

To any algebraic curve A in a complex 2-torus $(\C^*)^2$ one may associate a closed infinite region in a real plane called the amoeba of A. The amoebas of different curves of the same degree come in different shapes and sizes. All amoebas…

Every finite collection of oriented closed geodesics in the modular surface has a canonically associated link in its unit tangent bundle coming from the periodic orbits of the geodesic flow. We study the volume of the associated link…

We study cohomology with coefficients in a rank one local system on the complement of an arrangement of hyperplanes $\A$. The cohomology plays an important role for the theory of generalized hypergeometric functions. We combine several…

Let {f_t} be any algebraic family of rational maps of a fixed degree, with a marked critical point c(t). We first prove that the hypersurfaces of parameters for which c(t) is periodic converge as a sequence of positive closed (1,1) currents…

Consider polynomial maps $f:\C\to\C$ of degree $d\ge 2$, or more generally polynomial maps from a finite union of copies of $\C$ to itself. In the space of suitably normalized maps of this type, the hyperbolic maps form an open set called…

We give a proof of a Conjecture of Walker which states that one can recover the lengths of the bars of a circular linkage from the cohomology ring of the configuration space. For a large class of length vectors, this has been shown by…

We discuss ways in which tools from topology can be used to derive lower bounds for the circuit complexity of Boolean functions.

This paper studies the polynomial stabilization of an elastic plate with dynamical boundary conditions on a non-smooth domain. To deal with the possible loss of solution regularity induced by boundary singularities, we formulate the problem…

Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…

Circuit polynomials are polynomials satisfying a number of conditions that make it easy to compute sharp and certifiable global lower bounds for them. Consequently, one may use them to find certifiable lower bounds for any polynomial by…

We consider the problem of assigning radii to a given set of points in the plane, such that the resulting set of circles is connected, and the sum of radii is minimized. We show that the problem is polynomially solvable if a connectivity…

We present new bounds for the numerical radius of bounded linear operators and $2\times 2$ operator matrices. We apply upper bounds for the numerical radius to the Frobenius companion matrix of a complex monic polynomial to obtain new…

In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…

Verification is one of the central tasks during circuit design. While most of the approaches have exponential worst-case behaviour, in the following techniques are discussed for proving polynomial circuit verification based on Binary…

Systems of orthogonal polynomials whose recurrence coefficients tend to infinity are considered. A summability condition is imposed on the coefficients and the consequences for the measure of orthogonality are discussed. Also discussed are…

In this paper we define the coarse (co)homology of the complement of a subspace in a metric space, generalizing the coarse (co)homology of Roe. We give a model space which encodes coarse geometric structure of the complement. We also…

Geometric modeling of multivariate reliability polynomials is based on algebraic hypersurfaces, constant level sets, rulings etc. The solved basic problems are: (i) find the reliability polynomial using the Maple and Matlab software…

Let p be a monic polynomial in one complex variable and K a measurable subset of the complex plane. In terms of the area of K, we give an upper bound on the area of the preimage of K under p and a lower bound on the area of the image of K…

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…