Title	Canonical Tverberg partitions.
Creator	Por, Attila
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-10-27T15:00
Description	We show that for every $d,r,N$ positive integers there exists $n = n(d,r,N)$ such that Any sequence $p$ in $R^d$ of length $n$ has a subsequence $pÃ¢$ of length $N$ such that Every subsequence of $pÃ¢$ of length $T(d,r) = (r-1)(d+1)+1$ has identical Tverberg partitions, namely the Ã¢rainbowÃ¢ Ã¢ partitions. A partition (or coloring) of the first $T(d,r)$ integers into $r$ parts (with $r$ colors) is called rainbow If every color appears exactly once in each of the following $r$-tuples: $(1, â ¦., r), (r, â ¦, 2r-1), (2r-1, â ¦, 3r-2), â ¦., ((d-1)r-(d-2), â ¦, d r-(d-1))$.
Extent	45.0
Subject	Mathematics; Convex and discrete geometry; Algebraic topology; Combinatorics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Western Kentucky University
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-02-28
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0376574
URI	http://hdl.handle.net/2429/68436
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos