MétaCan
Menu
Back to cohort
Record W4401661952 · doi:10.48550/arxiv.2407.11476

Fay identities for polylogarithms on higher-genus Riemann surfaces

2024· preprint· en· W4401661952 on OpenAlexfundno aff
Eric D’Hoker, Oliver Schlotterer

Bibliographic record

VenuearXiv (Cornell University) · 2024
Typepreprint
Languageen
FieldMathematics
TopicAdvanced Mathematical Identities
Canadian institutionsnot available
FundersHausdorff Research Institute for MathematicsBanff International Research Station for Mathematical Innovation and DiscoveryUppsala UniversitetKavli Institute for Theoretical Physics, University of California, Santa BarbaraNational Science Foundation
KeywordsGenusRiemann surfaceRiemann hypothesisMathematicsPure mathematicsBotanyBiology

Abstract

fetched live from OpenAlex

A recent construction of polylogarithms on Riemann surfaces of arbitrary genus in arXiv:2306.08644 is based on a flat connection assembled from single-valued non-holomorphic integration kernels that depend on two points on the Riemann surface. In this work, we construct and prove infinite families of bilinear relations among these integration kernels that are necessary for the closure of the space of higher-genus polylogarithms under integration over the points on the surface. Our bilinear relations generalize the Fay identities among the genus-one Kronecker-Eisenstein kernels to arbitrary genus. The multiple-valued meromorphic kernels in the flat connection of Enriquez are conjectured to obey higher-genus Fay identities of exactly the same form as their single-valued non-holomorphic counterparts. We initiate the applications of Fay identities to derive functional relations among higher-genus polylogarithms involving either single-valued or meromorphic integration kernels.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.001
Science and technology studies0.0020.003
Scholarly communication0.0030.005
Open science0.0010.002
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.180
GPT teacher head0.264
Teacher spread0.084 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations3
Published2024
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)Same topicAdvanced Mathematical IdentitiesFrench-language works237,207