Sciweavers

158 search results - page 1 / 32
» Some counting problems related to permutation groups
Sort
View
DM
2000
89views more  DM 2000»
13 years 4 months ago
Some counting problems related to permutation groups
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...
Peter J. Cameron
DM
2010
82views more  DM 2010»
13 years 5 months ago
The complexity of the weight problem for permutation and matrix groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
Peter J. Cameron, Taoyang Wu
EJC
2007
13 years 4 months ago
Symmetric functions, generalized blocks, and permutations with restricted cycle structure
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...
Attila Maróti
CORR
2011
Springer
156views Education» more  CORR 2011»
12 years 12 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
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...
Scott Aaronson
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 2 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu