Let m be a positive integer, and p n (m) the proportion of permutations of the symmetric group S n that admit an m-th root. Calculating the exponential generating function of these permutations, we show the following asymptotic formula where ' is the Euler function and m an explicit constant
AbstractAn analogue of the exponential generating function for derangement numbers in the symmetric ...
AbstractIn this paper we study the distribution of the number of occurrences of a permutation σ as a...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...
AbstractWe study the asymptotic behavior of two statistics defined on the symmetric group Sn when n ...
AbstractThis paper counts the number of idempotent elements in the symmetric semigroup on n elements...
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...
It is well known that a permutation group of degree n>3 can be generated by [n/2] elements. In this...
Summary: We give a formula for the number of elements in a fixed conjugacy class of a symmetric grou...
Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-ana...
Abstract. We give explicit, asymptotically sharp bounds for the probability that a pair of random pe...
AbstractA general explicit upper bound is obtained for the proportion P(n,m) of elements of order di...
The second author had previously obtained explicit generating functions for moments of characteristi...
AbstractIn this paper, we continue a long line of research which shows that many generating function...
AbstractWith any permutation o in Sn, the symmetric group on {1, 2,…, n}, a fraction in the variable...
AbstractAn analogue of the exponential generating function for derangement numbers in the symmetric ...
AbstractIn this paper we study the distribution of the number of occurrences of a permutation σ as a...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...
AbstractWe study the asymptotic behavior of two statistics defined on the symmetric group Sn when n ...
AbstractThis paper counts the number of idempotent elements in the symmetric semigroup on n elements...
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...
It is well known that a permutation group of degree n>3 can be generated by [n/2] elements. In this...
Summary: We give a formula for the number of elements in a fixed conjugacy class of a symmetric grou...
Eulerian quasisymmetric functions were introduced by Shareshian and Wachs in order to obtain a q-ana...
Abstract. We give explicit, asymptotically sharp bounds for the probability that a pair of random pe...
AbstractA general explicit upper bound is obtained for the proportion P(n,m) of elements of order di...
The second author had previously obtained explicit generating functions for moments of characteristi...
AbstractIn this paper, we continue a long line of research which shows that many generating function...
AbstractWith any permutation o in Sn, the symmetric group on {1, 2,…, n}, a fraction in the variable...
AbstractAn analogue of the exponential generating function for derangement numbers in the symmetric ...
AbstractIn this paper we study the distribution of the number of occurrences of a permutation σ as a...
The Eulerian numbers count the number of permutations in the symmetric groups with a certain number ...