The least common multiple of polynomial values over function fields

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb Z[X]$ of degree $d \geq 2$ one has $$ \log \mathrm{lcm} (f(1),\ldots , f(N))\sim (d-1)N\log N $$ as $N \to \infty $. He proved it in the case $d=2$ but it remains open for every

Authors

Institutions

Publication Details

Journal
Acta Arithmetica
Published
2025-01-01
DOI
https://doi.org/10.4064/aa231205-20-8
Citations
2
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
3.01
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The least common multiple of polynomial values over function fields

Alexei Entin, Sean Landsberg
2 citations
Acta Arithmetica
Polynomial and algebraic computation
3.01
article

The least common multiple of polynomial values over function fields

Alexei Entin, Sean Landsberg
article en
2 citations

Abstract

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb Z[X]$ of degree $d \geq 2$ one has $$ \log \mathrm{lcm} (f(1),\ldots , f(N))\sim (d-1)N\log N $$ as $N \to \infty $. He proved it in the case $d=2$ but it remains open for every

Acta ArithmeticaVol. 217(2)
Tel Aviv University (IL)
Openalex Percentile: Top 11%
Polynomial and algebraic computation
3.01
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The least common multiple of polynomial values over function fields — Alexei Entin, Sean Landsberg · Acta Arithmetica (2025) | TGRS Research Map | TGRS