Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)
ACM Communications in Computer Algebra · 2023
DOI: 10.1145/3637529.3637538 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, 2023. Verfasst von Frédéric Bihan und 5 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 11 Literaturangaben.
Abstract (Originalsprache)
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.
Zitieren
APA
Bihan, F., Croy, E., Deng, W., Phillipson, K., Rennie, R. J., & Rojas, J. M. (2023). Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract). ACM Communications in Computer Algebra. https://doi.org/10.1145/3637529.3637538
Vancouver
Bihan F, Croy E, Deng W, Phillipson K, Rennie RJ, Rojas JM. Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract). ACM Communications in Computer Algebra. 2023. doi:10.1145/3637529.3637538
BibTeX
@article{Bihan2023,
author = {Bihan, Frédéric and Croy, Erika and Deng, Weixun and Phillipson, Kaitlyn and Rennie, Robert J. and Rojas, J. Maurice},
title = {Quickly Computing Isotopy Type for Exponential Sums over Circuits (Extended Abstract)},
journal = {ACM Communications in Computer Algebra},
year = {2023},
doi = {10.1145/3637529.3637538}
}
EUVIMED