Pith. sign in

REVIEW

Diversity in the Tail of the Intersecting Brane Landscape

Not yet reviewed by Pith; the record is open.

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 0905.1951 v1 pith:RJ24RJ7B submitted 2009-05-13 hep-th

Diversity in the Tail of the Intersecting Brane Landscape

classification hep-th
keywords modelstailbranedistributionintersectingbranesconstraintsdiversity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Techniques are developed for exploring the complete space of intersecting brane models on an orientifold. The classification of all solutions for the widely-studied T^6/Z_2 x Z_2 orientifold is made possible by computing all combinations of branes with negative tadpole contributions. This provides the necessary information to systematically and efficiently identify all models in this class with specific characteristics. In particular, all ways in which a desired group G can be realized by a system of intersecting branes can be enumerated in polynomial time. We identify all distinct brane realizations of the gauge groups SU(3) x SU(2) and SU(3) x SU(2) x U(1) which can be embedded in any model which is compatible with the tadpole and SUSY constraints. We compute the distribution of the number of generations of "quarks" and find that 3 is neither suppressed nor particularly enhanced compared to other odd generation numbers. The overall distribution of models is found to have a long tail. Despite disproportionate suppression of models in the tail by K-theory constraints, the tail in the distribution contains much of the diversity of low-energy physics structure.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.