학술논문
F-polynomials & Newton polytopes
Document Type
Conference
Author
Source
2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) SYNASC Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2022 24th International Symposium on. :51-54 Sep, 2022
Subject
Language
ISSN
2470-881X
Abstract
We provide an effective algorithmic method for computation of Gross-Keel-Hacking-Kontsevich potential, Fpolynomials and Bernstein-Kazhdan decoration function and it’s complexity bounds. For simply laced Lie algebras we make conjecture and provide experimental evidence that Newton polytopes for Gross-Keel-Hacking-Kontsevich potential do not contain any interior lattice points.