Separating variables in bivariate polynomial ideals

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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

Original languageEnglish
Title of host publicationISSAC 2020 - Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation
EditorsAngelos Mantzaflaris
PublisherAssociation for Computing Machinery
Pages54-61
Number of pages8
ISBN (Electronic)9781450371001
DOIs
Publication statusPublished - 20 Jul 2020
Event45th International Symposium on Symbolic and Algebraic Computation, ISSAC 2020 - Kalamata, Virtual, Greece
Duration: 20 Jul 202023 Jul 2020

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference45th International Symposium on Symbolic and Algebraic Computation, ISSAC 2020
Country/TerritoryGreece
CityKalamata, Virtual
Period20/07/2023/07/20

Fingerprint

Dive into the research topics of 'Separating variables in bivariate polynomial ideals'. Together they form a unique fingerprint.

Cite this