arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.07189cs.DMcs.ITmath.COmath.IT
收藏

有限几何分配格的刻画

On Characterization of Finite Geometric Distributive Lattices

Pranab Basu

摘要:

格是一个偏序集合,其中任何一对元素的最小上界和最大下界都是唯一的,并且存在于集合中。Kötter和Kschischang证明了线性格中的代码可以用于随机网络中的错误和擦除校正。线性格中的码以前被证明是模格中码的特殊情况。半模格的两个著名分类是几何格和分配格。大多数经常使用的编码空间都是其中一种或两种的例子。我们已经确定了唯一的标准,使几何格分配,从而表征所有有限的几何分配格。我们的刻画有助于证明关于有限几何格的分配子格的最大尺寸的猜想,并确定最大的情况。计算了几何分配格类的Whitney数。我们提出了一些其他的应用程序,这种独特的特性,以获得某些结果的线性和补充的线性格。

英文摘要:

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. Kötter and Kschischang proved that codes in the linear lattice can be used for error and erasure-correction in random networks. Codes in the linear lattice have previously been shown to be special cases of codes in modular lattices. Two well known classifications of semimodular lattices are geometric and distributive lattices. Most of the frequently used coding spaces are examples of either or both. We have identified the unique criterion which makes a geometric lattice distributive, thus characterizing all finite geometric distributive lattices. Our characterization helps to prove a conjecture regarding the maximum size of a distributive sublattice of a finite geometric lattice and identify the maximal case. The Whitney numbers of the class of geometric distributive lattices are also calculated. We present a few other applications of this unique characterization to derive certain results regarding linearity and complements in the linear lattice.

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

↑