Pith. sign in

REVIEW

Multiregeneration for polynomial system solving

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 1912.04394 v2 pith:IRXTUEJU submitted 2019-12-09 math.AG

Multiregeneration for polynomial system solving

Colin Crowley , Jose Israel Rodriguez , Jacob Weiker , Jacob Zoromski This is my paper
classification math.AG
keywords solvingcontinuationmultimultiregenerationpolynomialpolynomialssystemsavailable
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We demonstrate our implementation of a continuation method as described in \cite{HR2015} for solving polynomials systems. Given a sequence of (multi)homogeneous polynomials, the software "multiregeneration" outputs the respective (multi)degree in a wide range of cases and partial multidegree in all others. We use Python for the file processing, while Bertini is needed for the continuation. Moreover, parallelization options and several strategies for solving structured polynomial systems are available.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.