Torsion orders of complete intersections

Abstract

By a classical result of Roitman, a complete intersection X of sufficiently small degree admits a rational decomposition of the diagonal. This means that some multiple of the diagonal by a positive integer N, when viewed as a cycle in the Chow group, has support in X× D F× X, for some divisor D and a finite set of closed points F. The minimal such N is called the torsion order. We study lower bounds for the torsion order following the specialization method of Voisin, Colliot-Th\'el\`ene and Pirutka. We give a lower bound for the generic complete intersection with and without point. Moreover, we use methods of Koll\'ar and Totaro to show lower bounds for the very general complete intersection.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…