Related papers: Elimination by Substitution

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for, parametric optimization. The idea is to first consider the variable x1 as a parameter and solve the…

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…

This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…

Given a standard graded polynomial ring $R=k[x_1,...,x_n]$ over a field $k$ of characteristic zero and a graded $k$-subalgebra $A=k[f_1,...,f_m]\subset R$, one relates the module $\Omega_{A/k}$ of K\"ahler $k$-differentials of $A$ to the…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

An algorithm for irreducible decomposition of representations of finite groups over fields of characteristic zero is described. The algorithm uses the fact that the decomposition induces a partition of the invariant inner product into a…

We seek complex roots of a univariate polynomial $P$ with real or complex coefficients. We address this problem based on recent algorithms that use subdivision and have a nearly optimal complexity. They are particularly efficient when only…

Matrices can be decomposed via rank-one approximations: the best rank-one approximation is a singular vector pair, and the singular value decomposition writes a matrix as a sum of singular vector pairs. The singular vector tuples of a…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a finitely generated $K$-algebra with the PBW $K$-basis ${\cal B}=\{a_{1}^{\alpha_1}\cdots a_{n}^{\alpha_n}~|~(\alpha_1,\ldots ,\alpha_n)\in\mathbb{N}^n\}$. It is shown that if $L$ is a nonzero…

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…

In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…

We consider two basic algorithmic problems concerning tuples of (skew-)symmetric matrices. The first problem asks to decide, given two tuples of (skew-)symmetric matrices $(B_1, \dots, B_m)$ and $(C_1, \dots, C_m)$, whether there exists an…

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of $\mathds{1}_{\{p\leq0\}}$ to the image plane, where $\mathds{1}$ denotes the indicator function…