Timeline for Growth polynomial of the Associahedron graph ? (Is it approximately Gaussian ?)
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| yesterday | answer | added | Hugh Thomas | timeline score: 1 | |
| Nov 30 at 16:57 | comment | added | Alexander Chervov | I guess it is true - from that picture en.wikipedia.org/wiki/Tamari_lattice | |
| Nov 30 at 8:22 | comment | added | Alexander Chervov | @SamHopkins "the natural choice of base" is it something like (((((ab)c)d)e) - I mean the brackets are placed in the most simple way ? | |
| Nov 30 at 7:03 | comment | added | Alexander Chervov | @SamHopkins Thanks for the comment ! Welcome to extend it. Yes, surely depends. Is something is known for any choice ? Gaussian approximation I think should not depend on any choice like that. | |
| Nov 29 at 22:42 | comment | added | Sam Hopkins | A few quick comments. Of course, everything you ask about depends on the order $n$ of the associahedron in question, although you mostly suppress this dependence in your notation. Also, the associahedron is not vertex transitive, so your generating function depends also on which vertex you choose as the base. Nevertheless, there is a natural choice of base vertex, the minimum of the Tamari lattice, and indeed your question essentially asks about the rank generating function of the Tamari lattice (although the Tamari lattice is not graded, so we have to interpret this correctly.) | |
| Nov 29 at 21:37 | history | asked | Alexander Chervov | CC BY-SA 4.0 |