Timeline for Examples where adding complexity made a problem simpler
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 1, 2012 at 3:15 | history | edited | Brian Rushton |
Retagged
|
|
| Nov 27, 2012 at 20:18 | history | edited | Brian Rushton | CC BY-SA 3.0 |
Retagged, added 5th example
|
| Nov 26, 2012 at 19:56 | answer | added | Rodrigo A. Pérez | timeline score: 3 | |
| Nov 26, 2012 at 19:32 | comment | added | Lior Bary-Soroker | What about zeta functions? For example, if one wants to know how many points a variety has in a finite field $\mathbb{F}_p$, then he should study the zeta function of the variety which encodes the data of the number of points in every extension of $\mathbb{F}_p$. | |
| Nov 26, 2012 at 19:27 | answer | added | kjetil b halvorsen | timeline score: 2 | |
| Nov 26, 2012 at 4:42 | comment | added | Minhyong Kim | My favorite elementary example is the computation of $1+2+\cdots +n$, which is easier to do twice than once. | |
| Nov 26, 2012 at 4:36 | history | edited | KConrad | CC BY-SA 3.0 |
corrected spelling
|
| Nov 26, 2012 at 3:44 | answer | added | Pablo Zadunaisky | timeline score: 3 | |
| Nov 26, 2012 at 2:43 | answer | added | Feldmann Denis | timeline score: 6 | |
| Nov 26, 2012 at 2:26 | answer | added | DavidLHarden | timeline score: 1 | |
| Nov 25, 2012 at 21:16 | history | made wiki | Post Made Community Wiki by Brian Rushton | ||
| Nov 25, 2012 at 18:30 | comment | added | Goldstern | According to the (FAQ)[mathoverflow.net/faq#communitywiki] you can make the post CW either by editing the post and checking the CW box (below the bottom right corner of the edit box, on my browser), or by editing it 8 times. Or by getting 4 of us to edit your post. | |
| Nov 25, 2012 at 14:15 | comment | added | Benjamin Steinberg | Many examples of seemingly adding complexity are actually adding structure. The more structure an object has the easier it is to say something about it (in general). This is why $\mathbb Z$ is simpler than $\mathbb N$. This is also why Hilbert spaces are in some sense nicer to work with than untopologized infinite dimensional vector spaces. | |
| Nov 25, 2012 at 8:54 | answer | added | Pietro Majer | timeline score: 10 | |
| Nov 25, 2012 at 3:52 | answer | added | Michael Joyce | timeline score: 4 | |
| Nov 25, 2012 at 0:59 | answer | added | Denis | timeline score: 7 | |
| Nov 24, 2012 at 23:50 | comment | added | Pietro Majer | somehow related with mathoverflow.net/questions/40005/… | |
| Nov 24, 2012 at 23:20 | answer | added | Goldstern | timeline score: 17 | |
| Nov 24, 2012 at 23:08 | history | asked | Brian Rushton | CC BY-SA 3.0 |