Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a factorization result of Ştefănescu

Published 19 Dec 2021 in math.NT, math.AG, and math.RA | (2112.12079v1)

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].

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.