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 co.combinatorics
Search options not deleted
user 151271
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
3
votes
Accepted
Number of monotone functions on a square grid
Thanks to Alex Lazar for referring me to the right keywords.
This is called something like "the number of plane partitions that fit inside the $n \times n \times n$ box", and can be computed as :
$$
P …
- 231
5
votes
1
answer
178
views
Number of monotone functions on a square grid
How many monotone mappings $[n] \times [n] \to [n]$ exist? Here:
$[n]$ denotes $\{1, 2, \ldots, n\}$,
Monotone means that if $x_1 \le x_2$ and $y_1 \le y_2$, then $f(x_1, y_1) \le f(x_2, y_2)$.
I'm …
- 231