29 search results - page 3 / 6 » Counting 1324-Avoiding Permutations |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
EJC
2007
13 years 4 months ago
2007
We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theo...
COMBINATORICS
2007
13 years 4 months ago
2007
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · × Zrk ) Sn and calculate its multi-distribution with some natural ...
COMBINATORICS
2002
13 years 4 months ago
2002
We consider the two permutation statistics which count the distinct pairs obtained from the final two terms of occurrences of patterns 1
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...