Computing congruence lattices of finite lattices

被引：11
|
作者：
Freese, R [1 ]
机构：
[1] Univ Hawaii, Dept Math, Honolulu, HI 96822 USA
来源：
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 1997年 / 125卷 / 12期
关键词：
congruence lattice; algorithm;
D O I：
10.1090/S0002-9939-97-04332-3
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
An inequality between the number of coverings in the ordered set J(Con L) of join irreducible congruences on a lattice L and the size of L is given. Using this inequality it is shown that this ordered set can be computed in time O(n(2) log(2) n), where n = \L\.
引用
收藏
页码：3457 / 3463
页数：7
相关论文
共 50 条
12345