Borel型理想Hilbert级数的多项式时间算法

Symbolic-Numeric Computation Pub Date : 2007-07-25 DOI:10.1145/1277500.1277516

A. Hashemi

{"title":"Borel型理想Hilbert级数的多项式时间算法","authors":"A. Hashemi","doi":"10.1145/1277500.1277516","DOIUrl":null,"url":null,"abstract":"In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal.","PeriodicalId":308716,"journal":{"name":"Symbolic-Numeric Computation","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Polynomial-time algorithm for Hilbert series of Borel type ideals\",\"authors\":\"A. Hashemi\",\"doi\":\"10.1145/1277500.1277516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dn where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal.\",\"PeriodicalId\":308716,\"journal\":{\"name\":\"Symbolic-Numeric Computation\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symbolic-Numeric Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1277500.1277516\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symbolic-Numeric Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1277500.1277516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文证明了Borel型理想的Hilbert级数可以在复杂度为多项式的Dn内计算，其中n + 1为未知数，D为输入(单项式)理想的最小产生器的最高次。

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

查看原文本刊更多论文

Polynomial-time algorithm for Hilbert series of Borel type ideals

In this paper, it is shown that the Hilbert series of a Borel type ideal may be computed within a complexity which is polynomial in Dⁿ where n + 1 is the number of unknowns and D is the highest degree of a minimal generator of input (monomial) ideal.

求助全文

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

来源期刊

Symbolic-Numeric Computation

自引率

0.00%

发文量