Pith. sign in

REVIEW 1 cited by

On the Classification of Brane Tilings

Not yet reviewed by Pith; the record is open.

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

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0909.2868 v1 pith:EZMUBAJD submitted 2009-09-16 hep-th

John Davey , Amihay Hanany , Jurgis Pasukonis This is my paper · ORCID
classification hep-th
keywords tilingsbranealgorithmbranesgenerateinconsistentpossibleused
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a computationally efficient algorithm that can be used to generate all possible brane tilings. Brane tilings represent the largest class of superconformal theories with known AdS duals in 3+1 and also 2+1 dimensions and have proved useful for describing the physics of both D3 branes and also M2 branes probing Calabi-Yau singularities. This algorithm has been implemented and is used to generate all possible brane tilings with at most 6 superpotential terms, including consistent and inconsistent brane tilings. The collection of inconsistent tilings found in this work form the most comprehensive study of such objects to date.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Metaheuristic Generation of Brane Tilings

    hep-th 2024-12 conditional novelty 6.0 of 10

    Simulated annealing over permutation tuples can generate consistent brane tilings, yielding a 26-field example not present in catalogues that stop at 24 fields.

Pith tools