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 open-problems
Search options not deleted
user 13093
If it turns out that a problem is equivalent to a known open problem, then the open-problem tag is added. After that, the question essentially becomes, "What is known about this problem? What are some possible ways to approach this problem? What are some ways that people have tried to attack it before, and with what results?"
7
votes
A long-lasting conjecture of Pólya & Szegő
Together with D. Bucur we propose a strategy which could prove the conjecture for a fixed $n \geq 5$ using a finite number of certified numerical computations.
Our paper can be found here: On the poly …
- 2,222