
Finding binomials in polynomial ideals
We describe an algorithm which finds binomials in a given ideal IāQ[x_1,...
read it

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials
Polynomial optimization problems over binary variables can be expressed ...
read it

The ndimensional kvector and its application to orthogonal range searching
This work focuses on the definition and study of the ndimensional kvec...
read it

Optimal monomial quadratization for ODE systems
Quadratization problem is, given a system of ODEs with polynomial right...
read it

Printable Aggregate Elements
Aggregating base elements into rigid objects such as furniture or sculpt...
read it

Similar Elements and Metric Labeling on Complete Graphs
We consider a problem that involves finding similar elements in a collec...
read it

Tasks that Require, or can Benefit from, Matching Blank Nodes
In various domains and cases, we observe the creation and usage of infor...
read it
Separating Variables in Bivariate Polynomial Ideals
We present an algorithm which for any given ideal Iāš [x,y] finds all elements of I that have the form f(x)  g(y), i.e., all elements in which no monomial is a multiple of xy.
READ FULL TEXT
Comments
There are no comments yet.