Invariant rational functions, linear fractional transformations and irreducible polynomials over finite fields

被引:2
|
作者
Gow, Rod [1 ]
McGuire, Gary [1 ]
机构
[1] Univ Coll Dublin, Sch Math & Stat, Dublin, Ireland
关键词
Linear fractional transformation; Invariant; Irreducible;
D O I
10.1016/j.ffa.2021.101991
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
For a subgroup of PGL(2, q) we show how some irreducible polynomials over F-q arise from the field of invariant rational functions. The proofs rely on combining two actions of PGL(2, F), one on the projective line over a field F and the other on the rational function field F(x). The invariant functions in F (x) are used to show that regular patterns exist in the factorization of certain polynomials into irreducible polynomials. We use some results about group actions and the orbit polynomial, whose proofs are included. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:25
相关论文
共 50 条
  • [31] GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
    Ahn, Youngwoo
    Kim, Kitae
    KOREAN JOURNAL OF MATHEMATICS, 2011, 19 (03): : 263 - 272
  • [32] Polynomial distribution and sequences of irreducible polynomials over finite fields
    Chou, WS
    Cohen, SD
    JOURNAL OF NUMBER THEORY, 1999, 75 (01) : 145 - 159
  • [33] Self-reciprocal irreducible polynomials over finite fields
    Yucas, JL
    Mullen, GL
    DESIGNS CODES AND CRYPTOGRAPHY, 2004, 33 (03) : 275 - 281
  • [34] Irreducible polynomials over finite fields produced by composition of quadratics
    Heath-Brown, David Rodney
    Micheli, Giacomo
    REVISTA MATEMATICA IBEROAMERICANA, 2019, 35 (03) : 847 - 855
  • [35] Number of irreducible polynomials in several variables over finite fields
    Bodin, Arnaud
    AMERICAN MATHEMATICAL MONTHLY, 2008, 115 (07): : 653 - 660
  • [36] Self-Reciprocal Irreducible Polynomials Over Finite Fields
    Joseph L. Yucas
    Gary L. Mullen
    Designs, Codes and Cryptography, 2004, 33 : 275 - 281
  • [37] Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
    Kopparty, Swastik
    Kumar, Mrinal
    Saks, Michael
    THEORY OF COMPUTING, 2016, 12
  • [38] A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
    Abrahamyan, Sergey
    Kyureghyan, Melsik
    COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, 2011, 6885 : 1 - 9
  • [39] 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
  • [40] 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