Alternating sign matrices and tournaments
| dc.creator | Chapman, Robin | |
| dc.date | 2000-08-03 | |
| dc.date | 2000-11-15 | |
| dc.date.accessioned | 2026-07-07T04:36:38Z | |
| dc.date.available | 2026-07-07T04:36:38Z | |
| dc.description | We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection. | |
| dc.description | 18 pages, LaTeX; minor corrections. To appear in FoataFest proceedings issue of Advances in Applied Mathematics | |
| dc.identifier | https://arxiv.org/abs/math/0008029 | |
| dc.identifier | http://arxiv.org/abs/math/0008029 | |
| dc.identifier | Adv. Appl. Math. 27 (2001), 318--335 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/59673 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A19 (Primary) 15A57 (Secondary) | |
| dc.title | Alternating sign matrices and tournaments | |
| dc.type | text |