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

Generating Integrally Indecomposable Newton Polygons with Arbitrary Many Vertices

Author

Listed:
  • Petar Ðapić

    (Faculty of Sciences, University of Novi Sad, Trg Dositeja Obradovića 3, 21000 Novi Sad, Serbia)

  • Ivan Pavkov

    (Faculty of Mathematics and Computer Science, Alfa BK University, Palmira Toljatija 3, 11000 Belgrade, Serbia)

  • Siniša Crvenković

    (Faculty of Mathematics and Computer Science, Alfa BK University, Palmira Toljatija 3, 11000 Belgrade, Serbia)

  • Ilija Tanackov

    (Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovića 6, 21000 Novi Sad, Serbia)

Abstract

In this paper we shall give another proof of a special case of Gao’s theorem for generating integrally indecomposable polygons in the sense of Minkowski. The approach of proving this theorem will enable us to give an effective algorithm for construction integrally indecomposable convex integral polygons with arbitrary many vertices. In such a way, classes of absolute irreducible bivariate polynomials corresponding to those indecomposable Newton polygons are generated.

Suggested Citation

  • Petar Ðapić & Ivan Pavkov & Siniša Crvenković & Ilija Tanackov, 2022. "Generating Integrally Indecomposable Newton Polygons with Arbitrary Many Vertices," Mathematics, MDPI, vol. 10(14), pages 1-10, July.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:14:p:2389-:d:857649
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/14/2389/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/14/2389/
    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:10:y:2022:i:14:p:2389-:d:857649. 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.