CDL: A fast and flexible library for the study of permutation sets with structural restrictions

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 con...

Full description

Saved in:
Bibliographic Details
Published in:SoftwareX 2024-12, Vol.28, p.101951, Article 101951
Main Authors: Zhou, Bei, Markström, Klas, Riis, Søren
Format: Article
Language:English
Subjects:
Computational social choice
Condorcet domains
Forbidden permutations
Forbidden structures
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2352-7110
2352-7110
DOI:10.1016/j.softx.2024.101951