Equality of admissible and numerically trivial Chow cycles
Let be as above, and let be the subgroup defined in Proposition 7. Let denote the subgroup of cycles numerically equivalent to . Numerical equivalence conjecture. In Proposition 7, one has
This is the numerical analogue of the conjecture attributed to Beilinson. If has a semistable model, it predicts that is the saturation of in , and the paper reduces the assertion to the semistable case with perfect. The general assertion remains open.
References
- Bruno Kahn and with an appendix by Qing Liu, “Refined height pairing”, arXiv:2009.00533 (2023).
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.