Skip to main content

Tropical Newton–Puiseux Polynomials

  • Conference paper
  • First Online:
Computer Algebra in Scientific Computing (CASC 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11077))

Included in the following conference series:

Abstract

We introduce tropical Newton–Puiseux polynomials admitting rational exponents. A resolution of a tropical hypersurface is defined by means of a tropical Newton–Puiseux polynomial. A polynomial complexity algorithm for resolubility of a tropical curve is designed. The complexity of resolubility of tropical prevarieties of arbitrary codimensions is studied.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bittner, L.: Some representation theorems for functions and sets and their application to nonlinear programming. Numer. Math. 16, 32–51 (1970)

    Article  MathSciNet  Google Scholar 

  2. Dobkin, D., Guibas, L., Hershberger, J., Snoeyink, J.: An efficient algorithm for finding the CSG representation of a simple polygon. Algorithmica 10, 1–23 (1993)

    Article  MathSciNet  Google Scholar 

  3. Fukuda, K., Saito, S., Tamura, A.: Combinatorial face enumeration in arrangements and oriented matroids. Discret. Appl. Math. 31, 141–149 (1991)

    Article  MathSciNet  Google Scholar 

  4. Grigoriev, D., Podolskii, V.: Complexity of tropical and min-plus linear prevarieties. Comput. Complex. 24, 31–64 (2015)

    Article  MathSciNet  Google Scholar 

  5. Kripfganz, A., Schulze, R.: Piecewise affine functions as a difference of two convex functions. Optimization 18, 23–29 (1987)

    Article  MathSciNet  Google Scholar 

  6. Maclagan, D., Sturmfels, B.: Introduction to Tropical Geometry. Graduate Studies in Mathematics, vol. 161. AMS, Providence (2015)

    MATH  Google Scholar 

  7. Ovchinnikov, S.: Max-min representation of piecewise linear functions. Beitr. Algebra Geom. 43, 297–302 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Theobald, T.: On the frontiers of polynomial computations in tropical geometry. J. Symb. Comput. 41, 1360–1375 (2006)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The author is grateful to the grant RSF 16-11-10075 and to MCCME for inspiring atmosphere.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dima Grigoriev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Grigoriev, D. (2018). Tropical Newton–Puiseux Polynomials. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2018. Lecture Notes in Computer Science(), vol 11077. Springer, Cham. https://doi.org/10.1007/978-3-319-99639-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99639-4_12

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99638-7

  • Online ISBN: 978-3-319-99639-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics