✦ LIBER ✦

Completion of Standard-like Embeddings

✍ Scribed by Joel Giedt

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 88 KB
Volume: 289
Category: Article
ISSN: 0003-4916
DOI: 10.1006/aphy.2001.6139

No coin nor oath required. For personal study only.

✦ Synopsis

Inequivalent standard-like observable sector embeddings in Z 3 orbifolds with two discrete Wilson lines, as determined by Casas, Mondragon, and Muñoz, are completed by examining all possible ways of embedding the hidden sector. The hidden sector embeddings are relevant to twisted matter in nontrivial representations of the Standard Model and to scenarios where supersymmetry breaking is generated in a hidden sector. We find a set of 175 models which have a hidden sector gauge group which is viable for dynamical supersymmetry breaking. Only four different hidden sector gauge groups are possible in these models.

📜 SIMILAR VOLUMES

Embeddings of Fields in Complete Ones

✍ Witold Więsław 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB

Regular orientable embeddings of complet

Regular orientable embeddings of complete bipartite graphs

✍ Jin Ho Kwak; Young Soo Kwon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com

Face 2-Colourable Triangular Embeddings

Face 2-Colourable Triangular Embeddings of Complete Graphs

✍ M.J. Grannell; T.S. Griggs; Jozef Širáň 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 420 KB

A face 2-colourable triangulation of an orientable surface by a complete graph K n exists if and only if n#3 or 7 (mod 12). The existence of such triangulations follows from current graph constructions used in the proof of the Heawood conjecture. In this paper we give an alternative construction for

On the number of triangular embeddings o

On the number of triangular embeddings of complete graphs and complete tripartite graphs

✍ M. J. Grannell; M. Knor 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__→∞, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many

Formalisations With Non-Standard Degrees

Formalisations With Non-Standard Degrees of Completeness

✍ Alan Rose 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 499 KB

Embedding the Complete Tree in the Hyper

Embedding the Complete Tree in the Hypercube

✍ A.S. Wagner 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Let \(H_{n}\) be the \(n\)-dimensional boolean hypercube with \(2^{n}\) vertices labeled \(\left\{0,1, \ldots 2^{n}-1\right\}\), with an edge between two vertices whenever their Hamming distance is 1. We describe a spanning tree \(T_{n}\) of \(H_{n}\) with the following properties. \(T_{n}\) is comp