Mesh patterns with superfluous mesh
Abstract
Mesh patterns are a generalization of classical permutation patterns that encompass classical, bivincular, Bruhat-restricted patterns, and some barred patterns. In this paper, we describe all mesh patterns whose avoidance is coincident with classical avoidance, in a sense declaring that the additional data of a mesh was unnecessary for these patterns. We also describe the permutations having the fewest superfluous meshes, and the permutations having the most, enumerating the superfluous meshes in each case.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2013
- DOI:
- 10.48550/arXiv.1302.1883
- arXiv:
- arXiv:1302.1883
- Bibcode:
- 2013arXiv1302.1883T
- Keywords:
-
- Mathematics - Combinatorics;
- Primary: 05A05;
- Secondary: 05A15
- E-Print:
- changed terminology