2013/03/22 by Jens Gerlach, Gerlach, Jens
Computer Science · Mathematics · #18B35 #Advanced Algebra and Logic #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #Rough Sets and Fuzzy Logic #acm:18B35 #cs.DM #math.CO #msc:18B35 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1303.5560
9 pages, 1 figure, 1 table, change name for sequence from "a" to "x"
openalex publication_date 2013/03/22 · arxiv created 2013/05/31 · arxiv updated 2013/06/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.