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 1384
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
22
votes
1
answer
749
views
Low-level proof of identity related to Weierstrass P-function
A theorem which can be extracted from Theorem V.1.1 of Silverman's "advanced topics in the theory of elliptic curves" is the following. Here $\mathbb{Q}(u)$ denotes rational functions in a variable $u …
- 35.5k
3
votes
Accepted
A question on linear recurrence
I don't know what "dominating" means so perhaps this isn't a counterexample, but how about $-p(x)=x^5 - x^4 - x^3 - x^2 + x + 1=(x^2-x-1)(x^3-1)$ (which has a unique real root greater than 1), with $a …
- 41.4k
31
votes
What to do when your research runs into a computationally challenging problem?
When faced with a computationally intractable problem, here's one way of making progress: give up!
Here's why giving up might turn out to be a good idea. Sometimes I feel "if I could just compute a f …
- 41.4k
9
votes
Neutral tic tac toe
For what it's worth, here are a summary of the answers so far for the Misere game:
1x1: P2 win (poisoned chalice)
2x2: P1 win (P1 makes an arbitrary move)
3x3: P1 win (P1 plays in the centre, and h …
- 41.4k
9
votes
Accepted
Equality of the sum of powers
An even harder problem than $t>2$ and $n=m$ is the Prouhet–Tarry–Escott problem. Now I leave it to you and google to find lots of examples ;-)
http://en.wikipedia.org/wiki/Prouhet-Tarry-Escott_proble …
- 47.3k