Bruhat graphs and pattern avoidance

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.

arXiv comment8 pages; new version adds torus characterization and deletes section on length whose results had previously appeared in literature