Explore >> Select a destination
|
You are here 
|
nhigham.com | ||
| | | | |
www.ethanepperly.com
|
|
| | | | | ||
| | | | |
www.ethanepperly.com
|
|
| | | | | ||
| | | | |
cp4space.hatsya.com
|
|
| | | | | At the end of the recent post on a combinatorial proof of Houston's identity, I ended with the following paragraph: This may seem paradoxical, but there's an analogous situation in fast matrix multiplication: the best known upper bound for the tensor rank of 4-by-4 matrix multiplication is 49, by applying two levels of Strassen's algorithm,... | |
| | | | |
www.jeremykun.com
|
|
| | | Last time we defined and gave some examples of rings. Recapping, a ring is a special kind of group with an additional multiplication operation that "plays nicely" with addition. The important thing to remember is that a ring is intended to remind us arithmetic with integers (though not too much: multiplication in a ring need not be commutative). We proved some basic properties, like zero being unique and negation being well-behaved. | ||
