The recursive bound minus one
For every n ≥ 6, S(n) \le 1! + 2! + \cdots + n! - 1
- Holds for
- n ≥ 6
- Announced
- Aug 21, 2014
- Proof
- Paper
- Coefficient of (n−3)!
- 1
By Robin Houston.
Evidence
- Preprint arxiv.org/abs/1408.5108 Houston, 'Tackling the minimal superpermutation problem', arXiv v1 2014-08-21
- Paper doi.org/10.1080/00029890.2021.1835384 Engen and Vatter, after Theorem 2.3: 'the bound of n! + ... + 3! + 2! implied by Houston's construction and Proposition 2.2'