Related papers: Dimension Results for Extremal-Generic Polynomial …

We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…

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 consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem.…

We deal with the algebraicity of an iterated Puiseux series in several variables in terms of the properties of its coefficients. Our aim is to generalize to several variables the results from [HM15]. We show that the algebraicity of such a…

We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are…

We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Let $K$ be the field of Laurent series with complex coefficients, let $\mathcal{R}$ be the inverse limit of the standard-graded polynomial rings $K[x_1, \ldots, x_n]$, and let $\mathcal{R}^{\flat}$ be the subring of $\mathcal{R}$ consisting…

Let $\mathbf{K}$ be a field of characteristic zero with $\overline{\mathbf{K}}$ its algebraic closure. Given a sequence of polynomials $\mathbf{g} = (g_1, \ldots, g_s) \in \mathbf{K}[x_1, \ldots , x_n]^s$ and a polynomial matrix $\mathbf{F}…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

In this review, novel non-standard techniques for the computation of cohomology classes on toric varieties are summarized. After an introduction of the basic definitions and properties of toric geometry, we discuss a specific computational…

We show that a strong version of the geometric Merkurjev-Panin conjecture holds for the Cox category of a projective toric variety. That is, we prove that the full strong exceptional collection of Bondal-Thomsen line bundles is invariant…

In this paper we study a class of dynamical systems generated by iterations of multivariate permutation polynomial systems which lead to polynomial growth of the degrees of these iterations. Using these estimates and the same techniques…

In this paper we find monomial bases for the integer cohomology rings of compact wonderful models of toric arrangements. In the description of the monomials various combinatorial objects come into play: building sets, nested sets, and the…

We study projectivizations of a special class of toric vector bundles that includes cotangent bundles, whose associated Klyachko filtrations are particularly simple. For these projectivized bundles, we give generators for the cone of…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

The generalized Lax conjecture asserts that each hyperbolicity cone is a linear slice of the cone of positive semidefinite matrices. We prove the conjecture for a multivariate generalization of the matching polynomial. This is further…

We study sum of squares (SOS) relaxations to optimize polynomial functions over a set $V\cap R^n$, where $V$ is a complex algebraic variety. We propose a new methodology that, rather than relying on some algebraic description, represents…

In this expository note we discuss a class of graded algebras named Cox rings, which are naturally associated to algebraic varieties generalizing the homogeneous coordinate rings of projective spaces. Whenever the Cox ring is finitely…