Mesh patterns with superfluous mesh

From MaRDI portal




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.





Describes a project that uses

Uses Software





This page was built for publication: Mesh patterns with superfluous mesh

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