✦ LIBER ✦

On the enumeration of polyhedra

✍ Scribed by P. Engel

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 358 KB
Volume: 41
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90208-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the enumeration of finite groups

✍ P Erdös; M.Ram Murty; V.Kumar Murty 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 650 KB

On the enumeration of lattices of determ

On the enumeration of lattices of determinant one

✍ J.H. Conway; N.J.A. Sloane 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 469 KB

On the sphericity of the graphs of semir

On the sphericity of the graphs of semiregular polyhedra

✍ Hiroshi Maehara 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 272 KB

The sphericity of a graph G is the smallest integer n such that G can be represented as the intersection graph of a family of unit-diameter spheres in Euclidean n-space E n. We determine here the sphericities of the graph of semiregular polyhedra in E 3 except a few prisms.

Enumeration of platonic maps on the toru

Enumeration of platonic maps on the torus

✍ Winfried Kurth 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 705 KB

On polyhedra of Perron-Frobenius eigenve

On polyhedra of Perron-Frobenius eigenvectors

✍ P.-J. Courtois; P. Semal 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 582 KB

On the weight enumerator of product code

On the weight enumerator of product codes

✍ L.M.G.M. Tolhuizen; C.P.M.J. Baggen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 381 KB

The number of words of weight w in the product code of linear codes with minimum distances d, and d, is expressed in the number of low weight words of the constituent codes, provided that w <d,d, + max(d,, d<). By examples it is shown that, in general, the full weight enumerator of a product code is