On the (n+3)(n+3)-webs by rational curves induced by the forgetful maps on the moduli spaces M0,n+3\mathcal M_{0,n+3}

preprint2022arXivOpen access

Abstract

We discuss the curvilinear web W0,n+3\boldsymbol{\mathcal W}_{0,n+3} on the moduli space M0,n+3\mathcal M_{0,n+3} of projective configurations of n+3n+3 points on P1\mathbf P^1 defined by the n+3n+3 forgetful maps M0,n+3→M0,n+2\mathcal M_{0,n+3}\rightarrow \mathcal M_{0,n+2}. We recall classical results which show that this web is linearizable when nn is odd, or is equivalent to a web by conics when nn is even. We then turn to the abelian relations (ARs) of these webs. After recalling the well-known case when n=2n=2 (related to the 5-terms functional identity of the dilogarithm), we focus on the case of the 6-web W0,6\boldsymbol{\mathcal W}_{0,6}. We show that this web is isomorphic to the web formed by the lines contained in Segre's cubic primal S⊂P4\boldsymbol{S}\subset \mathbf P^4 and that a kind of `Abel's theorem' allows to describe the ARs of W0,6\boldsymbol{\mathcal W}_{0,6} by means of the abelian 2-forms on the Fano surface F1(S)⊂G1(P4)F_1(\boldsymbol{S})\subset G_1(\mathbf P^4) of lines contained in S\boldsymbol{S}. We deduce from this that W0,6\boldsymbol{\mathcal W}_{0,6} has maximal rank with all its ARs rational, and that these span a space which is an irreducible S6\mathfrak S_6-module. Then we take up an approach due to Damiano that we correct in the case when nn is odd: it leads to an abstract description of the space of ARs of W0,n+3\boldsymbol{\mathcal W}_{0,n+3} as a Sn+3\mathfrak S_{n+3}-representation. In particular, we obtain that this web has maximal rank for any n≥2n\geq 2. Finally, we consider `Euler's abelian relation En\boldsymbol{\mathcal E}_n', a particular AR for W0,n+3\boldsymbol{\mathcal W}_{0,n+3} constructed by Damiano from a characteristic class on the grassmannian of 2-planes in Rn+3\mathbf R^{n+3} by means of Gelfand-MacPherson theory of polylogarithmic forms. We give an explicit conjectural formula for the components of En\boldsymbol{\mathcal E}_n that we prove to be correct for n≤12n\leq 12.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.