|
You are here |
matheuscmss.wordpress.com | ||
| | | | |
terrytao.wordpress.com
|
|
| | | | | Many modern mathematical proofs are a combination of conceptual arguments and technical calculations. There is something of a tradeoff between the two: one can add more conceptual arguments to try ... | |
| | | | |
almostsuremath.com
|
|
| | | | | Continuing on from the previous post, I look at cases where the abstract concept of states on algebras correspond to classical probability measures. Up until now, we have considered commutative real algebras but, before going further, it will help to look instead at algebras over the complex numbers $latex {{\mathbb C}}&fg=000000$. In the commutative case,... | |
| | | | |
qchu.wordpress.com
|
|
| | | | | (Part I of this post ishere) Let $latex p(n)$ denote the partition function, which describes the number of ways to write $latex n$ as a sum of positive integers, ignoring order. In 1918 Hardy and Ramanujan proved that $latex p(n)$ is given asymptotically by $latex \displaystyle p(n) \approx \frac{1}{4n \sqrt{3}} \exp \left( \pi \sqrt{ \frac{2n}{3}... | |
| | | | |
austinmorlan.com
|
|
| | | It took me longer than necessary to understand how a rotation transform matrix rotates a vector through three-dimensional space. Not because it's a difficult concept but because it is often poorly explained in textbooks. Even the most explanatory book might derive the matrix for a rotation around one axis (e.g., x) but then present the other two matrices without showing their derivation. I'll explain my own understanding of their derivation in hopes that it will enlighten others that didn't catch on right away. | ||