Asymptotic behaviour of the containment of certain mesh patterns

From MaRDI portal
Publication:2113370

DOI10.1016/J.DISC.2022.112813zbMATH Open1484.05008arXiv2011.11382OpenAlexW3108049256MaRDI QIDQ2113370FDOQ2113370

Jason P. Smith, Dejan Govc

Publication date: 14 March 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We present some results on the proportion of permutations of length n containing certain mesh patterns as n grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and columns are shaded. We prove some general results which apply to mesh patterns of any length, and then consider mesh patterns of length four. An important consequence of these results is to show that the proportion of permutations containing a mesh pattern can take a wide range of values between 0 and 1.


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




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Asymptotic behaviour of the containment of certain mesh patterns

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