Timeline for Permanent of the Coxeter matrix of a distributive lattice
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 30, 2020 at 13:56 | comment | added | Tim Campion | For the benefit of anybody skimming: what is shown here is that the answer to Question 1 is yes, and a formula answering to Question 2 can be found in the details. | |
| Aug 30, 2020 at 10:37 | history | edited | darij grinberg | CC BY-SA 4.0 |
edited body
|
| Oct 9, 2019 at 9:38 | history | bounty ended | Mare | ||
| Oct 7, 2019 at 16:14 | comment | added | Ilya Bogdanov | @DavidESpeyer: Yes, it is the same operation. Thanks for the comment! | |
| Oct 7, 2019 at 15:51 | comment | added | David E Speyer | I believe the permutation $\sigma$ is the operation called "rowmotion" arxiv.org/abs/1108.1172 . Namely, given an upper ideal $X$, let $I = \min X$, let $\langle I \rangle$ be the <b>lower</b> ideal generated by $I$ and let $\overline{\langle I \rangle}$ be the complement of $\langle I \rangle$. The operation $X \mapsto \overline{\langle I \rangle}$ is called rowmotion. It is known to be a permutation and is very trendy right now. Mare might be particularly interested in front.math.ucdavis.edu/1805.00815 , which connects rowmotion to representation theory. | |
| Oct 7, 2019 at 15:27 | history | answered | Ilya Bogdanov | CC BY-SA 4.0 |