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 5267
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
7
votes
Does War have infinite expected length?
Sorry to make this an answer, but the formatting needs specification.
Here is a stupid 8-card version of your rules, top player going first.
AD KH KS AC
KD AH AS KC
If I read your rules correctly, …
- 2,704
4
votes
Lotteries, Turan's problem, and minimization of risk
This is not a real "answer" but an observation. Each 6-tuple has ${6 \choose 4}$ 4-tuples, so it stands to reason that once $N$ is some smallish multiple $m$ of ${50\choose 4}/{6\choose 4}$ then Bob's …
- 2,704