AbstractWe give here a bijective proof of a relation between binomial coefficients and the distributions of the two statistics on the symmetric group which enumerate the permutations according to their number of anti-exceedances and their parity
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
We study a number of problems of a group-theoretic origin or nature, but from a strongly additive-co...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
AbstractWe give here a bijective proof of a relation between binomial coefficients and the distribut...
RésuméNous prouvons directement que la statistique des anti-excédances est une statistique eulérienn...
Given an arbitrary positive integer d, we investigate the hypotheses under which the elements of a p...
Given an arbitrary positive integer d, we investigate the hypotheses under which the elements of a p...
We establish parity theorems for statistics on the symmetric group Sn, the derangements Dn, and the ...
McMahon’s result that states the length and major index statis-tics are equidistributed on the symme...
AbstractWe study permutation enumeration of the hyperoctahedral group Bn through a combinatorial use...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
AbstractIn the combinatorial study of the coefficients of a bivariate polynomial that generalizes bo...
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permut...
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permut...
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
We study a number of problems of a group-theoretic origin or nature, but from a strongly additive-co...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
AbstractWe give here a bijective proof of a relation between binomial coefficients and the distribut...
RésuméNous prouvons directement que la statistique des anti-excédances est une statistique eulérienn...
Given an arbitrary positive integer d, we investigate the hypotheses under which the elements of a p...
Given an arbitrary positive integer d, we investigate the hypotheses under which the elements of a p...
We establish parity theorems for statistics on the symmetric group Sn, the derangements Dn, and the ...
McMahon’s result that states the length and major index statis-tics are equidistributed on the symme...
AbstractWe study permutation enumeration of the hyperoctahedral group Bn through a combinatorial use...
AbstractA permutation is called parity alternating if its entries assume even and odd integers alter...
AbstractIn the combinatorial study of the coefficients of a bivariate polynomial that generalizes bo...
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permut...
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permut...
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
We give explicit, asymptotically sharp bounds for the probability that a pair of random permutations...
We study a number of problems of a group-theoretic origin or nature, but from a strongly additive-co...
Abstract. It is well-known, and was first established by Knuth in 1969, that the number of 321-avoid...
DOI
Add to ORKG