Finite-rank rigidity and Nash-curve discreteness for correlation potentials

For every nonconstant real polynomial P of degree k and every positive rational exponent a/b, minimizing the spherical energy with potential |P(t)|^{a/b} admits a discrete solution with at most $\binom{d+2ak-1}{2ak}+\binom{d+2ak-2}{2ak-1}$ support points, where a/b is reduced. This finite-replacement consequence needs no denominator threshold. Under a multiplicity-sensitive denominator condition, we prove the stronger conclusion that every minimizer has an explicit uniform support bound; suitable negative positive-semidefinite perturbations preserve that bound. We present these consequences before the machinery. The main arguments simplify irrational-power finite-rank rigidity and give a Nash-curve ramification obstruction, stable under entire scalar additions, for powers, logarithms, and rational poles. The latter yields uniform finite supports on compact semialgebraic curves without assuming that the supports are semialgebraic. The known p-frame finite-replacement principle is distinguished from the extensions developed here. No unconditional discreteness theorem for general irrational p is claimed.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-10-29
DOI
https://doi.org/10.48550/arxiv.2610.40475
Primary Topic
Algebraic Geometry and Number Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Finite-rank rigidity and Nash-curve discreteness for correlation potentials

Josiah Park
arXiv (Cornell University)
Algebraic Geometry and Number Theory
preprint

Finite-rank rigidity and Nash-curve discreteness for correlation potentials

Josiah Park
preprint en

Abstract

For every nonconstant real polynomial P of degree k and every positive rational exponent a/b, minimizing the spherical energy with potential |P(t)|^{a/b} admits a discrete solution with at most $\binom{d+2ak-1}{2ak}+\binom{d+2ak-2}{2ak-1}$ support points, where a/b is reduced. This finite-replacement consequence needs no denominator threshold. Under a multiplicity-sensitive denominator condition, we prove the stronger conclusion that every minimizer has an explicit uniform support bound; suitable negative positive-semidefinite perturbations preserve that bound. We present these consequences before the machinery. The main arguments simplify irrational-power finite-rank rigidity and give a Nash-curve ramification obstruction, stable under entire scalar additions, for powers, logarithms, and rational poles. The latter yields uniform finite supports on compact semialgebraic curves without assuming that the supports are semialgebraic. The known p-frame finite-replacement principle is distinguished from the extensions developed here. No unconditional discreteness theorem for general irrational p is claimed.

arXiv (Cornell University)
Algebraic Geometry and Number Theory
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.

Laika access coming soon
Finite-rank rigidity and Nash-curve discreteness for correlation potentials — Josiah Park · arXiv (Cornell University) (2026) | TGRS Research Map | TGRS