Timeline for Example of Möbius inversion on integer partition poset
Current License: CC BY-SA 4.0
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Mar 4, 2022 at 7:28 | history | edited | YCor | CC BY-SA 4.0 |
fixed English
|
S Mar 4, 2022 at 6:52 | history | suggested | joriki | CC BY-SA 4.0 |
fixed typos
|
Mar 3, 2022 at 21:10 | review | Suggested edits | |||
S Mar 4, 2022 at 6:52 | |||||
Oct 17, 2012 at 19:33 | answer | added | Patricia Hersh | timeline score: 13 | |
Dec 10, 2011 at 9:25 | comment | added | UmerScientist | @John It'll be helpful if you can point out an example in literature | |
Dec 9, 2011 at 3:16 | comment | added | John Wiltshire-Gordon | If you want to compute dimensions using the poset of partitions with containment, you need only to count the number of maximal chains ending at a partition. As it happens, the Mobius function for this poset is not too hard. | |
Dec 9, 2011 at 2:27 | answer | added | matthias beck | timeline score: 5 | |
Dec 8, 2011 at 21:26 | history | asked | UmerScientist | CC BY-SA 3.0 |