Outer Web | Explore

Explore >> Select a destination

You are here		anuragbishnoi.wordpress.com Strong blocking sets and minimal codes from expander graphs \| Anurag's Math Blog
\|	\|	lucatrevisan.wordpress.com CS294 Lecture 15: Abelian Cayley graphs \| in theory	2.1 parsecs away Travel
\|	\|	In which we show how to find the eigenvalues and eigenvectors of Cayley graphs of Abelian groups, we find tight examples for various results that we proved in earlier lectures, and, along the way, we develop the general theory of harmonic analysis which includes the Fourier transform of periodic functions of a real variable, the...	2.1 parsecs away Travel
\|	\|	dominiczypen.wordpress.com Making critical graphs as regular as possible \| Musings on general topology and orderings	2.7 parsecs away Travel
\|	\|	Suppose you want to have a graph $latex G = (V,E)$ with chromatic number $latex \chi(G)$ equaling some value $latex k$, such that $latex G$ is minimal with this property. So you end up with a $latex k$-(vertex-)critical graph. It is easy to construct critical graphs by starting with some easy-to-verify example like $latex C_5$...	2.7 parsecs away Travel
\|	\|	xenaproject.wordpress.com Formalising modern research mathematics in real time \| Xena	2.8 parsecs away Travel
\|	\|	(This is a guest post by Bhavik Mehta) On March 16, 2023, a paper by Campos, Griffiths, Morris, and Sahasrabudhe appeared on the arXiv, announcing an exponential improvement to the upper bound on Ramsey numbers, an open problem since 1935. Around the same time, posts by Terence Tao, Timothy Gowers and Gil Kalai appeared, all...	2.8 parsecs away Travel
\|	\|	vitalyobukhov.wordpress.com Shurali the cat \| #about.me	6.3 parsecs away Travel
\|		Visit the post for more.	6.3 parsecs away Travel