Skip to main content
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
Search options not deleted user 17761

Questions designed to generate a "big list" of certain results, examples, conjectures, etc. via many individual answers, each contributing one or a few instances. Such a question should typically be in Community Wiki mode (CW); after asking, please, flag for moderators attention requesting the question to be made CW.

9 votes

How has modern algebraic geometry affected other areas of math?

The size of Fourier coefficients of modular forms can only be studied (so far) via the use of very sophisticated tools from Algebraic Geometry. Of course, one could argue that modular forms are part o …
gmvh's user avatar
  • 3,065
2 votes

Why linear algebra is fun!(or ?)

One nice application of linear algebra (mainly dimension theory) is the impossibility of the duplication of the cube (problem that dates back to the Greeks and was solved only in 1837 by Wantzel).
Martin Sleziak's user avatar
9 votes

Examples of seemingly elementary problems that are hard to solve?

Take two commutative rings $A$ and $B$ such that the polynomial rings $A[X]$ and $B[X]$ are isomorphic. Does this imply that $A$ and $B$ are isomorphic? (I think this is still open.)
guy's user avatar
  • 21
2 votes

Generalizing a problem to make it easier

Here is a riddle which proves to be extremely hard: Imagine a finite assembly in which some people happen to be friends (friendship is a symmetric relation but not transitive and you are not your own …
guy's user avatar
  • 21