Abstract

We introduce the Dyck path triangulation of the cartesian product of two simplices Δn−1×Δn−1Δ_{n-1}\timesΔ_{n-1}. The maximal simplices of this triangulation are given by Dyck paths, and its construction naturally generalizes to produce triangulations of Δr n−1×Δn−1Δ_{r\ n-1}\timesΔ_{n-1} using rational Dyck paths. Our study of the Dyck path triangulation is motivated by extendability problems of partial triangulations of products of two simplices. We show that whenever m≥k>nm\geq k>n, any triangulation of Δm−1(k−1)×Δn−1Δ_{m-1}^{(k-1)}\timesΔ_{n-1} extends to a unique triangulation of Δm−1×Δn−1Δ_{m-1}\timesΔ_{n-1}. Moreover, with an explicit construction, we prove that the bound k>nk>n is optimal. We also exhibit interesting interpretations of our results in the language of tropical oriented matroids, which are analogous to classical results in oriented matroid theory.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.