Explore >> Select a destination
|
You are here 
|
njwildberger.com | ||
| | | | |
carcinisation.com
|
|
| | | | | Gödel's theorems say something important about the limits of mathematical proof. Proofs in mathematics are (among other things) arguments. A typical mathematical argument may not be "inside" the universe it's saying something about. The Pythagorean theorem is a statement about the geometry of triangles, but it's hard to make a proof of it using nothing... | |
| | | | |
cre8math.com
|
|
| | | | | This might sound like an odd question -- most students seem to think so when I ask it. The reason it sounds a little strange is that most students -- even when I taught at a magnet STEM high school -- think there's just one type of geometry: Euclidean geometry. This isn't surprising given the... | |
| | | | |
rjlipton.com
|
|
| | | | | Ideas from algebraic geometry and arithmetic complexity Hyman Bass is a professor of both mathematics and mathematics education at the University of Michigan, after a long and storied career at Columbia University. He was one of the first generation of mathematicians to investigate K-theory, and gave what is now the recognized definition of the first... | |
| | | | |
nickhar.wordpress.com
|
|
| | | 1. Low-rank approximation of matrices Let $latex {A}&fg=000000$ be an arbitrary $latex {n \times m}&fg=000000$ matrix. We assume $latex {n \leq m}&fg=000000$. We consider the problem of approximating $latex {A}&fg=000000$ by a low-rank matrix. For example, we could seek to find a rank $latex {s}&fg=000000$ matrix $latex {B}&fg=000000$ minimizing $latex { \lVert A - B... | ||
