The recursive bound
For every n, S(n) \le 1! + 2! + \cdots + n!
- Holds for
- all n
- Announced
- 1993
- Proof
- Paper
- Coefficient of (n−3)!
- 1
By Daniel A. Ashlock and Jenett Tillotson.
Evidence
- Paper www.zbmath.org/?q=an:0801.05004 Ashlock and Tillotson, 'Construction of small superpermutations and minimal injective superstrings', Congressus Numerantium 93 (1993) 91-98
- Paper doi.org/10.1080/00029890.2021.1835384 Engen and Vatter, Amer. Math. Monthly 128 (2021), Proposition 2.2, citing Ashlock and Tillotson, Theorem 3 and Lemma 5