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 1907
Questions related to permutations, bijections from a finite (or sometimes infinite) set to itself.
11
votes
Number of permutations with longest increasing subsequences of length at most $n$
The gross asymptotics are that the $k$th root of the number of such permutations approaches $n^2$. … Note that in most of the literature, $k$ and $n$ will play the opposite roles, i.e., the question will be about enumeration of permutations in $S_n$ with no increasing subsequence of size greater than …
- 1,305