Pith. sign in

REVIEW 3 major objections 5 minor 55 references

Metaheuristic Generation of Brane Tilings

T0 review · 3 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Simulated annealing over permutation pairs can construct consistent brane tilings, and the paper exhibits a new one with 26 quantum fields.

desk verdict The Metropolis acceptance in Algorithm 1 is inverted, so the paper's method as written cannot converge; the d=26 example may still be valid but needs verification. read the letter →

arxiv 2412.19313 v2 pith:2R2CY4YQ submitted 2024-12-26 hep-th math.AGmath.CO

Yang-Hui He , Vishnu Jejjala , Tomás S. R. Silva This is my paper · ORCID
classification hep-thmath.AGmath.CO MSC 81T6014M2505A0568W20 PACS 11.30.Pb02.10.Ox02.70.-c
keywords branetilingsdimermodelspermutationtuplessimulatedannealingN=1quivergaugetheoriestoricCalabi-Yauthreefoldsmetaheuristicsconsistencyconditions
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that brane tilings—the dimer-model graphs encoding a large class of four-dimensional supersymmetric gauge theories with toric Calabi–Yau moduli spaces—can be generated by treating the search for a consistent tiling as an optimization problem and solving it with simulated annealing. The authors encode a tiling as a pair of permutations, rewrite the consistency conditions as scores, and define an energy function whose zero-energy states are exactly the consistent tilings. Running their search engine recovers examples from existing catalogues and produces a new tiling with 26 quantum fields, displayed with its quiver, superpotential, and toric diagram. If the method is sound, it offers a practical route to constructing explicit gauge theories with many fields where exhaustive catalogues do not yet exist.

What carries the argument

The load-bearing object is the permutation-tuple encoding of a brane tiling: a pair $(\sigma_B, \sigma_W)$ of permutations of $d$ elements, with cycles in $\sigma_B$ and $\sigma_W$ defining the superpotential terms and $\sigma_F = (\sigma_B\sigma_W)^{-1}$ fixing the faces and gauge groups. The argument runs through a set of consistency conditions—transitivity, the Riemann–Hurwitz relations, absence of one- and two-cycles, and two derangement conditions on products with elements of the Abelian group generated by $\sigma_B\sigma_W^{-1}$—translated into a six-term energy function via partial-credit scores. A cycle-type-preserving Move function generates neighbouring states, and simulated annealing drives the energy to zero. The paper's key move is to rely on the claim that the SUPER and NSVZ $\beta$-function conditions are automatically satisfied for torus-mappable tilings, so that only the combinatorial conditions need to be optimized.

What would settle it

Compute the R-charges for the displayed $d=26$ tiling by a-maximization and check whether all superpotential terms have R-charge 2 and all faces satisfy the NSVZ condition; if no such assignment exists, the claim that combinatorial consistency implies physical consistency is refuted. More directly, search for a permutation tuple that satisfies PT-2, PT-3, PT-5, CONS-1 and CONS-2 but admits no isoradial embedding on a flat torus.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that a simulated-annealing search over permutation pairs, guided by an energy function that sums partial scores for five consistency conditions (PT-2, PT-3, PT-5, CONS-1, CONS-2), converges to zero-energy states that are geometrically consistent brane tilings. In particular, the paper presents the pair $(\sigma_B, \sigma_W)$ in Eq. (10) as a new consistent tiling with $d=26$ quantum fields, ten gauge group factors, a 16-term superpotential made of six pairs of cubic and two pairs of quartic couplings, and a toric Calabi–Yau moduli space whose planar toric diagram has multiplicities listed in Eq. (12). The authors state that because any brane tiling mappable onto a torus automatically satisfies the SUPER and NSVZ conditions, the combinatorial checks suffice for physical consistency.

Load-bearing premise

The load-bearing premise is that every permutation tuple satisfying the five combinatorial conditions can be mapped onto a flat torus, so that the SUPER and NSVZ conditions are automatic; if that theorem fails for some tuple, a zero-energy state might not correspond to a physical gauge theory.

Editorial extensions

If this is right

  • The method reproduces the known consistent brane tilings from earlier catalogues up to relabeling, providing a cross-check of the search.
  • A new consistent brane tiling with 26 quantum fields exists; its quiver has ten gauge groups and its superpotential has sixteen terms.
  • The new tiling's moduli space is an affine toric Calabi–Yau threefold whose toric diagram has four external vertices of multiplicity one and four internal points.
  • Because the search only needs combinatorial checks, the approach can in principle target larger $d$ where no exhaustive catalogue exists.
  • The partial-credit energy landscape outperformed binary scoring in experiments, indicating that smooth energy transitions are important for convergence.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the automaticity of SUPER/NSVZ holds broadly, the same annealing setup could be adapted to generate tilings with prescribed toric-data features, such as a fixed number of internal points or perfect matchings, by adding penalty terms to the energy.
  • The $d=26$ example suggests that metaheuristic search could chart the space of brane tilings well beyond the reflexive/small-area regimes studied in earlier catalogues, potentially revealing new infinite families or statistical distributions over quiver data.
  • A natural testable extension is to run the same algorithm with a target on the toric diagram's multiplicities, using the perfect-matching counts as a filter, which would let one ask whether certain toric geometries admit many distinct dimer models.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The manuscript introduces a simulated-annealing search over pairs of permutations (σB, σW) in S_d × S_d, with an energy function in Eq. (9) that sums partial scores for the brane-tiling consistency conditions PT-2, PT-3, PT-5, CONS-1, and CONS-2. A zero-energy state is claimed to correspond to a geometrically consistent brane tiling, and hence to an N=1 quiver gauge theory with a toric Calabi-Yau moduli space. The authors state that the method reproduces most known catalogue tilings and present a new d=26 example with an explicit permutation pair, quiver, superpotential, dimer drawing, and toric diagram.

Significance. If the method is correct, it offers a lightweight combinatorial way to generate candidate brane tilings beyond the d ≤ 24 catalogues, which would be a useful addition to the string-theory toolkit. The paper is commendably concrete: the d=26 tuple is displayed in full, and the basic Riemann-Hurwitz counts are checkable from the text, with the quiver, superpotential, and toric data also provided. The availability of SageMath code on GitHub is a strength. However, the central algorithmic claim is currently undermined by an apparent inversion of the Metropolis acceptance rule in the printed pseudocode, and the validation statement 'reproduce most' is not quantified. These issues must be resolved before the proof-of-concept claim can be accepted.

major comments (3)
  1. [Appendix A, Algorithm 1] The acceptance test in Algorithm 1 is inverted. For a worse neighbor y, with Δ = Energy(y) − Energy(x) > 0, the left-hand side of line 5 equals exp(−Δ/T(k)), which is the correct Metropolis acceptance probability p. The condition p ≤ U accepts the worse move with probability 1 − p, so the algorithm prefers worse moves and becomes more permissive as T decreases. As written, this is not simulated annealing and would not be expected to converge to a zero-energy state; the central claim of Sections 3–4 therefore rests on a rule that is the opposite of the stated method. Please correct the pseudocode (or, if the GitHub implementation uses the correct U ≤ p rule, state this explicitly and verify that the printed Algorithm 1 is only a typographical error).
  2. [Section 4] The validation statement 'we were able to reproduce most of the consistent brane tilings presented in previous catalogues' is too vague to support a proof of concept. Please specify the catalogues and d-range covered, the number of runs and success rate, how PT-1 equivalence was checked between the SA outputs and the catalogue entries, and the computational cost. Without these numbers, the reader cannot judge whether the SA search reliably finds zero-energy states or whether the d=26 example is an isolated lucky hit.
  3. [Section 3] The claim that SUPER and NSVZ are automatically satisfied for any tiling that can be mapped onto a torus is a load-bearing step, because the search never computes R-charges and the physical interpretation of the d=26 example as an N=1 SCFT depends on it. Please state the precise theorem from [22] that justifies this implication and confirm explicitly that the displayed tuple in Eq. (10) satisfies all hypotheses of that theorem (transitivity, PT-3, PT-5, CONS-1, CONS-2), or provide a verifier script in the repository. If the theorem does not apply to every tuple satisfying the five conditions used in Eq. (9), a zero-energy state could pass all the combinatorial checks yet fail to admit an R-charge assignment, and the resulting theory would not be physical.
minor comments (5)
  1. [Appendix A, Algorithm 8 and Example 1] In Example 1, the label 'ciW = cjW' over a single cycle of σW is confusing: Algorithm 8 says 'two random cycles', but the example appears to choose the same cycle for both. Please clarify whether the two cycles must be distinct and fix the notation.
  2. [Section 4, Eq. (13)] The refined Hilbert series in Eq. (13) is written without explaining the role of the variables t1, t2, t3 or the chosen triangulation incidence. A sentence indicating that this is the refined Hilbert series of the coordinate ring of X, read from the given triangulation, would help the reader interpret the expression.
  3. [GitHub repository] The repository link is welcome, but no commit hash or version is given. For reproducibility, please pin the exact version of the code used to produce the results in Section 4.
  4. [Section 4] The sentence 'This example is not listed (up to equivalence PT-1) in previous catalogues' is immediate if those catalogues only classify tilings up to 24 fields; rephrasing it as 'this is the first example with d=26 in the literature' would avoid implying a nontrivial catalogue search.
  5. [Section 3] The phrase 'any brane tiling that can be mapped onto a torus inherently exhibits locally flat nodes and faces' is imprecise: local flatness is a property of an embedding, and the rigorous statement is the consistency theorem of [22]. Please align the wording with the cited theorem.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the energy function directly encodes externally established consistency conditions, and the new tiling is a search output, not a fitted prediction.

full rationale

The paper's central claim is that simulated annealing over permutation tuples, with the energy function in Eq. (9), constructs brane tilings satisfying the consistency conditions PT-2, PT-3, PT-5, CONS-1, and CONS-2. This is a search problem rather than a prediction: the energy is a direct encoding of those externally established conditions, so a zero-energy state is, by construction, a tuple satisfying them. No fitted parameter is renamed as a prediction; the new d=26 example is presented with its induced quiver, superpotential, tiling, and toric diagram as independent derived data. The only self-citation of note is [22], invoked to justify that the SUPER and NSVZ conditions are automatically satisfied once the PT and CONS conditions hold. This is a parameter-free theorem from prior peer-reviewed work (with overlapping authorship) whose assumptions do not include the target example; it is external evidence, not circular input. The recovery of known catalogue examples provides an external benchmark for the method. A separate concern that the Metropolis acceptance condition in Algorithm 1 appears inverted relative to standard SA is a correctness or reproducibility issue, not a circularity of the derivation, and does not affect the circularity score.

Assumptions & free parameters 2 free parameters · 4 assumptions · 0 invented entities

No new particles, fields, forces, dimensions, or conserved quantities are postulated; the d=26 tiling is a configuration of existing mathematical objects. The free parameters are algorithmic tuning choices, not physical constants.

free parameters (2)
  • SA control parameters (initial temperature, cooling schedule, iteration count N, initial cycle structure)
    Fine-tuned per d in Section 3; they determine convergence but not the consistency conditions, so they do not enter the definition of a valid tiling.
  • Partial score normalizations 1/(n+1) = 1/(n+1) for each score
    Chosen by hand so that a satisfied condition scores 1; energy smoothness rather than physics motivated this choice (Section 3 and Appendix A).
assumptions (4)
  • domain assumption Consistency of a brane tiling is fully encoded by conditions PT-2, PT-3, PT-5, CONS-1, CONS-2 on the permutation tuple (σB, σW).
    Taken from references [18] and [22]; the search optimizes only these conditions.
  • domain assumption SUPER and NSVZ conditions are automatically satisfied for any brane tiling that can be mapped onto a torus.
    Invoked in Section 3 with citation [22]; if it fails, zero-energy states can be non-physical.
  • standard math Riemann-Hurwitz relation d - CσB - CσW - CσF = 0 and the cycle-count equality CσB = CσW are the relevant genus constraints.
    Used in Eq. (3) and scored by PT-3a and PT-3b; standard for permutation covers of the sphere.
  • domain assumption The Abelian group H = ⟨σB σW^-1⟩ is small enough to enumerate in the scoring routines.
    Algorithms 6 and 7 iterate over H and H x H; for the d=26 example this is asserted to be feasible.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Metaheuristic Generation of Brane Tilings." pith.science (2026). https://pith.science/paper/2R2CY4YQ

@misc{pith2026241219313,
  author       = {Pith},
  title        = {Pith review of: Metaheuristic Generation of Brane Tilings},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/2R2CY4YQ}},
  note         = {Machine review of arXiv:2412.19313}
}
abstract

The combinatorics of dimer models on brane tilings describe a large class of four-dimensional $\mathcal{N}=1$ gauge theories that afford quiver descriptions and have toric moduli spaces. We introduce a combinatorial optimization method leveraging simulated annealing to explicitly construct geometrically consistent brane tilings, providing a proof of concept for efficient generation of gauge theories using metaheuristic techniques. The implementation of this idea recovers known examples and allows us to derive a new brane tiling with $26$ quantum fields, illustrating the potential of metaheuristic techniques as a valuable addition to the toolbox for constructing and analyzing gauge theories from brane tilings.

Figures

Figures reproduced from arXiv: 2412.19313 by the authors.

Figure 3
Figure 3. Toric diagram induced from the permutation tuple in (10), with mul [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 2
Figure 2. Tiling induced from the permutation tuple in (10). [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

55 extracted references · 28 canonical work pages

  1. [22]

    Consistency and Derangements in Brane Tilings

    A. Hanany, V . Jejjala, S. Ramgoolam, R.-K. Seong, Consistency and De- rangements in Brane Tilings, J. Phys. A 49 (35) (2016) 355401. arXiv: 1512.09013,

    work page Pith review arXiv 2016

  2. [1]

    Hanany, K

    A. Hanany, K. D. Kennaway, Dimer models and toric diagrams (3 2005). arXiv:hep-th/0503149

    arXiv 2005

  3. [2]

    Franco, A

    S. Franco, A. Hanany, K. D. Kennaway, D. Vegh, B. Wecht, Brane dimers and quiver gauge theories, JHEP 01 (2006) 096. arXiv:hep- th/0504110,

    work page arXiv 2006

  4. [3]

    Franco, A

    S. Franco, A. Hanany, D. Martelli, J. Sparks, D. Vegh, B. Wecht, Gauge theories from toric geometry and brane tilings, JHEP 01 (2006) 128. arXiv:hep-th/0505211,

    arXiv 2006

  5. [4]

    B. Feng, A. Hanany, Y .-H. He, D-brane gauge theories from toric sin- gularities and toric duality, Nucl. Phys. B 595 (2001) 165–200. arXiv: hep-th/0003085,

    arXiv 2001

  6. [5]

    Feng, Y .-H

    B. Feng, Y .-H. He, K. D. Kennaway, C. Vafa, Dimer models from mirror symmetry and quivering amoebae, Adv. Theor. Math. Phys. 12 (3) (2008) 489–545. arXiv:hep-th/0511287,

    arXiv 2008

  7. [6]

    Hanany, R.-K

    A. Hanany, R.-K. Seong, Brane Tilings and Specular Duality, JHEP 08 (2012) 107. arXiv:1206.2386,

    arXiv 2012

  8. [7]

    Cyclic contractions of dimer algebras always exist

    C. Beil, Cyclic contractions of dimer algebras always exist., Algebr. Rep- resent. Theory 22 (5) (2019) 1083–1100. arXiv:1703.04450,

    work page Pith review arXiv 2019

Show all 55 references
  1. [8]

    Franco, G

    S. Franco, G. Musiker, Higher Cluster Categories and QFT Dualities, Phys. Rev. D 98 (4) (2018) 046021. arXiv:1711.01270,

    2018 arXiv

  2. [9]

    He, Calabi-Yau Varieties: from Quiver Representations to Dessins d’Enfants (11 2016)

    Y .-H. He, Calabi-Yau Varieties: from Quiver Representations to Dessins d’Enfants (11 2016). arXiv:1611.09398

    2016 arXiv

  3. [10]

    K. D. Kennaway, Brane Tilings, Int. J. Mod. Phys. A 22 (2007) 2977–

    2007

  4. [11]

    Yamazaki, Brane Tilings and Their Applications, Fortsch

    M. Yamazaki, Brane Tilings and Their Applications, Fortsch. Phys. 56 (2008) 555–686. arXiv:0803.4474,

    2008 arXiv

  5. [12]

    I. R. Klebanov, E. Witten, Superconformal field theory on three-branes at a Calabi-Yau singularity, Nucl. Phys. B 536 (1998) 199–218. arXiv: hep-th/9807080,

    1998 arXiv

  6. [13]

    Benvenuti, S

    S. Benvenuti, S. Franco, A. Hanany, D. Martelli, J. Sparks, An Infinite family of superconformal quiver gauge theories with Sasaki-Einstein du- als, JHEP 06 (2005) 064. arXiv:hep-th/0411264,

    2005 arXiv

  7. [14]

    Davey, A

    J. Davey, A. Hanany, J. Pasukonis, On the Classification of Brane Tilings, JHEP 01 (2010) 078. arXiv:0909.2868,

    2010 arXiv

  8. [15]

    Hanany, R.-K

    A. Hanany, R.-K. Seong, Brane Tilings and Reflexive Polygons, Fortsch. Phys. 60 (2012) 695–803. arXiv:1201.2614,

    2012 arXiv

  9. [16]

    Franco, Y .-H

    S. Franco, Y .-H. He, C. Sun, Y . Xiao, A Comprehensive Survey of Brane Tilings, Int. J. Mod. Phys. A 32 (23n24) (2017) 1750142. arXiv:1702. 03958,

    2017

  10. [17]

    J. Bao, G. B. Colverd, Y .-H. He, Quiver gauge theories: beyond reflexiv- ity, Journal of High Energy Physics 2020 (6) (Jun. 2020)

    2020

  11. [18]

    Jejjala, S

    V . Jejjala, S. Ramgoolam, D. Rodriguez-Gomez, Toric CFTs, Permuta- tion Triples and Belyi Pairs, JHEP 03 (2011) 065. arXiv:1012.2351,

    2011 arXiv

  12. [19]

    Hanany, Y .-H

    A. Hanany, Y .-H. He, V . Jejjala, J. Pasukonis, S. Ramgoolam, D. Rodriguez-Gomez, The Beta Ansatz: A Tale of Two Complex Struc- tures, JHEP 06 (2011) 056. arXiv:1104.5490,

    2011 arXiv

  13. [20]

    Hanany, Y .-H

    A. Hanany, Y .-H. He, V . Jejjala, J. Pasukonis, S. Ramgoolam, D. Rodriguez-Gomez, Invariants of Toric Seiberg Duality, Int. J. Mod. Phys. A 27 (2012) 1250002. arXiv:1107.4101,

    2012 arXiv

  14. [21]

    Y .-H. He, V . Jejjala, D. Rodriguez-Gomez, Brane Geometry and Dimer Models, JHEP 06 (2012) 143. arXiv:1204.1065,

    2012 arXiv

  15. [23]

    He, Deep-Learning the Landscape, Phys

    Y .-H. He, Deep-Learning the Landscape, Phys. Lett. B 774 (2017) 564–

    2017

  16. [24]

    Krefl, R.-K

    D. Krefl, R.-K. Seong, Machine Learning of Calabi-Yau V olumes, Phys. Rev. D 96 (6) (2017) 066014. arXiv:1706.03346,

    2017 arXiv

  17. [25]

    Aggarwal, Y .-H

    D. Aggarwal, Y .-H. He, E. Heyes, E. Hirst, H. N. Sá Earp, T. S. R. Silva, Machine learning sasakian and G 2 topology on contact calabi-yau 7-manifolds, Physics Letters B 850 (2024) 138517

    2024

  18. [26]

    Carifio, J

    J. Carifio, J. Halverson, D. Krioukov, B. D. Nelson, Machine Learning in the String Landscape, JHEP 09 (2017) 157. arXiv:1707.00655,

    2017 arXiv

  19. [27]

    Ruehle, Evolving neural networks with genetic algorithms to study the String Landscape, JHEP 08 (2017) 038

    F. Ruehle, Evolving neural networks with genetic algorithms to study the String Landscape, JHEP 08 (2017) 038. arXiv:1706.07024,

    2017 arXiv

  20. [28]

    He, The Calabi–Yau Landscape: From Geometry, to Physics, to Machine Learning, Lecture Notes in Mathematics, 2021

    Y .-H. He, The Calabi–Yau Landscape: From Geometry, to Physics, to Machine Learning, Lecture Notes in Mathematics, 2021. arXiv:1812. 02893,

    2021

  21. [29]

    Ruehle, Data science applications to string theory, Phys

    F. Ruehle, Data science applications to string theory, Phys. Rept. 839 (2020) 1–117

    2020

  22. [30]

    Gukov, J

    S. Gukov, J. Halverson, F. Ruehle, Rigor with machine learning from field theory to the poincaré conjecture, Nature Reviews Physics (2024) 1–10

    2024

  23. [31]

    He, AI-driven research in pure mathematics and theoretical physics, Nature Rev

    Y .-H. He, AI-driven research in pure mathematics and theoretical physics, Nature Rev. Phys. 6 (9) (2024) 546–553. arXiv:2405.19973,

    2024 arXiv

  24. [32]

    Y .-H. He, E. Hirst, T. Peterken, Machine-learning dessins d’enfants: ex- plorations via modular and Seiberg–Witten curves, J. Phys. A 54 (7) (2021) 075401. arXiv:2004.05218,

    2021 arXiv

  25. [33]

    J. Bao, S. Franco, Y .-H. He, E. Hirst, G. Musiker, Y . Xiao, Quiver Muta- tions, Seiberg Duality and Machine Learning, Phys. Rev. D 102 (8) (2020) 086013. arXiv:2006.10783,

    2020 arXiv

  26. [34]

    Bao, Y .-H

    J. Bao, Y .-H. He, E. Hirst, Neurons on amoebae, J. Symb. Comput. 116 (2023) 1–38. arXiv:2106.03695,

    2023 arXiv

  27. [35]

    Arias-Tamargo, Y .-H

    G. Arias-Tamargo, Y .-H. He, E. Heyes, E. Hirst, D. Rodriguez-Gomez, Brain webs for brane webs, Phys. Lett. B 833 (2022) 137376. arXiv: 2202.05845,

    2022 arXiv

  28. [36]

    Chen, Y .-H

    S. Chen, Y .-H. He, E. Hirst, A. Nestor, A. Zahabi, Mahler measuring the genetic code of amoebae, Adv. Theor. Math. Phys. 27 (5) (2023) 1405–

    2023

  29. [37]

    Cheung, P.-P

    M.-W. Cheung, P.-P. Dechant, Y .-H. He, E. Heyes, E. Hirst, J.-R. Li, 5 Clustering cluster algebras with clusters, Adv. Theor. Math. Phys. 27 (3) (2023) 797–828. arXiv:2212.09771,

    2023

  30. [38]

    Dechant, Y .-H

    P.-P. Dechant, Y .-H. He, E. Heyes, E. Hirst, Cluster Algebras: Network Science and Machine Learning, J. Comput. Algebra 8 (2023). arXiv: 2203.13847,

    2023 arXiv

  31. [39]

    Seong, Unsupervised machine learning techniques for explor- ing tropical coamoeba, brane tilings and Seiberg duality, Phys

    R.-K. Seong, Unsupervised machine learning techniques for explor- ing tropical coamoeba, brane tilings and Seiberg duality, Phys. Rev. D 108 (10) (2023) 106009. arXiv:2309.05702,

    2023 arXiv

  32. [40]

    J. He, H. Jenne, H. Chau, D. Brown, M. Raugas, S. Billey, H. Kvinge, Ma- chines and Mathematical Mutations: Using GNNs to Characterize Quiver Mutation Classes (11 2024). arXiv:2411.07467

    2024 arXiv

  33. [41]

    K. T. K. Armstrong-Williams, E. Hirst, B. Jackson, K.-H. Lee, Machine learning mutation-acyclicity of quivers (11 2024). arXiv:2411.04209

    2024 arXiv

  34. [42]

    Seong, Generative AI for Brane Configurations, Tropical Coamoeba and 4d N =1 Quiver Gauge Theories (11 2024)

    R.-K. Seong, Generative AI for Brane Configurations, Tropical Coamoeba and 4d N =1 Quiver Gauge Theories (11 2024). arXiv: 2411.16033

    2024 arXiv

  35. [43]

    Gukov, R.-K

    S. Gukov, R.-K. Seong, Machine learning BPS spectra and the gap con- jecture, Phys. Rev. D 110 (4) (2024) 046016. arXiv:2405.09993,

    2024 arXiv

  36. [44]

    K. A. Intriligator, B. Wecht, The Exact superconformal R symmetry max- imizes a, Nucl. Phys. B 667 (2003) 183–200. arXiv:hep-th/0304128,

    2003 arXiv

  37. [45]

    Bianchi, M

    L. Bianchi, M. Dorigo, L. M. Gambardella, W. J. Gutjahr, A survey on metaheuristics for stochastic combinatorial optimization, Natural Com- puting 8 (2) (2008) 239–287

    2008

  38. [46]

    Kirkpatrick, C

    S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, Optimization by simulated annealing, Science 220 (4598) (1983) 671–680

    1983

  39. [47]

    Metropolis, A

    N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, E. Teller, Equation of state calculations by fast computing machines, The Journal of Chemical Physics 21 (6) (1953) 1087–1092

    1953

  40. [48]

    T. S. Developers, W. Stein, D. Joyner, D. Kohel, J. Cremona, B. Eröcal, SageMath, version 9.0 (2020). URL http://www.sagemath.org

    2020

  41. [49]

    Cveti ˇc, H

    M. Cveti ˇc, H. Lü, D. N. Page, C. N. Pope, New einstein-sasaki spaces in five and higher dimensions, Physical Review Letters 95 (7) (Aug. 2005). URL http://dx.doi.org/10.1103/PhysRevLett.95.071101

    2005 doi

  42. [50]

    Benvenuti, B

    S. Benvenuti, B. Feng, A. Hanany, Y .-H. He, Counting BPS Operators in Gauge Theories: Quivers, Syzygies and Plethystics, JHEP 11 (2007) 050. arXiv:hep-th/0608050,

    2007 arXiv

  43. [51]

    He, R.-K

    Y .-H. He, R.-K. Seong, S.-T. Yau, Calabi–Yau V olumes and Reflexive Polytopes, Commun. Math. Phys. 361 (1) (2018) 155–204. arXiv: 1704.03462, Appendix A. Supplementary material Algorithm 1 presents a general implementation of Simu- lated Annealing. Algorithm 1 Simulated Annea...

    2018 arXiv

  44. [52]

    Note that CσB = CσW = 2, and that there are no one-cycles or two-cycles, so that PT-3 Eq

    Consider the following two initial permutations presented in cycle notation: σB = (1, 3, 4, 7)(2, 8, 6, 5) σW = (1, 8, 2)(3, 6, 5, 4, 7) The cycle type ofσB is (4, 4) and the cycle type ofσW is (3, 5). Note that CσB = CσW = 2, and that there are no one-cycles or two-cycles, so...

  45. [53]

    Choose two random cycles in each σB andσW: σB = (1, 3, 4, 7)| {z } ciB (2, 8, 6, 5)| {z } c jB σW = (1, 8, 2) (3, 6, 5, 4, 7)| {z } ciW =c jW

  46. [54]

    Choose a random element in each of the chosen cycles: σB = (1, 3 ↑ iB , 4, 7)(2, 8, 6, 5 ↑ jB ) σW = (1, 8, 2)(1, 6 ↑ iW , 5, 4 ↑ jW , 7)

  47. [55]

    Do the swap: fσB = (1, 5, 4, 7)(2, 8, 6, 3) gσW = (1, 8, 2)(3, 4, 5, 6, 7) Note that after the Move execution, both fσB and gσW pre- serve the initial cycle type of σB and σW, respectively, (4, 4) and (3, 5). 7

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.