Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with permutations
Search options not deleted
user 47059
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
3
votes
1
answer
268
views
Is the Cayley distance on permutation (matrices) equivalent to the Riemannian metric on $O(n)$?
Identifying permutations $\sigma\in S_n$ with their respective permutation matrices, it is not hard to see that these matrices are all orthogonal. … Via the above identification, this induces another metric on permutations.
Are there any comparison results? …
- 131