Tropical convexity via cellular resolutions

Authors:
Florian Block;Josephine Yu
Affiliations:
Technische Universität München, Zentrum Mathematik, Garching, Germany 85748;Department of Mathematics, University of California, Berkeley 94720
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
2006

Citing 2
Cited 6

Theory of linear and integer programming

Theory of linear and integer programming
Computing irredundant irreducible decompositions of large scale monomial ideals

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

The Slice Algorithm for irreducible decomposition of monomial ideals

Journal of Symbolic Computation
Max-plus Algebraic Tools for Discrete Event Systems, Static Analysis, and Zero-Sum Games

FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
The number of extreme points of tropical polyhedra

Journal of Combinatorial Theory Series A
Minimal half-spaces and external representation of tropical polyhedra

Journal of Algebraic Combinatorics: An International Journal
Computing the bounded subcomplex of an unbounded polyhedron

Computational Geometry: Theory and Applications
Minimal external representations of tropical polyhedra

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

The tropical convex hull of a finite set of points in tropical projective space has a natural structure of a cellular free resolution. Therefore, methods from computational commutative algebra can be used to compute tropical convex hulls. Tropical cyclic polytopes are also presented.