Catalan correction-factor formula for the enumerative Euler class

About 7 years old · traced to

Let n≥2n\geq 2, let VV be the vector bundle and let σ=α∧β\sigma=\alpha\wedge\beta be the section considered in the paper. Write

e(V,σ)=c(n−1)−i(n)2(⟨1⟩+⟨−1⟩)+i(n)⟨1⟩,e(V,\sigma)=\frac{c(n-1)-i(n)}{2}(\langle 1\rangle+\langle -1\rangle)+i(n)\langle 1\rangle,

where

c(n−1)=(2n−2)!n!(n−1)!c(n-1)=\frac{(2n-2)!}{n!(n-1)!}

is the (n−1)(n-1)st Catalan number and i(n)i(n) is a correction factor depending only on nn. Catalan correction-factor conjecture. For every n≥2n\geq 2, the displayed formula holds. The formula generalizes the paper's enumerative Euler-class computation and is motivated by the signed degrees of real Wronski maps; the correction factor is not determined here.

References

Primary source

Andrew Kobin and Libby Taylor, “A^1-Local Degree via Stacks”, arXiv:1911.05955 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.