Timeline for Homomesy in perfect matchings
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2014 at 4:50 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 59 characters in body
|
| Jan 24, 2014 at 4:48 | comment | added | Brendan McKay | Yes, I see that I didn't read carefully enough. | |
| Jan 24, 2014 at 2:27 | comment | added | Sam Hopkins | Yes the maximum value of $\mathrm{al}(M)$ is $\binom{n}{2}$, attained uniquely. Fortunately we can pair this matching with two matchings with no alignments: the natural choice appears to be the matching where all pairs cross and the matching where all pairs nest. | |
| Jan 24, 2014 at 2:13 | comment | added | Harry Altman | Unfortunately the perfect matching is on $\{1,\ldots,2n\}$, rather than $\{1,\ldots,n\}$, so the maximum value of $\mathrm{al}(M)$ is $\binom{n}{2}$. | |
| Jan 24, 2014 at 1:48 | history | answered | Brendan McKay | CC BY-SA 3.0 |