Alternating sign matrices and tournaments
classification
🧮 math.CO
keywords
bijectionclasstournamentsalgorithmalternatingbressoudconcerningconstructing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.