23 search results - page 1 / 5 » On the number of Tverberg partitions in the prime power case |
EJC
2007
13 years 4 months ago
2007
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 p...
COMBINATORICA
2011
12 years 4 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
CC
2007
Springer
13 years 4 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
EAAI
2006
13 years 4 months ago
2006
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...