Hashing to Estimate the Size of a Stream
Problem: Estimate the number of distinct items in a data stream that is too large to fit in memory. Solution: (in python) import random def randomHash(modulus): a, b = random.randint(0,modulus-1),...
View ArticleClik here to view.
Zero Knowledge Proofs — A Primer
In this post we’ll get a strong taste for zero knowledge proofs by exploring the graph isomorphism problem in detail. In the next post, we’ll see how this relates to cryptography and the bigger...
View ArticleClik here to view.
A Spectral Analysis of Moore Graphs
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...
View ArticleClik here to view.
Two’s Complement and Group Theory
Before I discovered math, I was a first year undergrad computer science student taking Electrical Engineering 101. The first topic I learned was what bits and boolean gates are, and the second was the...
View ArticleClik here to view.
Socks, a matching game based on an additive combinatorics problem
Can you find a set of cards among these six, such that the socks on the chosen cards can be grouped into matching pairs? (Duplicate pairs of the same sock are OK) Spoilers If the cards are indexed as...
View Article