Frédéric Bihan, Erika Croy, Weixun Deng, Kaitlyn Phillipson, Robert J. Rennie, J. M. Rojas
{"title":"快速计算电路指数和的等式类型(扩展摘要)","authors":"Frédéric Bihan, Erika Croy, Weixun Deng, Kaitlyn Phillipson, Robert J. Rennie, J. M. Rojas","doi":"10.1145/3637529.3637538","DOIUrl":null,"url":null,"abstract":"Fewnomial Theory [Kho91] has established bounds on the number of connected components (a.k.a. pieces) of a broad class of real analytic sets as a function of a particular kind of input complexity, e.g., the number of distinct exponent vectors among a generating set for the underlying ideal. Here, we pursue the algorithmic side: We show how to efficiently compute the exact isotopy type of certain (possibly singular) real zero sets, instead of just estimating their number of pieces. While we focus on the circuit case, our results form the foundation for an approach to the general case that we will pursue later.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"15 1","pages":"152 - 155"},"PeriodicalIF":0.4000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)\",\"authors\":\"Frédéric Bihan, Erika Croy, Weixun Deng, Kaitlyn Phillipson, Robert J. Rennie, J. M. Rojas\",\"doi\":\"10.1145/3637529.3637538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fewnomial Theory [Kho91] has established bounds on the number of connected components (a.k.a. pieces) of a broad class of real analytic sets as a function of a particular kind of input complexity, e.g., the number of distinct exponent vectors among a generating set for the underlying ideal. Here, we pursue the algorithmic side: We show how to efficiently compute the exact isotopy type of certain (possibly singular) real zero sets, instead of just estimating their number of pieces. While we focus on the circuit case, our results form the foundation for an approach to the general case that we will pursue later.\",\"PeriodicalId\":41965,\"journal\":{\"name\":\"ACM Communications in Computer Algebra\",\"volume\":\"15 1\",\"pages\":\"152 - 155\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2023-09-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/3637529.3637538\",\"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/3637529.3637538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
摘要
Fewnomial Theory [Kho91]已经建立了一大类实数解析集合的连通成分(又称片段)的数量边界,作为一种特定输入复杂度的函数,例如,底层理想的生成集合中不同指数向量的数量。在这里,我们追求的是算法方面:我们展示了如何高效计算某些(可能是奇异的)实零集的精确等式类型,而不仅仅是估算它们的个数。虽然我们关注的是电路情况,但我们的结果为我们以后研究一般情况的方法奠定了基础。
Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)
Fewnomial Theory [Kho91] has established bounds on the number of connected components (a.k.a. pieces) of a broad class of real analytic sets as a function of a particular kind of input complexity, e.g., the number of distinct exponent vectors among a generating set for the underlying ideal. Here, we pursue the algorithmic side: We show how to efficiently compute the exact isotopy type of certain (possibly singular) real zero sets, instead of just estimating their number of pieces. While we focus on the circuit case, our results form the foundation for an approach to the general case that we will pursue later.