Papers › Evolutionary algorithms for multi-center solutions

Evolutionary algorithms for multi-center solutions

16 Dec 2022arXiv:2212.08585links table onlyarchive 2025-07-28

Sami Rawash, David Turton

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.

Large classes of multi-center supergravity solutions have been constructed in the study of supersymmetric black holes and their microstates. Many smooth multi-center solutions have the same charges as supersymmetric black holes, with all centers deep inside a long black-hole-like throat. These configurations are constrained by regularity, absence of closed timelike curves, and charge quantization. Due to these constraints, constructing explicit solutions with several centers in generic arrangements, and with all parameters in physically relevant ranges, is a hard task. In this work we present an optimization algorithm, based on evolutionary algorithms and Bayesian optimization, that systematically constructs numerical solutions satisfying all constraints. We exhibit explicit examples of novel five-center and seven-center machine-precision solutions.

PaperPDFCode

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