pith. sign in

arxiv: 1811.08884 · v1 · pith:QOFSIJLUnew · submitted 2018-11-21 · 🧮 math.CO · math.MG

Computing Convex Hulls in the Affine Building of SL_d

classification 🧮 math.CO math.MG
keywords convexaffinebuildingcollectioncomputingdescribefinitehull
0
0 comments X
read the original abstract

We describe an algorithm for computing the convex hull of a finite collection of points in the affine building of SL_d(K), for K a field with discrete valuation. These convex hulls describe the relations among a finite collection of invertible matrices over K. As a consequence, we bound the dimension of the tropical projective space needed to realize the convex hull as a tropical polytope.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.