32 research outputs found
Dyck path triangulations and extendability
We introduce the Dyck path triangulation of the cartesian product of two
simplices . The maximal simplices of this
triangulation are given by Dyck paths, and its construction naturally
generalizes to produce triangulations of
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 , any triangulation of
extends to a unique triangulation of
. Moreover, with an explicit construction, we
prove that the bound 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.Comment: 15 pages, 14 figures. Comments very welcome
Dyck path triangulations and extendability (extended abstract)
International audienceWe introduce the Dyck path triangulation of the cartesian product of two simplices . The maximal simplices of this triangulation are given by Dyck paths, and its construction naturally generalizes to produce triangulations of 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, any triangulations of extends to a unique triangulation of . Moreover, with an explicit construction, we prove that the bound is optimal. We also exhibit interpretations of our results in the language of tropical oriented matroids, which are analogous to classical results in oriented matroid theory.Nous introduisons la triangulation par chemins de Dyck du produit cartésien de deux simplexes . Les simplexes maximaux de cette triangulation sont donnés par des chemins de Dyck, et cette construction se généralise de façon naturelle pour produire des triangulations qui utilisent des chemins de Dyck rationnels. Notre étude de la triangulation par chemins de Dyck est motivée par des problèmes de prolongement de triangulations partielles de produits de deux simplexes. On montre que alors toute triangulation de se prolonge en une unique triangulation de . De plus, avec une construction explicite, nous montrons que la borne est optimale. Nous présentons aussi des interprétations de nos résultats dans le langage des matroïdes orientés tropicaux, qui sont analogues aux résultats classiques de la théorie des matroïdes orientés
Matching fields and lattice points of simplices
We show that the Chow covectors of a linkage matching field define a bijection between certain degree vectors and lattice points, and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels and Zelevinsky (1993) [26] on linkage matching fields. For this, we give an explicit construction that associates a bipartite incidence graph of an ordered partition of a common set to each lattice point in a dilated simplex. Given a triangulation of a product of two simplices encoded by a set of spanning trees on a bipartite node set, we similarly prove that the bijection from left to right degree vectors of the trees is enough to recover the triangulation. As additional results, we show a cryptomorphic description of linkage matching fields and characterise the flip graph of a linkage matching field in terms of its prodsimplicial flag complex. Finally, we relate our findings to transversal matroids through the tropical Stiefel map
Tropical curves, graph complexes, and top weight cohomology of M_g
We study the topology of a space parametrizing stable tropical curves of
genus g with volume 1, showing that its reduced rational homology is
canonically identified with both the top weight cohomology of M_g and also with
the genus g part of the homology of Kontsevich's graph complex. Using a theorem
of Willwacher relating this graph complex to the Grothendieck-Teichmueller Lie
algebra, we deduce that H^{4g-6}(M_g;Q) is nonzero for g=3, g=5, and g at least
7. This disproves a recent conjecture of Church, Farb, and Putman as well as an
older, more general conjecture of Kontsevich. We also give an independent proof
of another theorem of Willwacher, that homology of the graph complex vanishes
in negative degrees.Comment: 31 pages. v2: streamlined exposition. Final version, to appear in J.
Amer. Math. So