A 3b1b monthly puzzle

Given d hyperplanes in n-dimensional space, maximum partitions possible?

A primer on Basic Category theory.

Complete graphs are very good but also very bad at the same time (in so far they use too many edges but are well connected and what not). Expander graphs are sparse but still carry many of the useful properties of complete graphs (in a way).

We learn about covering spaces and how they help us study more about the underlying topological spaces.

In this post, we go through the proof of galois for showing that there is no expression (radical terms) of coefficients of polynomial (degree 5 or higher) for its roots.

Contains lectures notes for Stat 410 taught at University of Illinois Urbana-Champaign. Suitable for first course in Statistics.

You have 10 points distributed on the plane, can you cover them using unit disks without any overlap.

In this blog, I will explain the theorem, do some interesting applications and shed light on the proof without going into technicalities.

This blog post derives the famous word2vec algorithm using skip gram method.