多元洛朗级数的算法

IF 0.4 Q4 MATHEMATICS, APPLIED ACM Communications in Computer Algebra Pub Date : 2022-06-01 DOI:10.1145/3572867.3572877

J. P. Trochez, M. M. Maza, M. Calder, E. Postma

{"title":"多元洛朗级数的算法","authors":"J. P. Trochez, M. M. Maza, M. Calder, E. Postma","doi":"10.1145/3572867.3572877","DOIUrl":null,"url":null,"abstract":"Let K be a field and x1 < ··· < xn be ordered variables. Consider a set of polynomials F ⊂ K[x1,...,xn]. If the zero set V(F) of F is of positive dimension, then any triangular decomposition","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"56 1","pages":"64 - 67"},"PeriodicalIF":0.4000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithms for multivariate laurent series\",\"authors\":\"J. P. Trochez, M. M. Maza, M. Calder, E. Postma\",\"doi\":\"10.1145/3572867.3572877\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let K be a field and x1 < ··· < xn be ordered variables. Consider a set of polynomials F ⊂ K[x1,...,xn]. If the zero set V(F) of F is of positive dimension, then any triangular decomposition\",\"PeriodicalId\":41965,\"journal\":{\"name\":\"ACM Communications in Computer Algebra\",\"volume\":\"56 1\",\"pages\":\"64 - 67\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Communications in Computer Algebra\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3572867.3572877\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Communications in Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3572867.3572877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}

引用次数: 0

摘要

设K是一个域，x1<··本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Algorithms for multivariate laurent series

Let K be a field and x1 < ··· < xn be ordered variables. Consider a set of polynomials F ⊂ K[x1,...,xn]. If the zero set V(F) of F is of positive dimension, then any triangular decomposition

求助全文

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