Commutation classes of double wiring diagrams
Combinatorics
2010-06-08 v1 Representation Theory
Abstract
We describe a new method for computing the graph of commutation classes of double wiring diagrams. Using these methods we compute the graph for five strings or less which allows us to confirm a positivity conjecture of Fomin and Zelevinsky when n is less than five .
Cite
@article{arxiv.1006.1076,
title = {Commutation classes of double wiring diagrams},
author = {Patrick Dukes and Joe Rusinko},
journal= {arXiv preprint arXiv:1006.1076},
year = {2010}
}
Comments
10 pages