✦ LIBER ✦

The Number of Embeddings of Quadratic Z-Lattices

✍ Scribed by Donald G James

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 325 KB
Volume: 58
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1996.0057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Number of Embeddings of Hermitian La

The Number of Embeddings of Hermitian Lattices

✍ D.G. James 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Z4-Code Constructions for the Niemeier L

Z4-Code Constructions for the Niemeier Lattices and their Embeddings in the Leech Lattice

✍ Masaaki Harada; Masaaki Kitazume 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 121 KB

In this note, we give Z 4 -code constructions of the Niemeier lattices, showing their embedding in the Leech lattice. These yield an alternative proof of a recent result by Dong et al. [5].

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

The Number of Pairs of Quadratic Forms o

The Number of Pairs of Quadratic Forms overFq (qodd)

✍ G.D. Williams 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 182 KB

The number of equivalence classes of pairs of quadratic forms in dimension n over F O (q odd) is shown to equal the coefficient of tL in the expansion of L 5 This is reminiscent of a corresponding formula of Gow and Waterhouse for single asymmetric bilinear forms.

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).