IDEAS home Printed from https://ideas.repec.org/a/spr/indpam/v56y2025i2d10.1007_s13226-023-00501-3.html
   My bibliography  Save this article

Reducibility type of polynomials modulo a prime

Author

Listed:
  • Joshua Harrington

    (Cedar Crest College)

  • Lenny Jones

    (Shippensburg University)

Abstract

Let $$f(x)\in {\mathbb Z}[x]$$ f ( x ) ∈ Z [ x ] be a monic polynomial that is irreducible over $${\mathbb Q}$$ Q , and suppose that $$\deg (f)=N\ge 2$$ deg ( f ) = N ≥ 2 . For a prime p not dividing the discriminant of f(x), we define the reducibility type of f(x) modulo p to be $$(d_1,d_2,\ldots ,d_t)_p$$ ( d 1 , d 2 , … , d t ) p if f(x) factors into distinct irreducibles $$g_i(x)\in {\mathbb F}_p[x]$$ g i ( x ) ∈ F p [ x ] as $$\begin{aligned} f(x)=g_1(x)g_2(x)\cdots g_t(x), \end{aligned}$$ f ( x ) = g 1 ( x ) g 2 ( x ) ⋯ g t ( x ) , where $$\deg (g_i)=d_i$$ deg ( g i ) = d i with $$d_1\le d_2\le \cdots \le d_t$$ d 1 ≤ d 2 ≤ ⋯ ≤ d t . Let $$\Upsilon _f:=(U_n)_{n\ge 0}$$ Υ f : = ( U n ) n ≥ 0 be the Nth order linear recurrence sequence with initial conditions $$\begin{aligned} U_0=U_1=\cdots =U_{N-2}=0 \quad \text{ and } \quad U_{N-1}=1, \end{aligned}$$ U 0 = U 1 = ⋯ = U N - 2 = 0 and U N - 1 = 1 , such that f(x) is the characteristic polynomial of $$\Upsilon _f$$ Υ f . In this article, we show, in certain circumstances, how the value modulo p of a particular term of $$\Upsilon _f$$ Υ f determines the reducibility type of f(x) modulo p.

Suggested Citation

  • Joshua Harrington & Lenny Jones, 2025. "Reducibility type of polynomials modulo a prime," Indian Journal of Pure and Applied Mathematics, Springer, vol. 56(2), pages 545-554, June.
  • Handle: RePEc:spr:indpam:v:56:y:2025:i:2:d:10.1007_s13226-023-00501-3
    DOI: 10.1007/s13226-023-00501-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13226-023-00501-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s13226-023-00501-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:indpam:v:56:y:2025:i:2:d:10.1007_s13226-023-00501-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.