38406501359372282063949 and All That: Monodromy of Fano Problems

Sachi Hashimoto, Borys Kadets*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

A Fano problem is an enumerative problem of counting r-dimensional linear subspaces on a complete intersection in Pn over a field of arbitrary characteristic, whenever the corresponding Fano scheme is finite. A classical example is enumerating lines on a cubic surface. We study the monodromy of finite Fano schemes Fr(X) as the complete intersection X varies. We prove that the monodromy group is either symmetric or alternating in most cases. In the exceptional cases, the monodromy group is one of the Weyl groups W(E6) or W(Dk).

Original languageEnglish
Pages (from-to)3349-3370
Number of pages22
JournalInternational Mathematics Research Notices
Volume2022
Issue number5
DOIs
StatePublished - 1 Mar 2022
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2020 The Author(s) 2020. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: [email protected].

Fingerprint

Dive into the research topics of '38406501359372282063949 and All That: Monodromy of Fano Problems'. Together they form a unique fingerprint.

Cite this