Mesh patterns with superfluous mesh

From MaRDI portal
Publication:744168

DOI10.1016/J.AAM.2013.08.002zbMATH Open1301.05013arXiv1302.1883OpenAlexW2046382562MaRDI QIDQ744168FDOQ744168


Authors: Bridget Eileen Tenner Edit this on Wikidata


Publication date: 6 October 2014

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1302.1883




Recommendations




Cites Work


Cited In (13)

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)