Rewriting Procedures Generalise to Kan Extensions of Actions of Categories
Anne Heyworth
Abstract
Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) and this enables one program to address a wide range of problems. Thus it is possible to use the same framework (and therefore program) to enumerate monoid or group (or category of groupoid) elements, to enumerate cosets or congruence classes on monoids, calculate equivariant equivalence relations, induced actions of groups, monoids or categories and even more. This extended abstract is an outline of "Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories" by R. Brown and A. Heyworth.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.