Composable constraint models for permutation enumeration

DOI10.46298/DMTCS.12620MaRDI QIDQ6873963zbMATH OpenFDO

Authors Ruth Hoffmann, Özgür Akgün, Christopher Jefferson

Publication date 15 January 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.12620

zbMATH Keywords

constraint modellingenumerationpermutation pattern

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• \textsc{Conjure}: automatic generation of constraint models from problem specifications
• A survey of simple permutations
• Automatically improving constraint models in Savile Row
• Avoidance of boxed mesh patterns on permutations
• Enumeration of set-theoretic solutions to the Yang-Baxter equation
• Essence: A constraint language for specifying combinatorial problems
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Generalized permutation patterns and a classification of the Mahonian statistics
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Mesh patterns and the expansion of permutation statistics as sums of permutation patterns
• Restricted permutations
• Restricted permutations
• Theory and Applications of Satisfiability Testing
• Upper bounds for the Stanley-Wilf limit of 1324 and other layered patterns

This page was built for publication: Composable constraint models for permutation enumeration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873963)