Pith. sign in

REVIEW 1 cited by

Ideals of curves given by points

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1202.6493 v1 pith:L32L7LDB submitted 2012-02-29 math.AG

classification math.AG
keywords generatorscurvedegreegivenpointsconstructionsidealalgebraically
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Let C be an irreducible projective curve of degree d in Pn(K), where K is an algebraically closed field, and let I be the associated homogeneous prime ideal. We wish to compute generators for I, assuming we are given sufficiently many points on the curve C. In particular if I can be generated by polynomials of degree at most m and we are given md + 1 points on C, then we can find a set of generators for I. We will show that a minimal set of generators of I can be constructed in polynomial time. Our constructions are completely independent of any notion of term ordering; this allows us the maximal freedom in performing our constructions in order to improve the numerical stability. We also summarize some classical results on bounds for the degrees of the generators of our ideal in terms of the degree and genus of the curve.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Existence and computation of monomial families of near-optimal strategies for recursive games

    cs.GT 2026-08 accept novelty 7.0 of 10

    Every finite recursive game has near-optimal stationary strategies that are simple monomials in the accuracy epsilon, and for fixed state count these can be computed exactly in polynomial time.

Pith tools