AbstractThe Edelman–Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman–Jamison problem is equivalent to the well known NP-hard order type problem. The relation to the realizability of oriented matroids is clarified
This paper concerns the topology of configuration spaces of linkages whose underlying graph is a sin...
This dissertation is devoted to the study of the geometric properties of subspace configurations, wi...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
A closure space (J,−) is called a convex geometry (see, for example, [1]), if it satisfies the anti-...
We establish the following two main results on order types of points in general position in the plan...
International audienceWe introduce combinatorial types of arrangements of convex bodies, extending o...
AbstractA convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which ...
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-clos...
AbstractWe present a simple algorithm for determining the extremal points in Euclidean space whose c...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
AbstractWe generalize to oriented matroids classical notions of Convexity Theory: faces of convex po...
AbstractUsing the theory of the anti-exchange closure the structure of the lattice of convex sets of...
AbstractThis paper is a sequel to the paper [E. Guardo, B. Harbourne, Resolutions of ideals of six f...
AbstractMany properties of finite point sets only depend on the relative position of the points, e.g...
AbstractAn (abstract) convex geometry is a combinatorial abstraction of convexity which is a Moore f...
This paper concerns the topology of configuration spaces of linkages whose underlying graph is a sin...
This dissertation is devoted to the study of the geometric properties of subspace configurations, wi...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
A closure space (J,−) is called a convex geometry (see, for example, [1]), if it satisfies the anti-...
We establish the following two main results on order types of points in general position in the plan...
International audienceWe introduce combinatorial types of arrangements of convex bodies, extending o...
AbstractA convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which ...
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-clos...
AbstractWe present a simple algorithm for determining the extremal points in Euclidean space whose c...
AbstractConsider the moment curve in the real euclidean space Rddefined parametrically by the map γ:...
AbstractWe generalize to oriented matroids classical notions of Convexity Theory: faces of convex po...
AbstractUsing the theory of the anti-exchange closure the structure of the lattice of convex sets of...
AbstractThis paper is a sequel to the paper [E. Guardo, B. Harbourne, Resolutions of ideals of six f...
AbstractMany properties of finite point sets only depend on the relative position of the points, e.g...
AbstractAn (abstract) convex geometry is a combinatorial abstraction of convexity which is a Moore f...
This paper concerns the topology of configuration spaces of linkages whose underlying graph is a sin...
This dissertation is devoted to the study of the geometric properties of subspace configurations, wi...
Combinatorial geometry is a broad and beautiful branch of mathematics. This PhD Thesis consists of t...
DOI
Add to ORKG