Related papers: Subdominant matroid ultrametrics
In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…
Given a bipartite graph $G=(U\cup V,E)$, a left-perfect many-to-one matching is a subset $M \subseteq E$ such that each vertex in $U$ is incident with exactly one edge in $M$. If $U$ is partitioned into some groups, the matching is called…
We study the diophantine exponent of analytic submanifolds of the space of m by n real matrices, answering questions of Beresnevich, Kleinbock and Margulis. We identify a family of algebraic obstructions to the extremality of such a…
Let E be a plane in an algebraic torus over an algebraically closed field. Given a balanced 1-dimensional fan C in the tropicalization of E, i.e. in the Bergman fan of the corresponding matroid, we give a complete algorithmic answer to the…
The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…
In this article we study the treewidth of the \emph{display graph}, an auxiliary graph structure obtained from the fusion of phylogenetic (i.e., evolutionary) trees at their leaves. Earlier work has shown that the treewidth of the display…
We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…
Given vectors $v_1,\dots,v_n\in\mathbb{R}^d$ and a matroid $M=([n],I)$, we study the problem of finding a basis $S$ of $M$ such that $\det(\sum_{i \in S}v_i v_i^\top)$ is maximized. This problem appears in a diverse set of areas such as…
The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…
Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored undirected graphs, are of central interest, e.g.\ in phylogenomics. In this context symbolic ultrametrics play a crucial role. Symbolic ultrametrics…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
Tropical algebraic geometry is the geometry of the tropical semiring (R, min, +). The theory of total positivity is a natural generalization of the study of matrices with all minors positive. In this paper we introduce the totally positive…
We study the parallel complexity of finding a basis of a graphic matroid under independence-oracle access. Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988) initiated the study of this problem and established two algorithms for finding a…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
In the first part of the paper, we clarify the connections between several algebraic objects appearing in matroid theory: both partial fields and hyperfields are fuzzy rings, fuzzy rings are tracts, and these relations are compatible with…
Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…
The set of ultrametrics on $[n]$ nodes that are $\ell^\infty$-nearest to a given dissimilarity map forms a $(\max,+)$ tropical polytope. Previous work of Bernstein has given a superset of the set containing all the phylogenetic trees that…
It has been conjectured that asymptotically almost all matroids are sparse paving, i.e. that $s(n) \sim m(n)$, where $m(n)$ denotes the number of matroids on a fixed groundset of size $n$, and $s(n)$ the number of sparse paving matroids. In…
Given a set of leaf-labeled trees with identical leaf sets, the well-known "Maximum Agreement SubTree" problem (MAST) consists of finding a subtree homeomorphically included in all input trees and with the largest number of leaves. Its…
It is well known among phylogeneticists that adding an extra taxon (e.g. species) to a data set can alter the structure of the optimal phylogenetic tree in surprising ways. However, little is known about this "rogue taxon" effect. In this…