Skip to main content

Traversing Symmetric Polyhedral Fans

  • Conference paper

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

Abstract

We propose an algorithm for computing the facets of a pure connected polyhedral fan up to symmetry. The fan is represented by an oracle. With suitable implementations of the oracle the same algorithm can be used for computing secondary fans, Gröbner fans, tropical varieties and Minkowski sums up to symmetry. The algorithm has been implemented in the software Gfan.

Keywords

  • Polyhedral fans
  • tropical geometry
  • algorithms
  • symmetry

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avis, D., Fukuda, K.: A basis enumeration algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Computational Geometry 8, 295–313 (1992)

    CrossRef  MATH  MathSciNet  Google Scholar 

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

    CrossRef  MATH  MathSciNet  Google Scholar 

  3. Bremner, D., Sikiric, M.D., Schürmann, A.: Polyhedral representation conversion up to symmetries. CRM proceedings 48, 45–72 (2009)

    Google Scholar 

  4. Chan, M., Jensen, A., Rubei, E.: The 4 x 4 minors of a 5 x n matrix are a tropical basis, arXiv:0912.5264 (2009)

    Google Scholar 

  5. Collart, S., Kalkbrener, M., Mall, D.: Converting bases with the Gröbner walk. J. Symbolic Comput. 24(3-4), 465–469 (1997); Computational algebra and number theory, London (1993)

    Google Scholar 

  6. Fukuda, K.: From the zonotope construction to the Minkowski addition of convex polytopes. J. Symb. Comput. 38(4), 1261–1272 (2004)

    CrossRef  MATH  MathSciNet  Google Scholar 

  7. Fukuda, K.: cddlib reference manual, cddlib Version 094b.  Swiss Federal Institute of Technology, Lausanne and Zürich, Switzerland (2005), http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html

  8. Fukuda, K., Jensen, A., Thomas, R.: Computing Gröbner fans. Mathematics of Computation 76, 2189–2212 (2007)

    CrossRef  MATH  MathSciNet  Google Scholar 

  9. Granlund, T., et al.: GNU multiple precision arithmetic library 4.3.1 (2009), http://gmplib.org

  10. Jensen, A.N.: Gfan, a software system for Gröbner fans and tropical varieties, http://www.math.tu-berlin.de/~jensen/software/gfan/gfan.html

  11. Rambau, J.: TOPCOM: Triangulations of point configurations and oriented matroids. ZIB Report, 02-17 (2002)

    Google Scholar 

  12. Wunderling, R.: Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universität Berlin (1996), http://www.zib.de/Publications/abstracts/TR-96-09/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jensen, A.N. (2010). Traversing Symmetric Polyhedral Fans. In: Fukuda, K., Hoeven, J.v.d., Joswig, M., Takayama, N. (eds) Mathematical Software – ICMS 2010. ICMS 2010. Lecture Notes in Computer Science, vol 6327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15582-6_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15582-6_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15581-9

  • Online ISBN: 978-3-642-15582-6

  • eBook Packages: Computer ScienceComputer Science (R0)