Pith. sign in

REVIEW 1 cited by

Minimal even sets of nodes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 alg-geom/9710025 v1 pith:QHSBPLRP submitted 1997-10-20 alg-geom math.AG

Stephan Endrass This is my paper · ORCID
classification alg-geommath.AG
keywords evennodesdegreeminimalsetssurfacesbeencardinality
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We extend some results on even sets of nodes which have been proved for surfaces up to degree 6 to surfaces up to degree 10. In particular, we give a formula for the minimal cardinality of a nonempty even set of nodes.

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. Nodal surfaces in $\mathbb{P}^3$ and coding theory

    math.CO 2025-05 conditional novelty 4.0 of 10

    The binary linear code associated to any sextic surface in P^3 with 65 nodes is unique: it is the [65,12,{24,32,40}] code of the Barth sextic.

Pith tools