Separating Variables in Bivariate Polynomial Ideals

2020/02/04 by Buchacher, Manfred, Kauers, Manuel, Pogudin, Gleb · 2 citations
#Commutative Algebra (math.AC) #FOS: Computer and information sciences #FOS: Mathematics #Symbolic Computation (cs.SC)

paper · doi:10.48550/arxiv.2002.01541

Abstract

We present an algorithm which for any given ideal I⊆\mathbbK [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.

Cited by

• x(1-t(x+x^-1))F(x;t) = x-tF(0;t)
• On finite orbits of infinite correspondences

Related

• Separating Variables in Bivariate Polynomial Ideals: the Local Case
• A note on Solving Parametric Polynomial Systems
• Finding all monomials in a polynomial ideal
• Efficiently Checking Separating Indeterminates
• Elimination ideal and bivariate resultant over finite fields