✦ LIBER ✦

The Number of Embeddings of Hermitian Lattices

✍ Scribed by D.G. James

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 454 KB
Volume: 176
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1995.1246

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Number of Embeddings of Quadratic Z-

The Number of Embeddings of Quadratic Z-Lattices

✍ Donald G James 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Lattices of Compatibly Embedded Finite F

Lattices of Compatibly Embedded Finite Fields

✍ WIEB BOSMA; JOHN CANNON; ALLAN STEEL 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 474 KB

The design of a computational facility for finite fields that allows complete freedom in the manner in which fields are constructed, is complicated by the fact that a field of fixed isomorphism type K may be constructed in many different ways. It is desirable that the user be able to perform simulta

On the Number of Lattice Free Polytopes

✍ Imre Bárány; Jean-Michel Kantor 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 110 KB

asked for estimates for the number of equivalence classes of lattice polytopes, under the group of unimodular affine transformations. What we investigate here is the analogous question for lattice free polytopes. Some of the results: the number of equivalence classes of lattice free simplices of vol

Bounding the number of embeddings of 5-c

Bounding the number of embeddings of 5-connected projective-planar graphs

✍ Shigeru Kitakubo 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 268 KB

A graph is said to be projective-planar if it is nonplanar and is embeddable in a projective plane. In this paper we show that the numbers of projectiveplanar embeddings (up to equivalence) of all 5-connected graphs have an upper bound c( 1120).

On the Number of Nonisomorphic Orientabl

On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs

✍ Vladimir P. Korzhik; Heinz-Jurgen Voss 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 260 KB

In this paper we consider those 2-cell orientable embeddings of a complete graph K n+1 which are generated by rotation schemes on an abelian group 8 of order n+1, where a rotation scheme an 8 is defined as a cyclic permutation ( ; 1 , ; 2 , ..., ; n ) of all nonzero elements of 8. It is shown that t

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