27 Mar
2010
27 Mar
'10
11:40 p.m.
On 3/26/2010 6:01 PM, Aleks Kissinger wrote:
Probably a good exercise to work out the details yourself, but here's a hint. The 1-object case is exactly the same as counting monoids.
With the exception of one category, so is the general case. It suffices to identify the odd category out and then put the remainder in bijection with the monoids of order at most 3 (see Sloane A058129). For positive integer n, 3 is the least value of n for which the categories with n arrows cannot be put in bijection with the monoids of order at most n. Vaughan [For admin and other information see: http://www.mta.ca/~cat-dist/ ]