Alternating sign matrices and tournaments
Combinatorics
2007-05-23 v3
Abstract
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.
Keywords
Cite
@article{arxiv.math/0008029,
title = {Alternating sign matrices and tournaments},
author = {Robin Chapman},
journal= {arXiv preprint arXiv:math/0008029},
year = {2007}
}
Comments
18 pages, LaTeX; minor corrections. To appear in FoataFest proceedings issue of Advances in Applied Mathematics