|
|
COMMENTS
|
This sequence is log-superadditive, i.e., a(m+n) >= a(m)*a(n). By Fekete's subadditive lemma, it follows that the limit of a(n)^(1/n) exists and equals the supremum of a(n)^(1/n).
In the following, FCB(n_1, ..., n_k) denotes the full cyclic braid graph with cluster sizes n_1, ..., n_k, as defined by Morrison and Scott (2017), i.e., the graph obtained by arranging complete graphs of orders n_1, ..., n_k (in that order) in a cycle, and joining all pairs of nodes in neighboring parts with edges.
a(10) >= 140 by FCB(2, 2, 2, 2, 2);
a(11) >= 268 by FCB(2, 2, 2, 2, 3);
a(12) >= 517 by FCB(2, 2, 3, 2, 3);
a(13) >= 911 by FCB(2, 3, 2, 3, 3);
a(14) >= 1515 by FCB(2, 3, 3, 3, 3);
a(15) >= 2525 by FCB(3, 3, 3, 3, 3).
|
