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 24076
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
7
votes
Is there an efficient algorithm to check whether two matrices are the same up to row and col...
Regarding the first question: there is a counterexample of size $91$.
There are four non-isomorphic finite projective planes of order $9$: https://doi.org/10.1016/0012-365X(91)90280-F, http://oeis.or …
- 6,101
6
votes
Accepted
Betweenness in permutations
By induction, for any $k$ permutations, there is a subset $S_k \subseteq \{1,2,\dots,n\}$ of size at least $n^{1/2^{k-1}}$ that is monotone in each of the $k$ permutations, and so the relations $R(\pi_ … A construction of $k$ permutations of length $2^{2^{k-1}}$ with no common monotone subsequence of length $3$ does not seem to be easy to describe. …
- 6,101