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 1004
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
19
votes
Accepted
Rooks in three dimensions
As far as I know, it is still open whether or not there is any finite number of rooks which can force checkmate. However, this is possible. I answered the question over at math.stackexchange describin …
- 17.1k
60
votes
Accepted
Mean minimum distance for N random points on a one-dimensional line
This can answered without any complicated maths.
It can be related to the following: Imagine you have $N$ marked cards in a pack of $m$ cards and shuffle them randomly. What is the probability that t …
- 17.1k