Abstract

In this paper we begin the first systematic study of distributions of simple marked mesh patterns. Mesh patterns were introduced recently by Brändén and Claesson in connection with permutation statistics. We provide explicit generating functions in several general cases, and develop recursions to compute the numbers in question in some other cases. Certain qq-analogues are discussed. Moreover, we consider two modifications of the notion of a marked mesh pattern and provide enumerative results for them.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.