- #1

swampwiz

- 486

- 44

For example, the original set (1,2,3,4,5) can have the swap (24) and result in (1,4,3,2,5). is there a set of specific swaps for each net result permutation?

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- I
- Thread starter swampwiz
- Start date

- #1

swampwiz

- 486

- 44

For example, the original set (1,2,3,4,5) can have the swap (24) and result in (1,4,3,2,5). is there a set of specific swaps for each net result permutation?

- #2

- #3

swampwiz

- 486

- 44

- #4

Office_Shredder

Staff Emeritus

Science Advisor

Gold Member

- 5,474

- 1,414

.

- #5

swampwiz

- 486

- 44

- #6

swampwiz

- 486

- 44

- #7

Vanadium 50

Staff Emeritus

Science Advisor

Education Advisor

- 29,610

- 15,079

Is there a theorem that states that a set of binary swaps can result in any permutation?

Yes, there is such a theorem. This is worded as: "The symmetric group is generated by transpositions"

Note that this overdoes it - it proves that a set of

- #8

Infrared

Science Advisor

Gold Member

- 988

- 550

- #9

swampwiz

- 486

- 44

Yes, that is the idea I was getting at in a subsequent post.

Share:

- Replies
- 24

- Views
- 697

- Replies
- 19

- Views
- 2K

- Last Post

- Replies
- 21

- Views
- 592

- Last Post

- Replies
- 23

- Views
- 2K

- Replies
- 7

- Views
- 853

- Replies
- 11

- Views
- 1K

- Replies
- 5

- Views
- 414

- Replies
- 1

- Views
- 578

- Replies
- 34

- Views
- 1K

- Last Post

- Replies
- 6

- Views
- 641