Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

7

DCG
2008

favoriteEmaildiscussreport

88views more DCG 2008»

On the Number of Birch Partitions

13 years 4 months ago

On the Number of Birch Partitions

Download www.math.tu-berlin.de

Birch 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. We furthermore investigate whether these results admit a topological version.

Stephan Hell

Real-time Traffic

DCG 2008 | Discrete Geometry | Lower Bound | Tverberg Partitions |

claim paper

Related Content

» Partitions into Distinct Parts and Elliptic Curves

» Optimal GridClustering Towards Breaking the Curse of Dimensionality in HighDimensional Clu...

» PBIRCH A Scalable Parallel Clustering algorithm for Incremental Data

» On the Number of Graphical Forest Partitions

» Agglomerative Fuzzy KMeans Clustering Algorithm with Selection of Number of Clusters

» Automatic memory partitioning increasing memory parallelism via data structure partitionin...

» Recursive BiPartitioning of Netlists for Large Number of Partitions

» Comparison of Evaluation Metrics in Classification Applications with Imbalanced Datasets

» An Indicator for the Number of Clusters Using a Linear Map to Simplex Structure

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DCG
Authors	Stephan Hell

Comments (0)