Timeline for Counting categories with at most $n$ morphisms
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Dec 29, 2014 at 2:39 | comment | added | Włodzimierz Holsztyński | In an analogy with similar counting problems I'd suggest also the following variant: let the set of objects $\ Q\ $ be fixed, and introduce fixed parameter $\ q:=|Q|.\ $ Let $\ M\ $ be the (intended) upper bound number on the number of morphisms. What is the number $\ m:=m(q\ M)\ $ of all categories $\ C\ $ such that $\ Obj(C) = Q\ $ and $\ |Mor(C)|\le M\ $ $ | |
| Dec 27, 2014 at 10:47 | answer | added | Tim Campion | timeline score: 6 | |
| Mar 9, 2014 at 21:36 | comment | added | Benjamin Steinberg | Given how hard it is to count monoids and to count posets this must be extremely hard. | |
| Mar 9, 2014 at 21:07 | history | edited | Espen Nielsen | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Mar 9, 2014 at 20:59 | review | Close votes | |||
| Mar 10, 2014 at 2:24 | |||||
| Mar 9, 2014 at 20:29 | review | First posts | |||
| Mar 9, 2014 at 20:42 | |||||
| Mar 9, 2014 at 20:10 | history | asked | Espen Nielsen | CC BY-SA 3.0 |