Papers › FindBounce: package for multi-field bounce actions
FindBounce: package for multi-field bounce actions
Victor Guada, Miha Nemevšek, Matevž Pintar
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We are launching FindBounce, a Mathematica package for the evaluation of the Euclidean bounce action that enters the decay rate of metastable states in quantum and thermal field theories. It is based on the idea of polygonal bounces, which is a semi-analytical approach to solving the bounce equation by discretizing the potential into piecewise linear segments. This allows for a fast and robust evaluation of arbitrary potentials with specified precision and any number of scalar fields. Time cost grows linearly with the number of fields and/or the number of segments. Computation with 20 fields takes ∼2 seconds with 0.5% accuracy of the action. The FindBounce function is simple to use with the native Mathematica look and feel, it is easy to install, and comes with detailed documentation and physical examples, such as the calculation of the nucleation temperature. We also provide timing benchmarks with comparisons to existing tools, where applicable.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections