arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.5560cs.DMmath.CO
收藏

格中的排序

Sorting in Lattices

Jens Gerlach

摘要:

在全序集合中,有限序列排序的概念是通过序列的索引的适当排列来定义的。在本文中,我们证明了一个简单的公式,明确地描述了一个序列的元素是如何与它的排序对应。由于这个公式只依赖于最小和最大函数,我们用它来定义格的排序概念。格中排序的一个主要区别是它不能保证序列元素只被重新排列。然而,我们可以证明,与排序相关的其他基本属性是保留的。

英文摘要:

In a totally ordered set the notion of sorting a finite sequence is defined through a suitable permutation of the sequence's indices. In this paper we prove a simple formula that explicitly describes how the elements of a sequence are related to those of its sorted counterpart. As this formula relies only on the minimum and maximum functions we use it to define the notion of sorting for lattices. A major difference of sorting in lattices is that it does not guarantee that sequence elements are only rearranged. However, we can show that other fundamental properties that are associated with sorting are preserved.

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

↑