141 search results - page 16 / 29 » dcg 2008 |
DCG
2002
13 years 7 months ago
2002
Let V be a vector space of dimension d over a field K and let A be a central arrangement of hyperplanes in V. To answer a question posed by K. Aomoto, P. Orlik and H. Terao constru...
DCG
1999
13 years 7 months ago
1999
Monotone path polytopes arise as a special case of the construction of fiber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, whic...
DCG
2000
13 years 7 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
1999
13 years 7 months ago
1999
Westudycomplexhyperplanearrangementswhoseintersectionlattices,known as the Dowling lattices, are a natural generalization of the partition lattice. We give a combinatorial descript...
DCG
2010
13 years 6 months ago
2010
A new approach to algorithmic computation of the homology of spaces and maps is presented. The key point of the approach is a change in the representation of sets. The proposed rep...