Bruhat graphs and pattern avoidance
classification
🧮 math.CO
keywords
bruhatgraphsdrawnpermutationswhoseavoidanceavoidingcharacterize
read the original 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.
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.