Explore >> Select a destination
|
You are here 
|
graphneural.network | ||
| | | | |
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.... | |
| | | | |
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$. | |
| | | | |
yufeizhao.com
|
|
| | | | | How high can the second eigenvalue multiplicity of a connected bounded degree graph get? | |
| | | | |
jaydaigle.net
|
|
| | | We continue our exploration of what numbers are, and where mathematicians keep finding weird ones. In the first three parts we extended the natural numbers in two ways: algebraically and analytically. Those approaches gave overlapping but distinct sets of numbers. This week we combine them to get the complex numbers, and see some hints of why the complex numbers are so useful-and so frustrating. | ||
