A new relationship between block designs
classification
🧮 math.CO
keywords
designsblockfriendlyfamiliesfamilyintersectionspartialrelationship
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.