Pith. sign in

REVIEW

On a factorization result of \c{S}tef\u{a}nescu

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 2112.12079 v1 pith:XMT3IFRB submitted 2021-12-19 math.NT math.AGmath.RA

Sanjeev Kumar , Jitender Singh This is my paper · ORCID
classification math.NTmath.AGmath.RA
keywords factorizationdiscretedomainsnescupolynomialspropertiesresultvaluation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial leads to a generalization of the main result proved by \c{S}tef\u{a}nescu [`On the factorization of polynomials over discrete valuation domains', \emph{Versita} \textbf{22}:1 (2014), 273--280].

Discussion (0). Continue with ORCID to comment.

Pith tools