The distance of a permutation from a subgroup of S_n

Details The distance of a permutation from a subgroup of S_n The distance of a permutation from a subgroup of S_n

2005-11-20

arxiv.org/abs/math/0511501v1

Mathematics

Combinatorics

6 pages, 5 figures

Scientific paper

We show that the problem of computing the distance of a given permutation from a subgroup $H$ of $S_n$ is in general NP-complete, even under the restriction that $H$ is elementary Abelian of exponent 2. The problem is shown to be polynomial-time equivalent to a problem related to finding a maximal partition of the edges of an Eulerian directed graph into cycles and this problem is in turn equivalent to the standard NP-complete problem of Boolean satisfiability.

Affiliated with

Also associated with

No associations

Rating

The distance of a permutation from a subgroup of S_n does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The distance of a permutation from a subgroup of S_n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The distance of a permutation from a subgroup of S_n will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-291177