Timeline for Finite lattices whose number of join-irreducibles does not exceed its height
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Feb 5, 2018 at 1:20 | history | suggested | F. C. |
replace the tag order-theory by the more precise lattice-theory
|
|
| Feb 4, 2018 at 20:26 | review | Suggested edits | |||
| S Feb 5, 2018 at 1:20 | |||||
| Jun 25, 2014 at 16:53 | vote | accept | Rob Myers | ||
| Jun 25, 2014 at 15:54 | answer | added | Hugh Thomas | timeline score: 4 | |
| Jun 17, 2014 at 9:14 | comment | added | Rob Myers | @RichardStanley: That's a great answer, thanks. By join-semidistributive lattices I meant the quasivariety of lattices defined by $x \lor y = x \lor z \implies x \lor y = x \lor (y \land z)$. A finite lattice lies in this class iff each of its elements has a canonical irredundant join representation. | |
| Jun 17, 2014 at 2:10 | answer | added | Joseph Van Name | timeline score: 3 | |
| Jun 16, 2014 at 23:07 | comment | added | Richard Stanley | If your definition of "join-semidistributive lattice" agrees with what I would call a "join-distributive lattice," then the property $|J(L)|=\mathrm{height}(L)$ is the dual to Exercise 3.48 in Enumerative Combinatorics, vol. 1, second ed. | |
| Jun 16, 2014 at 20:20 | history | asked | Rob Myers | CC BY-SA 3.0 |