✦ LIBER ✦

The automorphism group of the universa distributive lattice

✍ Scribed by Manfred Droste; Dugald Macpherson

Publisher: Springer
Year: 2000
Tongue: English
Weight: 99 KB
Volume: 43
Category: Article
ISSN: 0002-5240
DOI: 10.1007/s000120050160

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On automorphism groups of graphs and dis

On automorphism groups of graphs and distributive lattices

✍ S. Foldes 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 61 KB

Automorphism groups of algebraic lattice

Automorphism groups of algebraic lattices

✍ Gerhard Behrendt 📂 Article 📅 1985 🏛 Springer 🌐 English ⚖ 241 KB

Automorphism groups of geometric lattice

Automorphism groups of geometric lattices

✍ Manfred Dugas; Rüdiger Göbel 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 76 KB

Reversional automorphisms of lattice-ord

Reversional automorphisms of lattice-ordered groups

✍ N. V. Bayanova; O. V. Nikonova 📂 Article 📅 1995 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 373 KB

The rank of a distributive lattice

✍ I. Rabinovitch; I. Rival 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 427 KB

The rank of a partial ordering P is the maximum size of an n-redundant family of linear extensions of P whose intersection is P. A simple relationship is established between the rank of a finite distributive lattice and its subset of join irreducible elements.

The Strong Independence Theorem for Auto

The Strong Independence Theorem for Automorphism Groups and Congruence Lattices of Arbitrary Lattices

✍ G. Grätzer; F. Wehrung 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 330 KB

97᎐108 proved a much stronger result, the strong independence of the automorphism group and the congruence lattice in the finite case. In this paper, we provide a full affirmative solution of the above problem. In fact, we prove much stronger results, verifying strong independence for general lattic