1 citations · 1 across the 3 of their papers we have counts for
5 papers
Fast factorization in diagram monoids
Matthias Fresacher, Willow Stewart, Daniel Tubbenhauer
We give explicit algorithms that factor elements of the standard diagram monoids into their usual generators. These algorithms generalize sorting from permutations to partial match…
Generalized diagram categories and monoids, and their representations
Matthias Fresacher, Willow Stewart, Daniel Tubbenhauer
Classical diagram categories and monoids, including the Temperley--Lieb, Brauer, and partition cases, arise as special instances of the category of two dimensional cobordisms and a…
Presentations for semigroups of full-domain partitions
Luka Carroll, James East, Matthias Fresacher
The full-domain partition monoid has been discovered independently in two recent studies on connections between diagram monoids and category theory. It is a right restri…
Categorical representation of DRC-semigroups
James East, Matthias Fresacher, P. A. Azeef Muhammed +1
DRC-semigroups model associative systems with domain and range operations, and contain many important classes, such as inverse, restriction, Ehresmann, regular -, and -regula…
Learning Erdős-Rényi Random Graphs via Edge Detecting Queries
Zihan Li, Matthias Fresacher, Jonathan Scarlett
In this paper, we consider the problem of learning an unknown graph via queries on groups of nodes, with the result indicating whether or not at least one edge is present among tho…