Explore >> Select a destination
|
You are here 
|
gilkalai.wordpress.com | ||
| | | | |
polymathprojects.org
|
|
| | | | | This post is meant to propose and discuss a polymath project and a sort of polymath project. I. A polymath proposal: Convex hulls of real algebraic varieties. One of the interesting questions regarding the polymath endeavor was: Can polymath be used to develop a theory/new area? My idea is to have a project devoted to... | |
| | | | |
yufeizhao.wordpress.com
|
|
| | | | | This post is adapted from my new expository survey Extremal regular graphs: independent sets and graph homomorphisms. The earliest result in extremal graph theory is usually credited to Mantel, who proved, in 1907, that a graph on $latex {n}$ vertices with no triangles contains at most $latex {n^2/4}$ edges, where the maximum is achieved for... | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things will happen: There is a red $ k$-clique; that is, a complete subgraph of $ k$... | |
| | | | |
spacedome.tv
|
|
| | | [AI summary] A technical explanation of trace estimation methods for large matrices using matrix-vector multiplications, including the Girard-Hutchinson estimator and code examples in Haskell. | ||
