from sage.all import PolynomialRing, QQ, RealField
RR = RealField(400)
R = PolynomialRing(QQ, 'x')
x = R.gen()
polynomials = {
1: x**2 - 3*x + 1,
2: x**4 - x**3 - x**2 - x + 1,
3: x**6 - x**4 - x**3 - x**2 + 1,
4: x**8 - x**5 - x**4 - x**3 + 1,
5: x**10 + x**9 - x**7 - x**6 - x**5 - x**4 - x**3 + x + 1,
7: x**14 + x**13 - x**9 - x**8 - x**7 - x**6 - x**5 + x + 1,
8: x**16 - x**9 - x**8 - x**7 + 1,
}
print({g: max(p.roots(RR, multiplicities=False))
for g, p in polynomials.items()})Genus $1$ is the torus case recalled by Lanneau and Thiffeault, $\delta_2^+$ is Theorem 1.1, and $\delta_3^+,\ldots,\delta_5^+$ are Theorem 1.2 of [1].
The genus $7$ and $8$ lower bounds are Theorem 1.3 of [1]; the genus $7$ bound is realized by Aaber and Dunfield [2] and independently by Kin and Takasawa [3], and the genus $8$ bound is realized by Hironaka [4]. The generator isolates the real root greater than $1$ of each exact polynomial in interval arithmetic and verifies that the polynomial changes sign across the isolating interval before writing $100$ digits.