Bruhat graphs and pattern avoidance
Combinatorics
2017-01-13 v2
Abstract
We characterize permutations whose Bruhat graphs can be drawn in the plane and those whose Bruhat graphs can be drawn in the torus. In particular, we show these properties are characterized by avoiding finitely many permutations.
Keywords
Cite
@article{arxiv.1107.4812,
title = {Bruhat graphs and pattern avoidance},
author = {Christopher Conklin and Alexander Woo},
journal= {arXiv preprint arXiv:1107.4812},
year = {2017}
}
Comments
8 pages; new version adds torus characterization and deletes section on length whose results had previously appeared in literature