202 search results - page 5 / 41 » Counting Distance Permutations |
COMBINATORICS
2000
13 years 7 months ago
2000
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
SODA
2010
ACM
14 years 5 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 ...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper addresses an aspect of controllability in a single-leader network when the agents are homogeneous. In such a network, indices are not assigned to the individual agents a...
EJC
2007
13 years 7 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...