20 search results - page 3 / 4 » dcg 2000 |
DCG
2000
13 years 5 months ago
2000
Several polynomials are of use in various enumeration problems concerning objects in oriented matroids. Chief among these is the Radon catalog. We continue to study these, as well ...
DCG
2000
13 years 5 months ago
2000
It is possible to construct a figure in 3 dimensions which is combinatorially equivalent to a regular icosahedron, and whose faces are all congruent but not equilateral. Such icos...
DCG
2000
13 years 5 months ago
2000
We prove that it is NP-hard to decide whether a polyhedral 3-ball can be triangulated with k simplices. The construction also implies that it is difficult to find the minimal trian...
DCG
2000
13 years 5 months ago
2000
In this paper we consider the cocircuit graph GM of an oriented matroid M, the 1-skeleton of the cell complex W formed by the span of the cocircuits of M. In general, W is not dete...
DCG
2000
13 years 5 months ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...