𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Constructive Enumeration of Fullerenes

✍ Scribed by Gunnar Brinkmann; Andreas W.M. Dress

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
215 KB
Volume
23
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, a fast and complete method to enumerate fullerene structures is given. It is based on a top-down approach, and it is fast enough to generate, for example, all 1812 isomers of C in less than 20 s on an SGI-workstation. The 60 method described can easily be generalized for 3-regular spherical maps with no face having more than 6 edges in its boundary.

πŸ“œ SIMILAR VOLUMES

PentHex Puzzles: A Reliable and Efficien
PentHex Puzzles: A Reliable and Efficient Top-Down Approach to Fullerene-Structure Enumeration
✍ Gunnar Brinkmann; Andreas W.M Dress πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 196 KB

In this paper, we give a very efficient and completely reliable method to enumerate all combinatorial possibilities for fullerene structures. The method is based on a top-down di¨ide and conquer approach and can easily be generalized also for other kinds of spherical structures. A computer program b

A characterization of constructive dimen
A characterization of constructive dimension
✍ Satyadev Nandakumar πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 173 KB

## Abstract In the context of Kolmogorov's algorithmic approach to the foundations of probability, Martin‐LΓΆf defined the concept of an individual random sequence using the concept of a constructive measure 1 set. Alternate characterizations use constructive martingales and measures of impossibilit

Partition, Construction, and Enumeration
Partition, Construction, and Enumeration of M–P Invertible Matrices over Finite Fields
✍ Zongduo Dai; Yufeng Zhang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 314 KB

A necessary and su$cient condition for an m;n matrix A over F O having a Moor}Penrose generalized inverse (M}P inverse for short) was given in (C. K. Wu and E. Dawson, 1998, Finite Fields Appl. 4, 307}315). In the present paper further necessary and su$cient conditions are obtained, which make clear

A Constructive Proof of Gleason's Theore
A Constructive Proof of Gleason's Theorem
✍ Fred Richman; Douglas Bridges πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 167 KB

Gleason's theorem states that any totally additive measure on the closed subspaces, or projections, of a Hilbert space of dimension greater than two is given by a positive operator of trace class. In this paper we give a constructive proof of that theorem.

A constructive version of Birkhoff's the
A constructive version of Birkhoff's theorem
✍ Jesper CarlstrΓΆm πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 137 KB πŸ‘ 1 views

## Abstract A version of Birkhoff's theorem is proved by constructive, predicative, methods. The version we prove has two conditions more than the classical one. First, the class considered is assumed to contain a generic family, which is defined to be a set‐indexed family of algebras such that if