The 3-way flower intersection problem for Steiner triple systems

TL;DR

This paper characterizes the possible intersection sizes of three Steiner triple systems sharing a common flower at a point, providing a complete set description for most cases and advancing combinatorial design theory.

Contribution

It determines the set J3F(r) for all positive integers r ≡ 0,1 (mod 3), clarifying the intersection structure of three mutually intersecting Steiner triple systems.

Findings

Explicitly characterizes J3F(r) for most r values

Shows J3F(r) equals I3F(r) for r ≡ 0,1 (mod 3)

Provides partial results for specific r values like 6, 7, 9, 24

Abstract

The flower at a point x in a Steiner triple system (X; B) is the set of all triples containing x. Denote by J3F(r) the set of all integers k such that there exists a collection of three STS(2r+1) mutually intersecting in the same set of k + r triples, r of them being the triples of a common flower. In this article we determine the set J3F(r) for any positive integer r = 0, 1 (mod 3) (only some cases are left undecided for r = 6, 7, 9, 24), and establish that J3F(r) = I3F(r) for r = 0, 1 (mod 3) where I3F(r) = {0, 1,..., 2r(r-1)/3-8, 2r(r-1)/3-6, 2r(r-1)/3}.