Related papers: Toric Eigenvalue Methods for Solving Sparse Polyno…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

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}…

We investigate a version of Viro's method for constructing polynomial systems with many positive solutions, based on regular triangulations of the Newton polytope of the system. The number of positive solutions obtained with our method is…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

We use residue currents on toric varieties to obtain bounds on the degrees of solutions to polynomial ideal membership problems. Our bounds depend on (the volume of) the Newton polytope of the polynomial system and are therefore well…

Let G be a simply connected absolutely simple algebraic group defined over the field of real numbers R. Let H be a simply connected semisimple R-subgroup of G. We consider the homogeneous space X=G/H. We ask: How many connected components…

Consider the sub level set K := {x : g(x) $\le$ 1} where g is a positive and homogeneous polynomial. We show that its Lebesgue volume can be approximated as closely as desired by solving a sequence of generalized eigenvalue problems with…

We present a comprehensive analysis of an algorithm for evaluating high-dimensional polynomials that are invariant under permutations and rotations. The key bottleneck is the contraction of a high-dimensional symmetric and sparse tensor…

This paper considers sparse polynomial optimization with unbounded sets. When the problem possesses correlative sparsity, we propose a sparse homogenized Moment-SOS hierarchy with perturbations to solve it. The new hierarchy introduces one…

We give a short new computation of the quantum cohomology of an arbitrary smooth toric variety $X$, by showing directly that the Kodaira-Spencer map of Fukaya-Oh-Ohta-Ono defines an isomorphism onto a suitable Jacobian ring. The proof is…

Flexible sparsity regularization means stably approximating sparse solutions of operator equations by using coefficient-dependent penalizations. We propose and analyse a general nonconvex approach in this respect, from both theoretical and…

We study solutions of a homogeneous quadratic equation $q(x_0,\dots, x_n)=0$, defined over a field $K$, where the $x_i$ are themselves homogeneous polynomials of some degree $d$ in $r+1$ variables. Equivalently, we are looking at rational…

Given an arbitrary integer $d>0$, we construct a homogeneous ideal $I$ of the polynomial ring $S = K[x_1, \ldots, x_{3d}]$ in $3d$ variables over a filed $K$ for which $S/I$ is a Cohen--Macaulay ring of dimension $d$ with the property that,…

In this work, we study the problem of finding approximate, with minimum support set, solutions to matrix max-plus equations, which we call sparse approximate solutions. We show how one can obtain such solutions efficiently and in polynomial…

Real-world physical systems, like composite materials and porous media, exhibit complex heterogeneities and multiscale nature, posing significant computational challenges. Computational homogenization is useful for predicting macroscopic…

A general form of the covariance matrix function is derived in this paper for a vector random field that is isotropic and mean square continuous on a compact connected two-point homogeneous space and stationary on a temporal domain. A…

We consider the following basic problem: given an $n$-variate degree-$d$ homogeneous polynomial $f$ with real coefficients, compute a unit vector $x \in \mathbb{R}^n$ that maximizes $|f(x)|$. Besides its fundamental nature, this problem…

We present a series of numerical models suitable for X-ray polarimetry of accreting systems. Firstly, we provide a spectropolarimetric routine that integrates reflection from inner optically thick walls of a geometrical torus of arbitrary…

We study the problem of minimizing a multivariate polynomial function over the unit hypercube. By representing the polynomial through a hypergraph and exploiting its sparsity structure, we establish a new sufficient condition under which…

Based on a new atomic norm, we propose a new convex formulation for sparse matrix factorization problems in which the number of nonzero elements of the factors is assumed fixed and known. The formulation counts sparse PCA with multiple…