English

An algorithm for a Massey triple product of a smooth projective plane curve

Algebraic Geometry 2019-09-17 v1 Number Theory

Abstract

We provide an explicit algorithm to compute a Massey triple product relative to a defining system for a smooth projective plane curve XX defined by a homogeneous polynomial G(x)G(\underline x) over a field. The main idea is to use the description (due to Carlson and Griffiths) of the cup product for H1(X,C)H^1(X,\mathbb{C}) in terms of the multiplications inside the Jacobian ring of G(x)G(\underline x) and the Cech-deRham complex of XX. Our algorithm gives a criterion whether a Massey triple product vanishes or not in H2(X)H^2(X) under a particular non-trivial defining system of the Massey triple product and thus can be viewed as a generalization of the vanishing criterion of the cup product in H2(X)H^2(X) of Carlson and Griffiths. Based on our algorithm, we provide explicit numerical examples by running the computer program.

Keywords

Cite

@article{arxiv.1909.06714,
  title  = {An algorithm for a Massey triple product of a smooth projective plane curve},
  author = {Younggi Lee and Jeehoon Park and Junyeong Park and Jaehyun Yim},
  journal= {arXiv preprint arXiv:1909.06714},
  year   = {2019}
}

Comments

13 pages, 1 figure