Skip to main content
Log in

On the Reducibility and the Lenticular Sets of Zeroes of Almost Newman Lacunary Polynomials

  • Research Contribution
  • Published:
Arnold Mathematical Journal Aims and scope Submit manuscript

Abstract

The class \({\mathcal {B}}\) of lacunary polynomials \(f\,(x)\ :=\ -1\ +\ x\ +\ x^{n}\ +\ x^{m_{1}}\ +\ x^{m_{2}}\ +\ \cdots \ +\ x^{m_{s}}\), where \(s\ \geqslant \ 0\), \(m_{1}\ -\ n\ \geqslant \ n\ -\ 1\), \(m_{q+1}\ -\ m_{q}\ \geqslant \ n\ -\ 1\) for \(1\ \leqslant \ q\ <\ s\), \(n\ \geqslant \ 3\) is studied. A polynomial having its coefficients in \(\{0,\,1\,\}\) except its constant coefficient equal to \(-1\) is called an almost Newman polynomial. A general theorem of factorization of the almost Newman polynomials of the class \({\mathcal {B}}\) is obtained. Such polynomials possess lenticular roots in the open unit disk off the unit circle in the small angular sector \(-\pi /18\ \leqslant \ \arg \,z\ \leqslant \ \pi /18\) and their nonreciprocal parts are always irreducible. The existence of lenticuli of roots is a peculiarity of the class \({\mathcal {B}}\). By comparison with the Odlyzko–Poonen Conjecture and its variant Conjecture, an Asymptotic Reducibility Conjecture is formulated aiming at establishing the proportion of irreducible polynomials in this class. This proportion is conjectured to be 3 / 4 and estimated using Monte-Carlo methods. The numerical approximate value \(\approx \ 0.756\) is obtained. The results extend those on trinomials (Selmer) and quadrinomials (Ljunggren, Mills, Finch and Jones).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  • Borst, C., Boyd, E., Brekken, C., Solberg, S., Wood, M.M., Wood, P.M.: Irreducibility of Random Polynomials. Exp. Math. 27(4), 498–506 (2018). https://doi.org/10.1080/10586458.2017.1325790

    Article  MathSciNet  MATH  Google Scholar 

  • Dobrowolski, E.: On a question of Lehmer and the number of irreducible factors of a polynomial. Acta Arith. 34(4), 391–401 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  • Filaseta, M.: On the Factorization of Polynomials with Small Euclidean Norm. In: K. Gyory, H. Iwaniec, and J. Urbanowicz,editors, Number Theory in Progress, pp. 143–163, Zakopane,Poland, 1999. Walter De Gruyter

  • Filaseta, M., Finch, C., Nicol, C.: On three questions concerning 0, 1-polynomials. J. Théor. Nr. Bordx 18(2), 357–370 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Finch, C., Jones, L.: On the Irreducibility of -1,0,1 - Quadrinomials. Integers, 6:#A16, (2006)

  • Flatto, L., Lagarias, J.C., Poonen, B.: The zeta function of the beta transformation. Ergod. Theory Dyn. Syst. 14(2), 237–266 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  • Konyagin, S.V.: On the number of irreducible polynomials with 0, 1 coefficients. Acta Arith. 88(4), 333–350 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  • Ljunggren, W.: On the irreducibility of certain trinomials and quadrinomials. Math. Scand. 8, 65 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  • Lothaire, M.: Algebraic combinatorics on words. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  • Mignotte, M., Stefanescu, D.: On the roots of lacunary polynomials. Math. Inequal. Appl. 2(1), 1–13 (1999)

    MathSciNet  MATH  Google Scholar 

  • Mills, W.H.: The factorization of certain quadrinomials. Math. Scand. 57(1), 44–50 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  • Odlyzko, A.M., Poonen, B.: Zeros of polynomials with 0, 1 coefficients. Enseign. Math. 39, 317–348 (1993)

    MathSciNet  MATH  Google Scholar 

  • Schinzel, A.: Reducibility of lacunary polynomials I. Acta Arith. 16, 123–160 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  • Schinzel, A.: On the number of irreducible factors of a polynomial. Colloq. Math. Soc. Janos Bolyai 13, 305–314 (1976)

    MathSciNet  MATH  Google Scholar 

  • Schinzel, A.: Reducibility of lacunary polynomials III. Acta Arith. 34(3), 227–266 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  • Schinzel, A.: On the number of irreducible factors of a polynomial II. Ann. Polon. Math. 42(1), 309–320 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  • Selmer, E.S.: On the irreducibility of certain trinomials. Math. Scand. 4(2), 287–302 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  • Solomyak, B.: Conjugates of beta-numbers and the zero-free domain for a class of analytic functions. Proc. Lond. Math. Soc. s3–68(3), 477–498 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  • Verger-Gaugry, J.-L.: Uniform distribution of the galois conjugates and beta-conjugates of a parry number near the unit circle and dichotomy of perron numbers. Unif. Distrib. Theory 3, 157–190 (2008)

    MathSciNet  MATH  Google Scholar 

  • Verger-Gaugry, J.-L.: On the conjecture of lehmer, limit mahler measure of trinomials and asymptotic expansions. Unif. Distrib. Theory 11(1), 79–139 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  • Verger-Gaugry, J.-L.: A Proof of the Conjecture of Lehmer and of the Conjecture of Schinzel-Zassenhaus. Arxiv:1709.03771, 164 pages, (2017)

Download references

Acknowledgements

The authors would like to thank Dr. Bill Allombert (Institut de Mathématiques de Bordeaux, France) for helpful discussions on PARI/GP software.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Denys Dutykh.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

A Algorithms and Programs

A Algorithms and Programs

The pseudo-code of the employed Monte–Carlo algorithm and the PARI/GP program A used in the present study is given below:

figure a

The following PARI/GP script estimates the probability of finding a sparse irreducible polynomial with coefficients in \(\{-1,\, 0,\, 1\}\) in the class \({\mathcal {B}}\):

figure b

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dutykh, D., Verger-Gaugry, JL. On the Reducibility and the Lenticular Sets of Zeroes of Almost Newman Lacunary Polynomials. Arnold Math J. 4, 315–344 (2018). https://doi.org/10.1007/s40598-019-00102-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40598-019-00102-1

Keywords

Mathematics Subject Classification

Navigation