Blowing up Stringy Canonical Forms: An Algorithm to Win a Simplified Hironaka's Polyhedra Game
Zhenjie Li, Chi Zhang

TL;DR
This paper introduces an efficient algorithm for computing leading order contributions of stringy canonical forms, leveraging a connection to Hironaka's polyhedra game, with applications to sector decomposition.
Contribution
The paper presents a novel algorithm that simplifies the computation of stringy canonical forms by relating it to Hironaka's polyhedra game, improving efficiency.
Findings
Algorithm effectively computes leading order contributions.
Applicable to problems like sector decomposition.
Provides a new perspective linking algebraic geometry and string theory.
Abstract
We provide an efficient method of blowing up to compute leading order contributions of the recently introduced stringy canonical forms. The method is related to the well-known Hironaka's polyhedra game, and the given algorithm is also useful on similar problems, e.g. sector decomposition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Black Holes and Theoretical Physics · Polynomial and algebraic computation
