An inversion sequence of length $ n $ is a sequence of integers $ e= e_1\cdots e_n $ which
satisfies for each $ i\in [n]=\{1, 2,\ldots, n\} $ the inequality $0\le e_i< i $. For a set of patterns …

In this paper, we study the Wilf-type equivalence relations among multiset permutations. We
identify all multiset equivalences among pairs of patterns consisting of a pattern of length …

An inversion sequence of length n is a sequence of integers e= e1··· en which satisfies for
each i∈[n]={1, 2,..., n} the inequalities 0≤ ei< i. For a set of patterns P, we let In (P) denote …

A skew shape is the difference of two top-left justified Ferrers shapes sharing the same top-
left corner. We study integer fillings of skew shapes. As our first main result, we show that for …