arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.01581math.CO
收藏

凸几何的分解

Resolutions of Convex Geometries

Domenico Cantone, Jean-Paul Doignon, Alfio Giarlotta, Stephen Watson

摘要:

凸几何(Edelman and Jamison,1985)是一种与并闭反矩阵或学习空间对偶的有限组合结构。定义了一种凸几何的归结运算,它用一个纤维凸几何来替换基凸几何中的每个元素。与类似的构造--超图的复合,如Chein、Habib和Maurer(1981),以及集合系统的复合,如Mohring和Radermacher(1984)--相反,凸几何的分解总是产生凸几何。我们研究特殊的凸几何的决议:序数和仿射。序凸几何的分解也是序的,但仿射凸几何的分解可能不是仿射的。一个推广偏序集相应概念的凸性的概念来自于归结:一个凸几何是本原的,如果它不是较小几何的归结。我们得到了仿射凸几何是本原的一个特征,并计算了至多四个元素上的本原凸几何的个数。列出了几个开放的问题。

英文摘要:

Convex geometries (Edelman and Jamison, 1985) are finite combinatorial structures dual to union-closed antimatroids or learning spaces. We define an operation of resolution for convex geometries, which replaces each element of a base convex geometry by a fiber convex geometry. Contrary to what happens for similar constructions -- compounds of hypergraphs, as in Chein, Habib and Maurer (1981), and compositions of set systems, as in Mohring and Radermacher (1984) -- , resolutions of convex geometries always yield a convex geometry. We investigate resolutions of special convex geometries: ordinal and affine. A resolution of ordinal convex geometries is again ordinal, but a resolution of affine convex geometries may fail to be affine. A notion of primitivity, which generalize the corresponding notion for posets, arises from resolutions: a convex geometry is primitive if it is not a resolution of smaller ones. We obtain a characterization of affine convex geometries that are primitive, and compute the number of primitive convex geometries on at most four elements. Several open problems are listed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑