ON IRREDUCIBLE FACTORS OF POLYNOMIALS OVER COMPLETE FIELDS

被引:3
|
作者
Khanduja, Sudesh K. [1 ]
Kumar, Sanjeev [2 ]
机构
[1] Indian Inst Sci Educ & Res IISER Mohali, Sas Nagar 140306, Punjab, India
[2] Panjab Univ, Dept Math, Chandigarh 160014, India
关键词
Valued fields; non-Archimedean valued fields; irreducible polynomials; EXTENSIONS; THEOREM;
D O I
10.1142/S0219498812501253
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Let (K, v) be a complete rank-1 valued field. In this paper, we extend classical Hensel's Lemma to residually transcendental prolongations of v to a simple transcendental extension K(x) and apply it to prove a generalization of Dedekind's theorem regarding splitting of primes in algebraic number fields. We also deduce an irreducibility criterion for polynomials over rank-1 valued fields which extends already known generalizations of Schonemann Irreducibility Criterion for such fields. A refinement of Generalized Akira criterion proved in Khanduja and Khassa [Manuscripta Math. 134(1-2) (2010) 215-224] is also obtained as a corollary of the main result.
引用
收藏
页数:10
相关论文
共 50 条
  • [41] Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
    Kopparty, Swastik
    Kumar, Mrinal
    Saks, Michael
    THEORY OF COMPUTING, 2016, 12
  • [42] A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
    Abrahamyan, Sergey
    Kyureghyan, Melsik
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, 2011, 6885 : 1 - 9
  • [43] Constructions of irreducible polynomials over finite fields with even characteristic
    Sharma, P. L.
    Ashima
    Gupta, Shalini
    Harish, Mansi
    Kumar, Sushil
    INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS, 2023, 54 (03): : 734 - 742
  • [44] Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
    Kopparty, Swastik
    Kumar, Mrinal
    Saks, Michael
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT I, 2014, 8572 : 726 - 737
  • [45] FAST CONSTRUCTION OF IRREDUCIBLE POLYNOMIALS OVER FINITE-FIELDS
    SHOUP, V
    JOURNAL OF SYMBOLIC COMPUTATION, 1994, 17 (05) : 371 - 391
  • [46] On perfect polynomials over Fp with p irreducible factors
    Gallardo, Luis H.
    Rahavandrainy, Olivier
    PORTUGALIAE MATHEMATICA, 2012, 69 (04) : 283 - 303
  • [47] On the degrees of irreducible factors of polynomials over a finite field
    Knopfmacher, A
    DISCRETE MATHEMATICS, 1999, 196 (1-3) : 197 - 206
  • [49] ON IRREDUCIBLE POLYNOMIALS IN GALOIS FIELDS
    TRAVIS, D
    AMERICAN MATHEMATICAL MONTHLY, 1963, 70 (10): : 1089 - &
  • [50] A recurrent construction of irreducible polynomials of fixed degree over finite fields
    Gohar M. Kyureghyan
    Melsik K. Kyureghyan
    Applicable Algebra in Engineering, Communication and Computing, 2022, 33 : 163 - 171