𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructive enumeration of Boolean lattices

✍ Scribed by V. D. Dzgoev

Publisher
Springer US
Year
1988
Tongue
English
Weight
438 KB
Volume
27
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Boolean Algebras and Distributive Lattic
Boolean Algebras and Distributive Lattices Treated Constructively
✍ John L. Bell πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 546 KB

## Abstract Some aspects of the theory of Boolean algebras and distributive lattices–in particular, the Stone Representation Theorems and the properties of filters and ideals–are analyzed in a constructive setting.

A Constructive Enumeration of Fullerenes
A Constructive Enumeration of Fullerenes
✍ Gunnar Brinkmann; Andreas W.M. Dress πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 215 KB

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 sph

A Constructive Enumeration of Meanders
A Constructive Enumeration of Meanders
✍ Reinhard O.W. Franz; Berton A. Earnshaw πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 129 KB
Cutsets of Boolean lattices
Cutsets of Boolean lattices
✍ Richard Nowakowski πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 575 KB

Let a be an element of a finite ordered set P. A subset F of P is a cutset for a if every element of F is incomparable to a and if every maximal chain of P intersects F U {a}. The cardinalities of minimum sized cutsets for elements of finite boolean lattices are determined