二元多项式理想中分离变量

Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation Pub Date : 2020-02-04 DOI:10.1145/3373207.3404028

Manfred Buchacher, Manuel Kauers, G. Pogudin

{"title":"二元多项式理想中分离变量","authors":"Manfred Buchacher, Manuel Kauers, G. Pogudin","doi":"10.1145/3373207.3404028","DOIUrl":null,"url":null,"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.","PeriodicalId":186699,"journal":{"name":"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Separating variables in bivariate polynomial ideals\",\"authors\":\"Manfred Buchacher, Manuel Kauers, G. Pogudin\",\"doi\":\"10.1145/3373207.3404028\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":186699,\"journal\":{\"name\":\"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3373207.3404028\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3373207.3404028","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

我们提出了一种算法，该算法对任意给定的理想I≥K[x, y]求出I中所有具有f(x) - g(y)形式的元素，即其中没有单项是xy的倍数的所有元素。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Separating variables in bivariate polynomial ideals

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation

自引率

0.00%

发文量