Specht Polytopes and Specht Matroids

The generators of the classical Specht module satisfy intricate relations. We introduce the Specht matroid, which keeps track of these relations, and the Specht polytope, which also keeps track of convexity relations. We establish basic facts about the Specht polytope, for example, that the symmetric group acts transitively on its vertices and irreducibly on its ambient real vector space. A similar construction builds a matroid and polytope for a tensor product of Specht modules, giving "Kronecker matroids" and "Kronecker polytopes" instead of the usual Kronecker coefficients. We dub this process of upgrading numbers to matroids and polytopes "matroidification," giving two more examples. In the course of describing these objects, we also give an elementary account of the construction of Specht modules different from the standard one. Finally, we provide code to compute with Specht matroids and their Chow rings.Comment: 32 pages, 5 figure

Matroid toric ideals: complete intersection, minors and minimal systems of generators

In this paper, we investigate three problems concerning the toric ideal associated to a matroid. Firstly, we list all matroids $\mathcal M$ such that its corresponding toric ideal $I_{\mathcal M}$ is a complete intersection. Secondly, we handle with the problem of detecting minors of a matroid $\mathcal M$ from a minimal set of binomial generators of $I_{\mathcal M}$. In particular, given a minimal set of binomial generators of $I_{\mathcal M}$ we provide a necessary condition for $\mathcal M$ to have a minor isomorphic to $\mathcal U_{d,2d}$ for $d \geq 2$. This condition is proved to be sufficient for $d = 2$ (leading to a criterion for determining whether $\mathcal M$ is binary) and for $d = 3$. Finally, we characterize all matroids $\mathcal M$ such that $I_{\mathcal M}$ has a unique minimal set of binomial generators.Comment: 9 page

A unique factorization theorem for matroids

We study the combinatorial, algebraic and geometric properties of the free product operation on matroids. After giving cryptomorphic definitions of free product in terms of independent sets, bases, circuits, closure, flats and rank function, we show that free product, which is a noncommutative operation, is associative and respects matroid duality. The free product of matroids $M$ and $N$ is maximal with respect to the weak order among matroids having $M$ as a submatroid, with complementary contraction equal to $N$. Any minor of the free product of $M$ and $N$ is a free product of a repeated truncation of the corresponding minor of $M$ with a repeated Higgs lift of the corresponding minor of $N$. We characterize, in terms of their cyclic flats, matroids that are irreducible with respect to free product, and prove that the factorization of a matroid into a free product of irreducibles is unique up to isomorphism. We use these results to determine, for K a field of characteristic zero, the structure of the minor coalgebra $\cal C$ of a family of matroids $\cal M$ that is closed under formation of minors and free products: namely, $\cal C$ is cofree, cogenerated by the set of irreducible matroids belonging to $\cal M$.Comment: Dedicated to Denis Higgs. 25 pages, 3 figures. Submitted for publication in the Journal of Combinatorial Theory (A). See arXiv:math.CO/0409028 arXiv:math.CO/0409080 for preparatory work on this subjec