You are here |
xcorr.net | ||
| | | |
ksimek.github.io
|
|
| | | | ||
| | | |
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$. | |
| | | |
nhigham.com
|
|
| | | | In linear algebra terms, a correlation matrix is a symmetric positive semidefinite matrix with unit diagonal. In other words, it is a symmetric matrix with ones on the diagonal whose eigenvalues are all nonnegative. The term comes from statistics. If $latex x_1, x_2, \dots, x_n$ are column vectors with $latex m$ elements, each vector containing... | |
| | | |
pfzhang.wordpress.com
|
|
| | Consider a monic polynomial with integer coefficients: $latex p(x)=x^d + a_1 x^{d-1} + \cdots + a_{d-1}x + a_d$, $latex a_j \in \mathbb{Z}$.The complex roots of such polynomials are called algebraic integers. For example, integers and the roots of integers are algebraic integers. Note that the Galois conjugates of an algebraic integer are also algebraic integers.... |