Timeline for Is this a q-count of Alternating Sign Matrices?
Current License: CC BY-SA 3.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 23, 2016 at 18:00 | history | edited | Jessica Striker | CC BY-SA 3.0 |
added 7 characters in body
|
Aug 23, 2016 at 17:52 | history | edited | Jessica Striker | CC BY-SA 3.0 |
added 250 characters in body
|
Aug 23, 2016 at 17:50 | comment | added | Per Alexandersson | Mapping to SSYTs gives the possibility to compute charge, which is Mahonian on permutations. Perhaps that could be something.. | |
Aug 23, 2016 at 17:45 | comment | added | Jessica Striker | Hi @Per, yes that would be quite nice. There is a generalization of inv to ASMs; the trouble is there are some choices to make and it's not known what the right choice is. (See St000332 and St000067). You can come up with a generalization of maj too St000227, but it's not equidistributed with either of the previous statistics, so none of these statistics seem to be exactly what you would want. | |
Aug 22, 2016 at 15:31 | comment | added | Per Alexandersson | Hi Jessica, welcome to MathOverflow! As a tangent, perhaps there is a nice generalization of inv and maj to ASMs, that are equidistributed, and thus give an analogue of Mahonian-ness for ASMs. | |
Aug 22, 2016 at 15:14 | review | First posts | |||
Aug 22, 2016 at 15:17 | |||||
Aug 22, 2016 at 15:12 | history | answered | Jessica Striker | CC BY-SA 3.0 |