Scholarlink

<p>Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of Dumas.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A generalization of Dumas’ irreducibility criterion

  • 期刊论文

  • 发表日期：

    2026年5月12日

查看全文
  • Jitender Singh

摘要

Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of Dumas.