activity
20072026
most citedThe Eulerian numbers on restricted centrosymmetric permutations

5 citations · 18 across the 14 of their papers we have counts for

collaborators

16 papers

math.CO2026

Involutions avoiding 4321 and another pattern of length four

Marilena Barnabei, Niccolò Castronuovo, Matteo Silimbani

We enumerate all families of involutions avoiding a classical pattern of length four together with 4321. While the enumeration of permutations avoiding two classical patterns is by…

math.CO2024

Hertzsprung patterns on involutions

Marilena Barnabei, Niccolò Castronuovo, Matteo Silimbani

Hertzsprung patterns, recently introduced by Anders Claesson, are subsequences of a permutation contiguous in both positions and values, and can be seen as a subclass of bivincular…

math.CO2024

Groups generated by pattern avoiding permutations

Marilena Barnabei, Niccolò Castronuovo, Matteo Silimbani

We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the sec…

math.CO2022★ 4 cited

Pattern avoiding alternating involutions

Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo +1

We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns…

math.CO2015

Two descent statistics over 321-avoiding centrosymmetric involutions

Marilena Barnabei, Flavio Bonetti, Sergi Elizalde +1

Centrosymmetric involutions in the symmetric group S_{2n} are permutations πsuch that π=π^{-1} and π(i)+π(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the…

math.CO2014★ 3 cited

Descent sets on 321-avoiding involutions and hook decompositions of partitions

Marilena Barnabei, Flavio Bonetti, Sergi Elizalde +1

We show that the distribution of the major index over the set of involutions in S_n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient.…