On the number of Birch partitions

Simple item page
dc.creatorHell, Stephan
dc.date2006-12-28
dc.date2008-04-17
dc.date.accessioned2026-07-07T09:33:01Z
dc.date.available2026-07-07T09:33:01Z
dc.descriptionBirch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of Tverberg partitions that holds for arbitrary q, where q is the number of partition blocks. The proofs are based on direct arguments, and do not use the equivariant method from topological combinatorics.
dc.description8 pages, shortened version for publication in Discrete & Computational Geometry
dc.identifierhttps://arxiv.org/abs/math/0612823
dc.identifierhttp://arxiv.org/abs/math/0612823
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158988
dc.subjectCombinatorics
dc.subject05A18; 52A37
dc.titleOn the number of Birch partitions
dc.typetext

Files

Collections

arXiv