Skip to main content
Log in

Bounds on the Number of Connected Components for Tropical Prevarieties

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

For a tropical prevariety in \({\mathbb {R}}^n\) given by a system of k tropical polynomials in n variables with degrees at most d, we prove that its number of the connected components is less than \({k+7n-1 \atopwithdelims ()3n} \cdot \frac{d^{3n}}{k+n+1}\). On a number of 0-dimensional connected components a better bound \({k \atopwithdelims ()n} \cdot \frac{d^n}{k-n+1}\) is obtained, which extends the Bezout bound due to B. Sturmfels from the case \(k=n\) to an arbitrary \(k\ge n\). Also we show that the latter bound is close to sharp, in particular, the number of connected components can depend on k.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Barvinok, A.I.: New algorithms for linear k-matroid intersection and matroid k-parity problems. Math. Program. 69(1–3), 449–470 (1995)

    MathSciNet  MATH  Google Scholar 

  2. Basu, S.: On bounding the Betti numbers and computing the euler characteristic of semi-algebraic sets. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 408–417. ACM, New York (1996)

  3. Bertrand, B., Bihan, F.: Intersection multiplicity numbers between tropical hypersurfaces. In: Algebraic and Combinatorial Aspects of Tropical Geometry, pp. 1–19. Contemporary Mathematics, vol. 589. American Mathematical Society, Providence, RI (2013)

  4. Bieri, R., Groves, J.: The geometry of the set of characters induced by valuations. J. Reine Angew. Math. 347, 168–195 (1984)

    MathSciNet  MATH  Google Scholar 

  5. Bogart, T., Jensen, A.N., Speyer, D., Sturmfels, B., Thomas, R.R.: Computing tropical varieties. J. Symb. Comput. 42, 54–73 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bogart, T., Katz, E.: Obstructions to lifting tropical curves in surfaces in 3-space. SIAM J. Discrete Math. 26(3), 1050–1067 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chistov, A.: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time. J. Sov. Math. 34(4), 1838–1882 (1986)

    Article  MATH  Google Scholar 

  8. Einsiedler, M., Kapranov, M., Lind, D.: Non-archimedean amoebas and tropical varieties. J. Reine Angew. Math. 601, 139–157 (2007)

    MathSciNet  MATH  Google Scholar 

  9. Forman, R.: A user’s guide to discrete Morse theory. Sém. Lothar. Comb. 48, Article B48c (35pp) (2002)

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Fulton, W.: Intersection Theory, vol. 2. Springer, Berlin (2012)

    MATH  Google Scholar 

  12. Grigoriev, D.: Polynomial factoring over a finite field and solving systems of algebraic equations. J. Sov. Math. 34, 1762–1803 (1986)

    Article  Google Scholar 

  13. Grigoriev, D.: Complexity of solving tropical linear systems. Comput. Complexity 22(1), 71–88 (2013)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  15. Grigoriev, D., Vorobjov, N.: Solving systems of polynomial inequalities in subexponential time. J. Symb. Comput. 5(1), 37–64 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  16. Hahn, H.: Über die nichtarchimedischen Größensysteme, Hans Hahn Gesammelte Abhandlungen Band 1/Hans Hahn Collected Works, vol. 1, pp. 445–499. Springer, Berlin (1995)

    Book  Google Scholar 

  17. MacLane, S.: The universality of formal power series fields. Bull. Am. Math. Soc. 45, 888–890 (1939)

    Article  MathSciNet  MATH  Google Scholar 

  18. Richter-Gebert, J., Sturmfels, B., Theobald, T.: First steps in tropical geometry. Contemp. Math. 377, 289–318 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Berlin (2003)

    MATH  Google Scholar 

  20. Shafarevich, I.R., Hirsch, K.A.: Basic Algebraic Geometry, vol. 1. Springer, Berlin (1977)

    Google Scholar 

  21. Steffens, R., Theobald, T.: Combinatorics and genus of tropical intersections and Ehrhart theory. SIAM J. Discrete Math. 24, 17–32 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tabera, L.F., et al.: Tropical resultants for curves and stable intersection. Rev. Mat. Iberoam. 24(3), 941–961 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The second author is grateful to the Grant RSF 16-11-10075 and to MCCME for wonderful working conditions and inspiring atmosphere. Both authors are grateful to the Max-Planck Institut für Mathematik, Bonn for its hospitality during writing this paper and to anonymous referees whose remarks helped to improve the exposition.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dima Grigoriev.

Additional information

Editor in Charge: János Pach

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Davydow, A., Grigoriev, D. Bounds on the Number of Connected Components for Tropical Prevarieties. Discrete Comput Geom 57, 470–493 (2017). https://doi.org/10.1007/s00454-016-9839-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-016-9839-6

Keywords

Mathematics Subject Classification

Navigation