activity
20062013
most citedThe most frequent peak set of a random permutation

7 citations · 25 across the 14 of their papers we have counts for

collaborators

15 papers

math.CO2013

Pattern avoidance in ordered set partitions and words

Anisse Kasraoui

We consider the enumeration of ordered set partitions avoiding a permutation pattern, as introduced by Godbole, Goyt, Herdan and Pudwell. Let $\op_{n,k}(p)$ be the number of ordere…

math.CO2013

Enumeration of symmetric centered rhombus tilings of a hexagon

Anisse Kasraoui, Christian Krattenthaler

A rhombus tiling of a hexagon is said to be centered if it contains the central lozenge. We compute the number of vertically symmetric rhombus tilings of a hexagon with side length…

math.CO2013★ 2 cited

Inversion polynomials for 321-avoiding permutations: addendum

Szu-En Cheng, Sergi Elizalde, Anisse Kasraoui +1

This addendum contains results about the inversion number and major index polynomials for permutations avoiding 321 which did not fit well into the original paper. In particular, w…

math.CO2013

Average values of some Z-parameters in a random set partition

Anisse Kasraoui

We find exact and asymptotic formulas for the average values of several statistics on set partitions: of Carlitz's -Stirling distributions, of the numbers of crossings in linear…

math.CO2013★ 5 cited

On the limiting distribution of some numbers of crossings in set partitions

Anisse Kasraoui

We study the asymptotic distribution of the two following combinatorial parameters: the number of arc crossings in the linear representation, ${\mathrm cr^{(\ell)}$, and the number…

math.CO2012★ 7 cited

The most frequent peak set of a random permutation

Anisse Kasraoui

Given a subset , let $\Pa(S;n)$ be the number of permutations in the symmetric group of that have peak set . We prove a recent conjecture due…