Timeline for How many lattices require exactly 3 elements to generate them?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 20, 2019 at 0:20 | comment | added | Richard Stanley | Languages like French are more sensible: reseau vs. treillis. | |
| Feb 15, 2019 at 21:45 | comment | added | David Handelman | @BjørnKjos-Hanssen Ahh, that explains it. I am currently thinking about sublattices of $R^n$ (meaning discrete subgroups), hence my confusion. Whenever lattice is mentioned, it should be disambiguated. | |
| Feb 15, 2019 at 20:30 | comment | added | Bjørn Kjos-Hanssen | @DavidHandelman this is about partially ordered sets that have meets and joins | |
| Feb 15, 2019 at 19:48 | comment | added | David Handelman | I can only guess what the question is. Do you mean to classify the pairs $(H, Z^n)$ consisting of a subgroup $H$ of standard $Z^n$ \st $Z^n/H$ is exactly three-generated (as an abelian group), up to GL($n, Z$) acting on $Z^n$? That is, the number of equivalence classes ... [Here $Z$ means the integers; I was too lazy to use bold $Z$, because MO doesn't allow macros to be defined.] | |
| Feb 15, 2019 at 19:23 | comment | added | Richard Stanley | It is a little confusing to say "on $n$ points" when what you mean is $n$-element lattices up to isomorphism. | |
| Feb 15, 2019 at 18:56 | history | asked | David S. Newman | CC BY-SA 4.0 |