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 5793
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
8
votes
Soft question: mathematics about truchet tiles
To answer your question 3:
Indeed, in statistical mechanics such a model is known as a "loop model". In general an "O(n) loop model" (this is not the place to rant on why this is a misnomer especial …
- 356
5
votes
Accepted
transposing "unrimmed" permutations
The answer is $a_n=8(n-2)!$ for $n\ge 4$.
Subdivide into cases depending on the values at corners and count. (6 cases give 1, 1 case gives 2 times $(n-2)!$)
- 356