Computing Convex Hulls in the Affine Building of SL_d
Combinatorics
2018-11-22 v1 Metric Geometry
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.
Keywords
Cite
@article{arxiv.1811.08884,
title = {Computing Convex Hulls in the Affine Building of SL_d},
author = {Leon Zhang},
journal= {arXiv preprint arXiv:1811.08884},
year = {2018}
}
Comments
18 pages, 11 figures