Sciweavers

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

10

EJC
2007

favoriteEmaildiscussreport

81views Information Technology» more EJC 2007»

On the number of Tverberg partitions in the prime power case

13 years 4 months ago

On the number of Tverberg partitions in the prime power case

Download www.math.tu-berlin.de

We give an extension of the lower bound of [9] for the number of Tverberg partitions from the prime to the prime power case. Our proof is inspired by the Zp-index version of the proof in [3] and uses Volovikov’s Lemma. Analogously, one obtains an extension of the lower bound for the number of diﬀerent splittings of a generic necklace to the prime power case.

Stephan Hell

Real-time Traffic

EJC 2007 | Information Technology | Lower Bound | Prime Power Case | Tverberg Partitions |

claim paper

Related Content

» A local criterion for Tverberg graphs

» The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

» Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields

» Evolutionary algorithms for VLSI multiobjective netlist partitioning

» Asymptotics for the Probability of Connectedness and the Distribution of Number of Compone...

» Enumerating isodiametric and isoperimetric polygons

» More Fun with Symmetric Venn Diagrams

» Almost Uniform Density of Power Residues and the Provable Security of ESIGN

» Systemlevel mitigation of WID leakage power variability using bodybias islands

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	EJC
Authors	Stephan Hell

Comments (0)