Papers › Interpolation in Weighted Projective Spaces

Interpolation in Weighted Projective Spaces

12 Jun 2024arXiv:2406.08602links table onlyarchive 2025-07-28

Shahriyar Roshan-Zamir

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Over an algebraically closed field, the double point interpolation problem asks for the vector space dimension of the projective hypersurfaces of degree d singular at a given set of points. After being open for 90 years, a series of papers by J. Alexander and A. Hirschowitz in 1992--1995 settled this question in what is referred to as the Alexander-Hirschowitz theorem. In this paper we primarily use commutative algebra to lay the groundwork necessary to prove analogous statements in the weighted projective space, a natural generalization of the projective space. We show the Hilbert function of general simple points in any n-dimensional weighted projective space exhibits the expected behavior. We give an inductive procedure for weighted projective space, similar to that originally due to A. Terracini from 1915, to demonstrate an example of a weighted projective plane where the analogue of the Alexander-Hirschowitz theorem holds without exceptions. We further adapt Terracini's lemma regarding secant varieties to give an interpolation bound for an infinite family of weighted projective planes.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections