Related papers: Coamoebas of polynomials supported on circuits
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
We study coupled systems of nonlinear lowest Landau level equations, for which we prove global existence results with polynomial bounds on the possible growth of Sobolev norms of the solutions. We also exhibit explicit unbounded…
We introduce the imaginary projection of a multivariate polynomial $f \in \mathbb{C}[\mathbf{z}]$ as the projection of the variety of $f$ onto its imaginary part, $\mathcal{I}(f) \ = \ \{\text{Im}(\mathbf{z}) \, : \, \mathbf{z} \in…
We introduce a notion of connected perimeter for planar sets defined as the lower semi-continuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is…
Polynomial convergence bounds are considered for left, right, and split preconditioned GMRES. They include the cases of Weighted and Deflated GMRES for a linear system Ax = b. In particular, the case of positive definite A is considered.…
This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…
In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…
Sparse polynomial systems with vertical coefficient dependencies arise naturally when describing the critical points of optimization problems and, when augmented with linear forms, the steady states of chemical reaction networks. Moreover,…
Connected components of real algebraic varieties invariant under the $CB_{n}$-Coxeter group are investigated. In particular, we consider their maximal number and their geometric and topological properties. This provides a decomposition for…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
Analytic and approximate solutions for the energy eigenvalues generated by a confined softcore Coulomb potentials of the form a/(r+\beta) in d>1 dimensions are constructed. The confinement is effected by linear and harmonic-oscillator…
Amoebas and coamoebas are the logarithmic images of algebraic varieties and the images of algebraic varieties under the arg-map, respectively. We present new techniques for computational problems on amoebas and coamoebas, thus establishing…
We say that a circuit $C$ over a field $F$ functionally computes an $n$-variate polynomial $P$ if for every $x \in \{0,1\}^n$ we have that $C(x) = P(x)$. This is in contrast to syntactically computing $P$, when $C \equiv P$ as formal…
We improve the Cauchy radius of both scalar and matrix polynomials, which is an upper bound on the moduli of the zeros and eigenvalues, respectively, by using appropriate polynomial multipliers.
In this article we combine two developments in polynomial optimization. On the one hand, we consider nonnegativity certificates based on sums of nonnegative circuit polynomials, which were recently introduced by the second and the third…
We study the fine geometric structure of bifurcation currents in the parameter space of cubic polynomials viewed as dynamical systems. In particular we prove that these currents have some laminar structure in a large region of parameter…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…