Commutation classes of double wiring diagrams

DOI10.2140/INVOLVE.2012.5.207MaRDI QIDQ1950934zbMATH OpenOpenAlexFDO

Authors Patrick Dukes, Joe Rusinko

Publication date 28 May 2013

Published in Involve (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.1076, http://msp.org/involve/2012/5-2/p06.xhtml

zbMATH Keywords

Laurent phenomenonmatrix positivitywiring diagram

Mathematics Subject Classification ID

Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48)

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 .

Recommendations

• Diameter of the commutation classes graph of a permutation
• On commutation classes of reduced words in Weyl groups
• Chambers of wiring diagrams
• CLASSES OF WIRING DIAGRAMS AND THEIR INVARIANTS
• RC-Graphs and Schubert Polynomials

Cited in

(2)

• Diameter of the commutation classes graph of a permutation
• Chambers of wiring diagrams

This page was built for publication: Commutation classes of double wiring diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950934)