Resumen de Embedding dimension phenomena in intersection complete codes
R. Amzi Jeffs
Two tantalizing invariants of a combinatorial code C⊆2[n] are cdim(C) and odim(C), the smallest dimension in which C can be realized by convex closed or open sets, respectively. Cruz, Giusti, Itskov, and Kronholm showed that for intersection complete codes C with m+1 maximal codewords, odim(C) and cdim(C) are both bounded above by max{2,m}. Results of Lienkaemper, Shiu, and Woodstock imply that odim and cdim may differ, even for intersection complete codes. We add to the literature on open and closed embedding dimensions of intersection complete codes with the following results:
If C is a simplicial complex, then cdim(C)=odim(C), If C is intersection complete, then cdim(C)≤odim(C), If C⊆2[n] is intersection complete with n≥2, then cdim(C)≤min{2d+1,n−1}, where d is the dimension of the simplicial complex of C, and For each simplicial complex Δ⊆2[n] with m≥2 facets, the code SΔ :=(Δ∗(n+1))∪{[n]} ⊆2[n+1] is intersection complete, has m+1 maximal codewords, and satisfies odim(SΔ)=m. In particular, for each n≥3 there exists an intersection complete code C⊆2[n] with odim(C)=(n−1⌊(n−1)/2⌋).
A key tool in our work is the study of sunflowers: arrangements of convex open sets in which the sets simultaneously meet in a central region, and nowhere else. We use Tverberg’s theorem to study the structure of “k-flexible" sunflowers, and consequently obtain new lower bounds on odim(C) for intersection complete codes C.
