pith. sign in

arxiv: 2303.16467 · v2 · pith:BLRSAWQTnew · submitted 2023-03-29 · 🧮 math.CO · math.MG

A complex analogue of the Goodman-Pollack-Wenger theorem

classification 🧮 math.CO math.MG
keywords familysetstheoremanaloguecomplexconditionconvexgoodman-pollack-wenger
0
0 comments X
read the original abstract

A \textit{$k$-transversal} to family of sets in $\mathbb{R}^d$ is a $k$-dimensional affine subspace that intersects each set of the family. In 1957 Hadwiger provided a necessary and sufficient condition for a family of pairwise disjoint, planar convex sets to have a $1$-transversal. After a series of three papers among the authors Goodman, Pollack, and Wenger from 1988 to 1990, Hadwiger's Theorem was extended to necessary and sufficient conditions for $(d-1)$-transversals to finite families of convex sets in $\mathbb{R}^d$ with no disjointness condition on the family of sets. We prove an analogue of the Goodman-Pollack-Wenger theorem in the complex setting.

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.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On colorful generalizations of the Goodman--Pollack transversal problem

    math.CO 2026-04 unverdicted novelty 7.0

    Proves colorful and matroidal generalizations of the Goodman-Pollack transversal problem for convex sets in F^d using matroidal joins and connectivity estimates.

  2. On colorful generalizations of the Goodman--Pollack transversal problem

    math.CO 2026-04 unverdicted novelty 6.0

    A colorful and matroidal solution to the Goodman-Pollack transversal problem is established via new matroidal joins and equivariant map techniques, unifying several prior theorems.