Intersection patterns of planar sets

DOI10.1007/S00454-020-00205-ZMaRDI QIDQ2197685zbMATH OpenOpenAlexFDO

Authors Gil Kalai, Zuzana Safernova

Publication date 1 September 2020

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.00885

zbMATH Keywords

family of sets in the planepath-connected components

Mathematics Subject Classification ID

Inequalities and extremum problems in real or complex geometry (51M16) Analytic and descriptive geometry (51N99)

Abstract: Let $mathcalA=A_1,ldots,A_n$ be a family of sets in the plane. For $0leqi<n$, denote by $f_i$ the number of subsets $sigma$ of $1,ldots,n$ of cardinality $i+1$ that satisfy $$. Let $kgeq2$ be an integer. We prove that if each $k$-wise and $(k+1)$-wise intersection of sets from $mathcalA$ is empty, or a single point, or both open and path-connected, then $f_{k+1}=0$ implies $f_{k}leqc{f}_{k-1}$ for some positive constant $c$ depending only on $k$. Similarly, let $bgeq2,k>2b$ be integers. We prove that if each $k$-wise or $(k+1)$-wise intersection of sets from $mathcalA$ has at most $b$ path-connected components, which all are open, then $f_{k+1}=0$ implies $f_{k}leqc{f}_{k-1}$ for some positive constant $c$ depending only on $b$ and $k$. These results also extend to two-dimensional compact surfaces.

Review text

For the finite family of sets in the plane \(\mathcal{A}=\{A_1,\dots A_n\}\), the authors consider the intersection \(A({\sigma}) =\bigcap_{i\in \sigma}A_{i}\), where \(\sigma\subseteq[n]\), and the nerve of \(\mathcal{A}\) determined by \(N(\mathcal{A})=\{\sigma\subseteq[n]: A({\sigma})\not=\emptyset\}\). They also introduce \(f_k (\mathcal{A})=f_k (N(\mathcal{A}))=|\left \{\sigma\in N(\mathcal{A}):|\sigma |=k+1\right\}|\) and \(f^{\text{ind}}_k (\mathcal{A})=|\{\tau \in N(\mathcal{A}): |\tau|=k+1 \;\mathrm { and } \; \exists \sigma \in N(\mathcal{A}),\,\sigma \supset \tau,\,|\sigma |=k+2\}|\). Then, \(f^{\mathrm{ind}}_k (\mathcal{A}) \leq f_k (\mathcal{A})\leq \binom{n}{k+1}\). The main results of the paper are inequalities of the form \(f_k (\mathcal{A})\leq cf^{\mathrm{ind}}_{k-1} (\mathcal{A})\) (\(c\) is a constant) which are obtained by different assumptions for the family \(\mathcal{A}\).

Recommendations

• Intersection patterns of curves
• On planar intersection graphs with forbidden subgraphs
• Intersection patterns of convex sets
• An intersection property for starshaped sets in the plane
• Intersecting curves in the plane

Cites work

• A Problem of Geometry in R n
• An upper-bound theorem for families of convex sets
• Arrangements of Lines with a Large Number of Triangles
• Bounding Helly numbers via Betti numbers
• scientific article; zbMATH DE number 1795862 (Why is no real title available?)
• scientific article; zbMATH DE number 3394958 (Why is no real title available?)
• Intersection patterns of convex sets
• On the number of triangles in simple arrangements of pseudolines in the real projective plane
• Supersaturated graphs and hypergraphs
• The Upper Bound Conjecture and Cohen-Macaulay Rings

Cited in

(7)

• On unions and intersections of simply connected planar sets
• On planar intersection graphs with forbidden subgraphs
• scientific article; zbMATH DE number 4127225 (Why is no real title available?)
• Nerves, minors, and piercing numbers
• A stepping-up lemma for topological set systems
• Intersection patterns in spaces with a forbidden homological minor
• Intersection patterns of convex sets

This page was built for publication: Intersection patterns of planar sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197685)