Notes on planar semimodular lattices. IV. The size of a minimal congruence lattice representation with rectangular lattices

2010 ◽  
Vol 76 (1-2) ◽  
pp. 3-26
Author(s):  
G. Grätzer ◽  
E. Knapp
Keyword(s):  
Congruence Lattice ◽  
Lattice Representation ◽  
Semimodular Lattices ◽  
Rectangular Lattices

scholarly journals Congruence Lattices of Finite Semimodular Lattices

1998 ◽  
Vol 41 (3) ◽  
pp. 290-297 ◽  
Author(s):  
G. Grätzer ◽  
H. Lakser ◽  
E. T. Schmidt
Keyword(s):  
Distributive Lattice ◽  
Congruence Lattice ◽  
Finite Distributive Lattice ◽  
Congruence Lattices ◽  
Semimodular Lattices

AbstractWe prove that every finite distributive lattice can be represented as the congruence lattice of a finite (planar) semimodular lattice.

A MINIMAL CONGRUENCE LATTICE REPRESENTATION FOR

2020 ◽  
Vol 108 (3) ◽  
pp. 332-340
Author(s):  
ROGER BUNN ◽  
DAVID GROW ◽  
MATT INSALL ◽  
PHILIP THIEM
Keyword(s):  
Congruence Lattice ◽  
Dihedral Group ◽  
Unary Algebra ◽  
Left Translation ◽  
Lattice Representation

Let $p$ be an odd prime. The unary algebra consisting of the dihedral group of order $2p$, acting on itself by left translation, is a minimal congruence lattice representation of $\mathbb{M}_{p+1}$.

Block designs for variety trials

1978 ◽  
Vol 90 (2) ◽  
pp. 395-400 ◽  
Author(s):  
H. D. Patterson ◽  
E. R. Williams ◽  
E. A. Hunter
Keyword(s):  
Block Designs ◽  
Incomplete Block ◽  
Variety Trials ◽  
Rectangular Lattices

SummaryIn this paper we present a series of resolvable incomplete block designs suitable for variety trials with any number of varieties v in the range 20 ≤v ≤ 100. These designs usefully supplement existing square and rectangular lattices. They are not necessarily optimal in the sense of having smallest possible variances but their efficiencies are known to be high.

scholarly journals A note on fixed points in semimodular lattices

1980 ◽  
Vol 29 (3) ◽  
pp. 245-250 ◽  
Author(s):  
Anders Björner ◽  
Ivan Rival
Keyword(s):  
Fixed Points ◽  
Semimodular Lattices

Matchings and Radon transforms in lattices II. Concordant sets

1987 ◽  
Vol 101 (2) ◽  
pp. 221-231 ◽  
Author(s):  
Joseph P. S. Kung
Keyword(s):  
Incidence Matrix ◽  
Finite Lattice ◽  
Möbius Function ◽  
Radon Transforms ◽  
Modular Lattices ◽  
Covering Theorem ◽  
Mobius Function ◽  
Finite Lattices ◽  
Semimodular Lattices

AbstractLet and ℳ be subsets of a finite lattice L. is said to be concordant with ℳ if, for every element x in L, either x is in ℳ or there exists an element x+ such that (CS1) the Möbius function μ(x, x+) ≠ 0 and (CS2) for every element j in , x ∨ j ≠ x+. We prove that if is concordant with ℳ, then the incidence matrix I(ℳ | ) has maximum possible rank ||, and hence there exists an injection σ: → ℳ such that σ(j) ≥ j for all j in . Using this, we derive several rank and covering inequalities in finite lattices. Among the results are generalizations of the Dowling-Wilson inequalities and Dilworth's covering theorem to semimodular lattices, and a refinement of Dilworth's covering theorem for modular lattices.

scholarly journals On representing Mn's by congruence lattice of finite algebras

1983 ◽  
Vol 44 (3) ◽  
pp. 299-308 ◽  
Author(s):  
M.G. Stone ◽  
R.H. Weedmark
Keyword(s):  
Congruence Lattice ◽  
Finite Algebras
Sign in / Sign up

Export Citation Format

Share Document