136 search results - page 6 / 28 » Finite geometries |
ADG
2006
Springer
14 years 1 months ago
2006
Springer
It is known that five points in 3 generically determine a finite number of cylinders containing those points. We discuss ways in which it can be shown that the generic (complex) nu...
ICALP
2004
Springer
14 years 22 days ago
2004
Springer
We consider the multiplicative and exponential fragment of linear logic (MELL) and give a Geometry of Interaction (GoI) semantics for it based on unique decomposition categories. ...
SIGACT
2008
13 years 7 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
IMR
2003
Springer
14 years 16 days ago
2003
Springer
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
DIMACS
2001
13 years 8 months ago
2001
Let C be a smooth real plane curve. Let c be its degree and g its genus. We assume that C has at least g real branches. Let d be a nonzero natural integer strictly less than c. Let...