Separating Variables in Bivariate Polynomial Ideals

by   Manfred Buchacher, et al.

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.



page 1

page 2

page 3

page 4

āˆ™ 07/07/2016

Finding binomials in polynomial ideals

We describe an algorithm which finds binomials in a given ideal IāŠ‚Q[x_1,...
āˆ™ 11/15/2019

Integrality of Linearizations of Polynomials over Binary Variables using Additional Monomials

Polynomial optimization problems over binary variables can be expressed ...
āˆ™ 04/05/2020

The n-dimensional k-vector and its application to orthogonal range searching

This work focuses on the definition and study of the n-dimensional k-vec...
āˆ™ 10/25/2021

Computing elements of certain form in ideals to prove properties of operators

Proving statements about linear operators expressed in terms of identiti...
āˆ™ 03/14/2021

Optimal monomial quadratization for ODE systems

Quadratization problem is, given a system of ODEs with polynomial right-...
āˆ™ 03/21/2018

Similar Elements and Metric Labeling on Complete Graphs

We consider a problem that involves finding similar elements in a collec...
āˆ™ 02/29/2020

Effective Localization Using Double Ideal Quotient and Its Implementation

In this paper, we propose a new method for localization of polynomial id...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.