← Feed

Posts

• View post

  For a \(n\times n\) grid, the lights out game can be considered as solving a linear system over \(n^2\) variables in mod \(2\). It takes \(O(n^6)\) time. Surprisingly, there is a \(O(n^3)\) time algorithm. https://chaoxuprime.com/posts/2019-01-12-lights-out-game.html

• View post

  Recently Ke Shi and I showed that \(\mathbb{Z}_n\) can be covered by \(O\left(\frac{n}{\ell}\log n\right)\) sets of the form \(\{ax\pmod n \mid 0\leq x \leq \ell \}\), where \(a\in \mathbb{Z}_n\). https://arxiv.org/abs/2207.05017

• View post

  While attending Emléktábla Workshop, I realize most people are not using AI to it's full extent. So I wrote this so someone can get started quickly. https://chaoxu.prof/posts/2026-07-18-ai-agents-for-the-working-mathematician.html