A category for bijective combinatorics
Combinatorics
2019-07-23 v1 Category Theory
History and Overview
Abstract
The category of matchings between finite sets extends to the category of cobordisms of signed sets. A chain of cobordisms that starts and ends with unsigned sets A and B yields a matching from A to B. This is a convenient way to package the involution principle of Garsia and Milne, which reveals itself to have little to do with involutions.
Cite
@article{arxiv.1907.09015,
title = {A category for bijective combinatorics},
author = {Peter G. Doyle},
journal= {arXiv preprint arXiv:1907.09015},
year = {2019}
}
Comments
Public domain