Alternating sign matrices and tournaments

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
18 pages, LaTeX; minor corrections. To appear in FoataFest proceedings issue of Advances in Applied Mathematics

Keywords

Combinatorics, 05A19 (Primary) 15A57 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/59673

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0008029
 http://arxiv.org/abs/math/0008029
 Adv. Appl. Math. 27 (2001), 318--335

Collections

arXiv