Lukas Klawuhn

Intersection numbers for designs in regular semilattices

We generalize intersection numbers for combinatorial designs to designs in finite meet-semilattices satisfying suitable regularity conditions. While designs in regular semilattices go back to Delsarte, our regularity assumptions are weaker than his and need not give rise to an association scheme. In this framework, we...