多项式的几乎不可约性和牛顿图

IF 0.1 Q4 MATHEMATICS

Annales Universitatis Paedagogicae Cracoviensis-Studia Mathematica Pub Date : 2019-05-06 DOI:10.2478/aupcsm-2020-0006

M. Masternak

{"title":"多项式的几乎不可约性和牛顿图","authors":"M. Masternak","doi":"10.2478/aupcsm-2020-0006","DOIUrl":null,"url":null,"abstract":"\n Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero in C2. In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.","PeriodicalId":53863,"journal":{"name":"Annales Universitatis Paedagogicae Cracoviensis-Studia Mathematica","volume":"48 1","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2019-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Nearly irreducibility of polynomials and the Newton diagrams\",\"authors\":\"M. Masternak\",\"doi\":\"10.2478/aupcsm-2020-0006\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero in C2. In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.\",\"PeriodicalId\":53863,\"journal\":{\"name\":\"Annales Universitatis Paedagogicae Cracoviensis-Studia Mathematica\",\"volume\":\"48 1\",\"pages\":\"\"},\"PeriodicalIF\":0.1000,\"publicationDate\":\"2019-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annales Universitatis Paedagogicae Cracoviensis-Studia Mathematica\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2478/aupcsm-2020-0006\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annales Universitatis Paedagogicae Cracoviensis-Studia Mathematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/aupcsm-2020-0006","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

设f是两个复变量的多项式。我们说如果f的任意两个非常数多项式因子在C2中有一个公零，那么f是几乎不可约的。本文用牛顿图给出了给定多项式f几乎不可约的一个判据。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Nearly irreducibility of polynomials and the Newton diagrams

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero in C2. In the paper we give a criterion of nearly irreducibility for a given polynomial f in terms of its Newton diagram.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Annales Universitatis Paedagogicae Cracoviensis-Studia Mathematica MATHEMATICS-

自引率

11.10%

发文量

审稿时长

15 weeks