ScalingStacks

Remark 4.3 . [0217]

Original official author HTML, exact retained edition. Historical TeX conversion verdicts remain unchanged. Cited-edition alignment and mathematical self-containment are not assessed.

Complete original source context · Original author HTML

Remark 4.3.

From the argument below, one can explicitly get an upper bound for

pn≤(3​n−3)​(4​n+1).p_{n}\leq(3n-3)(4n+1).

This upper bound is probably not sharp.

Original mathematics by the credited authors. Source-backed reader collection; mathematical self-containment is not assessed.