Timeline for Efficiently embedding finite Boolean algebras into lattices of set partitions?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2019 at 17:19 | answer | added | Marcel Wild | timeline score: 2 | |
| Nov 22, 2017 at 23:15 | comment | added | András Salamon | @RichardStanley, thank you, that is an observation that eluded me but completely answers the question. | |
| Nov 22, 2017 at 17:17 | comment | added | Richard Stanley | I do not understand your question. The longest chain of $P_n$ has length $n-1$. The longest chain of $B_n$ has length $n$. Therefore it is never possible to embed $B_n$ into $P_n$. | |
| Nov 22, 2017 at 17:02 | history | asked | András Salamon | CC BY-SA 3.0 |