Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Flavio Bonetti is active.

Publication


Featured researches published by Flavio Bonetti.


Journal of Combinatorial Theory | 2014

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

Marilena Barnabei; Flavio Bonetti; Sergi Elizalde; Matteo Silimbani

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 a ? n 2 ? × ? 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.


Theoretical Computer Science | 2016

Some permutations on Dyck words

Marilena Barnabei; Flavio Bonetti; Niccolò Castronuovo; Robert Cori

We examine three permutations on Dyck words. The first one, α, is related to the Baker and Norine theorem on graphs, the second one, β, is the symmetry, and the third one is the composition of these two. The first two permutations are involutions and it is not difficult to compute the number of their fixed points, while the third one has cycles of different lengths. We show that the lengths of these cycles are odd numbers. This result allows us to give some information about the interplay between α and β, and a characterization of the fixed points of α ź β .


Applied Mathematics Letters | 2009

Bijections and recurrences for integer partitions into a bounded number of parts

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani

Abstract Let Π s ( n ) denote the set of partitions of the integer n into exactly s parts, and Π s ( 2 ) ( n ) the subset of Π s ( n ) containing all partitions whose two largest parts coincide. We present a bijection between Π s ( 2 ) ( n ) and Π s − 1 ( m ) for a suitable m n in the cases s = 3 , 4 . Such bijections yield recurrence formulas for the numbers P 3 ( n ) and P 4 ( n ) of partitions of n into 3 and 4 parts. Furthermore, we show that the present approach can be extended to the case s = 5 , 6 .


International Scholarly Research Notices | 2013

Permutations and Pairs of Dyck Paths

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani

We define a map between the symmetric group and the set of pairs of Dyck paths of semilength . We show that the map is injective when restricted to the set of 1234-avoiding permutations and characterize the image of this map.


arXiv: Combinatorics | 2010

THE DESCENT STATISTIC ON 123-AVOIDING PERMUTATIONS

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani


European Journal of Combinatorics | 2009

The descent statistic on involutions is not log-concave

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani


Advances in Applied Mathematics | 2011

Restricted involutions and Motzkin paths

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani


arXiv: Combinatorics | 2009

The Eulerian numbers on restricted centrosymmetric permutations

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani


Discrete Mathematics & Theoretical Computer Science | 2009

The Eulerian distribution on centrosymmetric involutions

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani


European Journal of Combinatorics | 2010

The joint distribution of consecutive patterns and descents in permutations avoiding 3-1-2

Marilena Barnabei; Flavio Bonetti; Matteo Silimbani

Collaboration


Dive into the Flavio Bonetti's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Robert Cori

University of Bordeaux

View shared research outputs
Researchain Logo
Decentralizing Knowledge