IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i16p3602-d1221053.html
   My bibliography  Save this article

Hard to Detect Factors of Univariate Integer Polynomials

Author

Listed:
  • Alberto Dennunzio

    (Department of Informatics, Systems and Communication, University of Milano-Bicocca, 20100 Milan, Italy
    These authors contributed equally to this work.)

  • Enrico Formenti

    (CNRS, I3S, Université Côte d’Azur, France
    These authors contributed equally to this work.)

  • Luciano Margara

    (Department of Computer Science and Engineering, Via dell’Universitá 50, 47521 Cesena, Italy
    These authors contributed equally to this work.)

Abstract

We investigate the computational complexity of deciding whether a given univariate integer polynomial p ( x ) has a factor q ( x ) satisfying specific additional constraints. When the only constraint imposed on q ( x ) is to have a degree smaller than the degree of p ( x ) and greater than zero, the problem is equivalent to testing the irreducibility of p ( x ) and then it is solvable in polynomial time. We prove that deciding whether a given monic univariate integer polynomial has factors satisfying additional properties is NP-complete in the strong sense. In particular, given any constant value k ∈ Z , we prove that it is NP-complete in the strong sense to detect the existence of a factor that returns a prescribed value when evaluated at x = k (Theorem 1) or to detect the existence of a pair of factors—whose product is equal to the original polynomial—that return the same value when evaluated at x = k (Theorem 2). The list of all the properties we have investigated in this paper is reported at the end of Section Introduction.

Suggested Citation

  • Alberto Dennunzio & Enrico Formenti & Luciano Margara, 2023. "Hard to Detect Factors of Univariate Integer Polynomials," Mathematics, MDPI, vol. 11(16), pages 1-9, August.
  • Handle: RePEc:gam:jmathe:v:11:y:2023:i:16:p:3602-:d:1221053
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/16/3602/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/11/16/3602/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:11:y:2023:i:16:p:3602-:d:1221053. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.