𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Embeddings of Fields in Complete Ones

✍ Scribed by Witold Więsław

Publisher
John Wiley and Sons
Year
1979
Tongue
English
Weight
300 KB
Volume
93
Category
Article
ISSN
0025-584X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Completion of Standard-like Embeddings
Completion of Standard-like Embeddings
✍ Joel Giedt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

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 nontrivia

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

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