A new relationship between block designs
Summary: We propose a procedure of constructing new block designs starting from a given one by looking at the intersections of its blocks with various sets and grouping those sets according to the structure of the intersections. We introduce a symmetric relationship of friendship between block designs built on a set \(V\) and consider families of block designs where all designs are friends of each other, the so-called friendly families. We show that a friendly family admits a partial ordering. Furthermore, we exhibit a map from the power set of \(V\), partially ordered by inclusion, to a friendly family of a particular type which preserves the partial order.
- A Meshalkin theorem for projective geometries
- A new matching property for posets and existence of disjoint chains
- scientific article; zbMATH DE number 3126067 (Why is no real title available?)
- scientific article; zbMATH DE number 1382769 (Why is no real title available?)
- The CRC handbook of combinatorial designs
This page was built for publication: A new relationship between block designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402951)