In this article, we present an algorithm to compute the 9th Dedekind Number. The key aspects are the use of matrix multiplication and symmetries in the free distributive lattice, which are detected with techniques from Formal Concept Analysis.
Solving systems of equations on antichains for the computation of the ninth Dedekind Number
Edit distance and its computation
Minimum-sized generating sets of the direct powers of the free distributive lattice on three generators and a Sperner theorem
![QR code for arXiv:2304.00895 [math.CO]](http://oss.arxitics.com/images/favicon.svg)