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 125179
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
2
votes
1
answer
179
views
Inversion inequalities
Do there exist $n$ permutations $(\pi_i; 1 \le i \le n)$ of $[k]$ such that for any transposition $\sigma = (j, l)$, $1 \le j, l \le k$,
\begin{equation}
\label{1}
(*) \quad \sum_{i = 1}^n inv(\pi_i \circ …
- 151