|
|
A092450
|
|
Triangle read by rows: T(m,n) = number of weak factorization systems (trivial Quillen model structures) on the product category [m]x[n], where [m] denotes the total order on m objects, viewed as a category.
|
|
2
|
|
|
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 5, 10, 5, 1, 1, 14, 68, 68, 14, 1, 1, 42, 544, 1396, 544, 42, 1, 1, 132, 4828, 37434, 37434, 4828, 132, 1, 1, 429, 46124, 1226228, 4073836, 1226228, 46124, 429, 1, 1, 1430, 465932, 47002628, 645463414, 645463414, 47002628
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,8
|
|
COMMENTS
|
Specifying a weak factorization system on a poset category is equivalent to specifying a set of morphisms that includes all identity morphisms and is closed under composition and pullback.
|
|
LINKS
|
|
|
FORMULA
|
T(0, n) = T(n, 0) = 1. T(1, n) = T(n, 1) = C(n) the n-th Catalan number (A000108).
|
|
EXAMPLE
|
T(2, 2) = 10: the category has five nonidentity morphisms with relations ca = db = e. a is a pullback of d and of e; b is a pullback of c and of e. So there are ten allowable sets of morphisms: omitting identities for brevity, they are {}, {a}, {b}, {a,b}, {b,c}, {a,d}, {a,b,e}, {a,b,c,e}, {a,b,d,e}, {a,b,c,d,e}.
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|