Marilena Barnabei
Research Subjects
Marilena Barnabei has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Flavio Bonetti
Dipartimento di Matematica Bologna 40126 ITALY
4 shared publications - Matteo Silimbani
Dipartimento di Matematica Bologna 40126 ITALY
3 shared publications - Matteo Silimbani
Istituto Comprensivo "E. Rosetti" 47034 Forlimpopoli Italy
2 shared publications Niccolò Castronuovo
Dipartimento di Matematica, Università di Bologna, Bologna, Italy
2 shared publications- Sergi Elizalde
Department of Mathematics, Dartmouth College, Hanover, USA
2 shared publications - Annalisa Baldi
University of Bologna, Italy
1 shared publication
Latest Publications
- Open Access
Groups generated by pattern avoiding permutations
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 second part we carry out a case-by-case analysis of groups generated by permutations avoiding few short patterns.
Open AccessGroups generated by pattern avoiding permutations
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 second part we carry out a case-by-case analysis of groups generated by permutations avoiding few short patterns.
- Open Access
Pattern avoiding alternating involutions
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 of length three is trivial, on the other hand, the length four case is more challenging and involves sequences of combinatorial interest, such as Motzkin and Fibonacci numbers.
Open AccessPattern avoiding alternating involutions
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 of length three is trivial, on the other hand, the length four case is more challenging and involves sequences of combinatorial interest, such as Motzkin and Fibonacci numbers.
- 3 April 2021
- Published by Taylor & Francis in Journal of Difference Equations and Applications
- Vol. 27 (4) , 481-496
Visibility in restricted involutions
We enumerate involutions avoiding any single pattern of length three according to the statistic ‘number of visible pairs’, namely, the number of non-adjacent columns in the bargraph representation of a given permutation that is mutually visible to each other. The proofs are combinatorial and reside on well-known bijections between pattern avoiding involutions and lattice paths.
- 3 April 2021
- Published by Taylor & Francis in Journal of Difference Equations and Applications
- Vol. 27 (4) , 481-496
Visibility in restricted involutions
We enumerate involutions avoiding any single pattern of length three according to the statistic ‘number of visible pairs’, namely, the number of non-adjacent columns in the bargraph representation of a given permutation that is mutually visible to each other. The proofs are combinatorial and reside on well-known bijections between pattern avoiding involutions and lattice paths.
- Open Access
- 11 February 2019
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 16 (2) , 445-463
Ascending runs in permutations and valued Dyck paths
Ascending runs in permutations and valued Dyck paths
- 11 February 2019
- Published by University of Primorska Press in Ars Mathematica Contemporanea
- Vol. 16 (2) , 445-463
Open AccessAscending runs in permutations and valued Dyck paths
Ascending runs in permutations and valued Dyck paths
- 15 February 2016
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 32 (3) , 265-285
A recursive basis for primitive forms in symplectic spaces and applications to Heisenberg groups
- 15 February 2016
- Published by Springer Nature in Acta Mathematica Sinica, English Series
- Vol. 32 (3) , 265-285
A recursive basis for primitive forms in symplectic spaces and applications to Heisenberg groups
- Open Access
Two descent statistics over 321-avoiding centrosymmetric involutions
Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum of the positions of these descents. Our results are based on two new bijections, one between centrosymmetric involutions in S_{2n} and subsets of {1,...,n}, and another one showing that certain statistics on Young diagrams that fit inside a rectangle are equidistributed. We also use the latter bijection to refine a known result stating that the distribution of the major index on 321-avoiding involutions is given by the q-analogue of the central binomial coefficients.
Open AccessTwo descent statistics over 321-avoiding centrosymmetric involutions
Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the distribution of some natural descent statistics on 321-avoiding centrosymmetric involutions, including the number of descents in the first half of the involution, and the sum of the positions of these descents. Our results are based on two new bijections, one between centrosymmetric involutions in S_{2n} and subsets of {1,...,n}, and another one showing that certain statistics on Young diagrams that fit inside a rectangle are equidistributed. We also use the latter bijection to refine a known result stating that the distribution of the major index on 321-avoiding involutions is given by the q-analogue of the central binomial coefficients.
- Open Access
Descent sets on 321-avoiding involutions and hook decompositions of partitions
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. The proof consists of a composition of three non-trivial bijections, one being the Robinson-Schensted correspondence, ultimately mapping those involutions with major index m into partitions of m whose Young diagram fits inside an n/2 by n/2 box. We also obtain a refinement that keeps track of the descent set, and we deduce an analogous result for the comajor index of 123-avoiding involutions.
Open AccessDescent sets on 321-avoiding involutions and hook decompositions of partitions
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. The proof consists of a composition of three non-trivial bijections, one being the Robinson-Schensted correspondence, ultimately mapping those involutions with major index m into partitions of m whose Young diagram fits inside an n/2 by n/2 box. We also obtain a refinement that keeps track of the descent set, and we deduce an analogous result for the comajor index of 123-avoiding involutions.