Add to ORKGPoset geometries are characterized as convex geometries verifying a given property. These geometries are basic structures in combinatorial convexity, because any convex geometry can be generated from them. In this note, we will give a necessary and sufficient condition on the closure operator which leads us to a new characterization of poset geometry
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dua...
Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convex...
AbstractConvex geometries are closure spaces which satisfy anti-exchange property, and they are know...
The aim of this paper is to characterize morphological convex geometries (resp., antimatroids). We d...
Abstract. The aim of this paper is to characterize morphological convex geometries (resp., antimatro...
A closure space (J,−) is called a convex geometry (see, for example, [1]), if it satisfies the anti-...
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-clos...
Abstract. A closure system with the anti-exchange axiom is called a convex geometry. One geometry is...
AbstractA convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which ...
AbstractWe investigate the class of double-shelling convex geometries. A double-shelling convex geom...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
A subset S of a poset (partially ordered set) is convex if and only if S contains every poset elemen...
AbstractWe introduce the notion of a convex geometry extending the notion of a finite closure system...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Graph convexity has been used as an important tool to better understand the structure of classes of ...
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dua...
Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convex...
AbstractConvex geometries are closure spaces which satisfy anti-exchange property, and they are know...
The aim of this paper is to characterize morphological convex geometries (resp., antimatroids). We d...
Abstract. The aim of this paper is to characterize morphological convex geometries (resp., antimatro...
A closure space (J,−) is called a convex geometry (see, for example, [1]), if it satisfies the anti-...
Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-clos...
Abstract. A closure system with the anti-exchange axiom is called a convex geometry. One geometry is...
AbstractA convex geometry is a combinatorial abstract model introduced by Edelman and Jamison which ...
AbstractWe investigate the class of double-shelling convex geometries. A double-shelling convex geom...
Connections between Euclidean convex geometry and combinatorics go back to Euler, Cauchy, Minkowski ...
A subset S of a poset (partially ordered set) is convex if and only if S contains every poset elemen...
AbstractWe introduce the notion of a convex geometry extending the notion of a finite closure system...
Poset associahedra are a family of convex polytopes recently introduced by Pavel Galashin in 2021. T...
Graph convexity has been used as an important tool to better understand the structure of classes of ...
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dua...
Inspired by locale theory, we propose “pointfree convex geometry”. We introduce the notion of convex...
AbstractConvex geometries are closure spaces which satisfy anti-exchange property, and they are know...