Explore >> Select a destination
|
You are here 
|
beyondloom.com | ||
| | | | |
mattbaker.blog
|
|
| | | | | I'm teaching Graduate Algebra this semester, and I wanted to record here the proof I gave in class of the (existence part of the) structure theorem for finitely generated modules over a PID. It's a standard argument, based on the existence of the Smith Normal Form for a matrix with entries in a PID, but... | |
| | | | |
www.jeremykun.com
|
|
| | | | | For fixed integers $ r > 0$, and odd $ g$, a Moore graph is an $ r$-regular graph of girth $ g$ which has the minimum number of vertices $ n$ among all such graphs with the same regularity and girth. (Recall, A the girth of a graph is the length of its shortest cycle, and it's regular if all its vertices have the same degree) Problem (Hoffman-Singleton): Find a useful constraint on the relationship between $ n$ and $ r$ for Moore graphs of girth $ 5$ and degree $ r$. | |
| | | | |
codethrasher.com
|
|
| | | | | A linear mapping from a vector space to a field of scalars. In other words, a linear function which acts upon a vector resulting in a real number (scalar) \begin{equation} \alpha\,:\,\mathbf{V} \longrightarrow \mathbb{R} \end{equation} Simplistically, covectors can be thought of as "row vectors", or: \begin{equation} \begin{bmatrix} 1 & 2 \end{bmatrix} \end{equation} This might look like a standard vector, which would be true in an orthonormal basis, but it is not true generally. | |
| | | | |
ropmann.wordpress.com
|
|
| | | Visit the post for more. | ||
