Enumeration of solutions to some equations in finite lattices (Q1280368)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumeration of solutions to some equations in finite lattices |
scientific article; zbMATH DE number 1261651
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Enumeration of solutions to some equations in finite lattices |
scientific article; zbMATH DE number 1261651 |
Statements
Enumeration of solutions to some equations in finite lattices (English)
0 references
15 March 1999
0 references
The author discusses some enumeration problems. They are formulated as problems of enumeration of solutions to systems of equations in finite lattices. The results are applied to the following purposes: 1) To prove Rota's cross-cut theorems; 2) To prove Dilworth's covering theorem for finite modular lattices; 3) To enumerate generators of Boolean algebras.
0 references
Möbius function
0 references
Stirling numbers
0 references
enumeration problems
0 references
equations in finite lattices
0 references
Dilworth's covering theorem
0 references
finite modular lattices
0 references
Boolean algebras
0 references
Rota's cross-cut theorems
0 references
generators
0 references
