{"title":"论多元多项式理想中的变量分离问题","authors":"Manfred Buchacher, Manuel Kauers","doi":"arxiv-2405.19223","DOIUrl":null,"url":null,"abstract":"For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with\nn+m variables, we want to find all elements that can be written as f-g for some\nf in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that\ncontain no term involving at the same time one of the x_1,...,x_n and one of\nthe y_1,...,y_m. For principal ideals and for ideals of dimension zero, we give\na algorithms that compute all these polynomials in a finite number of steps.","PeriodicalId":501033,"journal":{"name":"arXiv - CS - Symbolic Computation","volume":"56 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Problem of Separating Variables in Multivariate Polynomial Ideals\",\"authors\":\"Manfred Buchacher, Manuel Kauers\",\"doi\":\"arxiv-2405.19223\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with\\nn+m variables, we want to find all elements that can be written as f-g for some\\nf in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that\\ncontain no term involving at the same time one of the x_1,...,x_n and one of\\nthe y_1,...,y_m. For principal ideals and for ideals of dimension zero, we give\\na algorithms that compute all these polynomials in a finite number of steps.\",\"PeriodicalId\":501033,\"journal\":{\"name\":\"arXiv - CS - Symbolic Computation\",\"volume\":\"56 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Symbolic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2405.19223\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Symbolic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.19223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
对于具有 n+m 个变量的多项式环 K[x_1,...,x_n,y_1,...,y_m] 中的给定理想 I,我们希望找到所有元素,对于 K[x_1,...,x_n] 中的某个 f 和 K[y_1,...,y_m] 中的某个 g,都可以写成 f-g,也就是说、即 I 中的所有元素都不包含同时涉及 x_1,...,x_n 中的一个项和 y_1,...,y_m 中的一个项。对于主理想和维数为零的理想,我们给出了用有限步数计算所有这些多项式的算法。
On the Problem of Separating Variables in Multivariate Polynomial Ideals
For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with
n+m variables, we want to find all elements that can be written as f-g for some
f in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that
contain no term involving at the same time one of the x_1,...,x_n and one of
the y_1,...,y_m. For principal ideals and for ideals of dimension zero, we give
a algorithms that compute all these polynomials in a finite number of steps.