Indexed metadata
Fast factorization in diagram monoids
Matthias Fresacher, Willow Stewart, Daniel Tubbenhauer
Source abstract
We give explicit algorithms that factor elements of the standard diagram monoids into their usual generators. These algorithms generalize sorting from permutations to partial matchings and set partitions. In every case the worst-case complexity is , which is optimal for algorithms that explicitly list the factors. We also determine the average complexity of our algorithms.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.