Topological recursion relations from Pixton relations
The authors introduce an algorithm to obtain tautological relation from Pixton relations. More explicitly, authors describe an algorithm that uses Pixton relations to eliminate \(\kappa\)-classes. It is shown that if \(P(g,n,r)\) denotes the number of Pixton relations in \(R^{r}(\bar{\mathcal{M}_{g,n}})\) and \(N(g,n,r)\) is the number of classes of certain type of degree \(r\) with \(r\geq g\), then \(P(g,n,r)\geq N(g,n,r)\). Moreover, the authors discuss the applications to Gromov-Witten theory.
scientific article; zbMATH DE number 6756280
scientific article