CDL: a fast and flexible library for the study of permutation sets with structural restrictions
File(s)
Published version
Author(s)
Zhou, Bei
Markstrom, Klas
Riis, Soren
Type
Journal Article
Abstract
In this paper we introduce CDL, a software library designed for the analysis of permutations and linear orders subject to various structural restrictions. Prominent examples of these restrictions include pattern avoidance, a topic of interest in both computer science and combinatorics, and never conditions, utilized in social choice and voting theory. CDL offers a range of fundamental functionalities, including identifying the permutations that meet specific restrictions and determining the isomorphism of such sets. To facilitate the exploration of large permutation sets or domains, CDL incorporates multiple search strategies and heuristics.
Date Issued
2024-12
Date Acceptance
2024-10-22
Citation
SoftwareX, 2024, 28
ISSN
2352-7110
Publisher
Elsevier
Journal / Book Title
SoftwareX
Volume
28
Copyright Statement
© 2024 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
License URL
Identifier
https://www.sciencedirect.com/science/article/pii/S2352711024003212?via%3Dihub
Subjects
Computational social choice
Computer Science
Computer Science, Software Engineering
Condorcet domains
Forbidden permutations
Forbidden structures
Science & Technology
Technology
Publication Status
Published
Article Number
101951
Date Publish Online
2024-11-01