The distance to square-free polynomials

被引：6

作者：

Dubickas, Arturas ^{[1
]}

Sha, Min ^{[2
]}

机构：

[1] Vilnius Univ, Fac Math & Informat, Inst Math, Naugarduko 24, LT-03225 Vilnius, Lithuania

[2] Macquarie Univ, Dept Comp, Sydney, NSW 2109, Australia

来源：

ACTA ARITHMETICA | 2018年 / 186卷 / 03期

关键词：

integer polynomial; square-free polynomial; Turan's problem;

D O I：

10.4064/aa180122-15-8

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

[No abstract available]

引用

页码：243 / 256

页数：14

共 19 条

[1] On a polynomial conjecture of Pal Turan [J].

Banerjee, Pradipto ;

Filaseta, Michael .

ACTA ARITHMETICA, 2010, 143 (03) :239-255

[2]

BATEMAN PT, 1972, ACTA ARITH, V21, P329

[3]

Berczes A, 1998, NUMBER THEORY, P95

[4] Computational experiences on the distances of polynomials to irreducible polynomials [J].

Berczes, A ;

Hajdu, L .

MATHEMATICS OF COMPUTATION, 1997, 66 (217) :391-398

[5]

Derbal A., 2009, INTEGERS, V9, P735

[6]

Dobrowolski E., 1979, ACTA ARITH, V34, P391

[7] SOME REMARKS ON EULER PHI-FUNCTION AND SOME RELATED PROBLEMS [J].

ERDOS, P .

BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1945, 51 (08) :540-544

[8] Is Every Polynomial with Integer Coefficients Near an Irreducible Polynomial? [J].

Filaseta, Michael .

ELEMENTE DER MATHEMATIK, 2014, 69 (03) :130-143

[9] THE DISTANCE TO AN IRREDUCIBLE POLYNOMIAL, II [J].

Filaseta, Michael ;

Mossinghoff, Michael J. .

MATHEMATICS OF COMPUTATION, 2012, 81 (279) :1571-1585

[10]

GYORY K, 1994, ACTA ARITH, V67, P283

← 1 2 →