AbstractAdin and Roichman proved a set of refined sign-balance identities on 321-avoiding permutations respecting the last descent of the permutations, which we call the identities of Adin–Roichman type. In this work, we construct a new involution on plane trees that proves refined sign-balance properties on 321-avoiding alternating permutations respecting the first and last entries of the permutations respectively and obtain two sets of identities of Adin–Roichman type
AbstractBy using the Newton interpolation formula, we generalize the recent identities on the Catala...
Diaconis and Gamburd computed moments of secular coefficients in the CUE ensemble. We use the charac...
AbstractUsing generating functions, MacMahon proved in 1916 the remarkable fact that the major index...
AbstractThe number of even 321-avoiding permutations of length n is equal to the number of odd ones ...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
AbstractThe inversion number and the major index are equidistributed on the symmetric group. This is...
AbstractWe enumerate the alternating sign matrices that contain exactly one −1 according to their nu...
AbstractWe extend Stanley's work on alternating permutations with extremal number of fixed points in...
AbstractA classical result of Euler states that the tangent numbers are an alternating sum of Euleri...
AbstractA half-descent of an alternating permutation π is an event that π2i>π2i+2, which is defined ...
AbstractWe present a development of determinantal identities over commutative semirings. This includ...
AbstractA well-known theorem of Knuth establishes a bijection between permutations in S(N) with no d...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractLet σ=(σ1,…,σN), where σi=±1, and let C(σ) denote the number of permutations π of 1,2,…,N+1,...
AbstractBy using the Newton interpolation formula, we generalize the recent identities on the Catala...
Diaconis and Gamburd computed moments of secular coefficients in the CUE ensemble. We use the charac...
AbstractUsing generating functions, MacMahon proved in 1916 the remarkable fact that the major index...
AbstractThe number of even 321-avoiding permutations of length n is equal to the number of odd ones ...
AbstractIn Bloom and Saracino (2009) [2] we proved that a natural bijection Γ:Sn(321)→Sn(132) that R...
AbstractBy considering bijections from the set of Dyck paths of length 2n onto each of Sn(321) and S...
AbstractThe inversion number and the major index are equidistributed on the symmetric group. This is...
AbstractWe enumerate the alternating sign matrices that contain exactly one −1 according to their nu...
AbstractWe extend Stanley's work on alternating permutations with extremal number of fixed points in...
AbstractA classical result of Euler states that the tangent numbers are an alternating sum of Euleri...
AbstractA half-descent of an alternating permutation π is an event that π2i>π2i+2, which is defined ...
AbstractWe present a development of determinantal identities over commutative semirings. This includ...
AbstractA well-known theorem of Knuth establishes a bijection between permutations in S(N) with no d...
AbstractWe give a new expression for the number of factorizations of a full cycle into an ordered pr...
AbstractLet σ=(σ1,…,σN), where σi=±1, and let C(σ) denote the number of permutations π of 1,2,…,N+1,...
AbstractBy using the Newton interpolation formula, we generalize the recent identities on the Catala...
Diaconis and Gamburd computed moments of secular coefficients in the CUE ensemble. We use the charac...
AbstractUsing generating functions, MacMahon proved in 1916 the remarkable fact that the major index...