English
Related papers

Related papers: The Bergman complex of a matroid and phylogenetic …

200 papers

We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

The intersection data of a hyperplane arrangement is described by a geometric lattice, or equivalently a simple matroid. There is a rich interplay between this combinatorial structure and the topology of the arrangement complement. In this…

Combinatorics · Mathematics 2025-04-22 Christin Bibby

A notion of branch-width, which generalizes the one known for graphs, can be defined for matroids. We first give a proof of the polynomial time model-checking of monadic second-order formulas on representable matroids of bounded…

Discrete Mathematics · Computer Science 2015-03-13 Yann Strozecki

Let $s,n \ge 2$ be integers. We give a qualitative structural description of every matroid $M$ that is spanned by a frame matroid of a complete graph and has no $U_{s,2s}$-minor and no rank-$n$ projective geometry minor, showing that every…

Combinatorics · Mathematics 2016-02-17 Jim Geelen , Peter Nelson

The matching complex $M(G)$ of a simple graph $G$ is the simplicial complex consisting of the matchings on $G$. The matching complex $M(G)$ is isomorphic to the independence complex of the line graph $L(G)$. Braun and Hough introduced a…

Combinatorics · Mathematics 2019-07-01 Takahiro Matsushita

For a tensor triangulated category which is well generated in the sense of Neeman, it is shown that the collection of Bousfield classes forms a set. This set has a natural structure of a complete lattice which is then studied, using the…

Representation Theory · Mathematics 2012-05-15 Srikanth B. Iyengar , Henning Krause

The metric space of phylogenetic trees defined by Billera, Holmes, and Vogtmann, which we refer to as BHV space, provides a natural geometric setting for describing collections of trees on the same set of taxa. However, it is sometimes…

Populations and Evolution · Quantitative Biology 2018-07-12 Gillian Grindstaff , Megan Owen

We exhibit an identity of abstract simplicial complexes between the well-studied complex of trees and the reduced minimal nested set complex of the partition lattice. We conclude that the order complex of the partition lattice can be…

Combinatorics · Mathematics 2007-05-23 Eva Maria Feichtner

The equivariant Kazhdan-Lusztig polynomial of a braid matroid may be interpreted as the intersection cohomology of a certain partial compactification of the configuration space of n distinct labeled points in the plane, regarded as a graded…

Representation Theory · Mathematics 2019-07-25 Nicholas Proudfoot , Ben Young

Delta-matroids are "type B" generalizations of matroids in the same way that maximal orthogonal Grassmannians are generalizations of Grassmannians. A delta-matroid analogue of the Tutte polynomial of a matroid is the interlace polynomial.…

Combinatorics · Mathematics 2024-09-19 Christopher Eur , Matt Larson , Hunter Spink

In this paper, we continue our study of blade arrangements and the positroidal subdivisions which are induced by them on $\Delta_{k,n}$. A blade is a tropical hypersurface which is generated by a system of $n$ affine simple roots of type…

Combinatorics · Mathematics 2022-10-14 Nick Early

The Topological Representation Theorem for (oriented) matroids states that every (oriented) matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a homotopy sphere. In this paper, we…

Combinatorics · Mathematics 2015-03-19 Matthew T. Stamps

We study the generic fibre of the Hadamard product of linear spaces via matroid theory and tropical geometry. To do so, we introduce the flip product, a numerical invariant associated to a pair of matroids defined via the stable…

Combinatorics · Mathematics 2025-12-01 Oliver Clarke , Sean Dewar , Matteo Gallet , Georg Grasegger , Daniel Green Tripp , Ben Smith

The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…

Combinatorics · Mathematics 2015-10-15 Francesco Grande , Juanjo Rué

The toric variety of a matroid is projectively normal, and therefore it is Cohen-Macaulay. We provide a complete graph-theoretic classification when the toric variety of a graphic matroid is Gorenstein.

Combinatorics · Mathematics 2021-11-30 Takayuki Hibi , Michał Lasoń , Kazunori Matsuda , Mateusz Michałek , Martin Vodička

We characterize the shifted simple graphs and the $3$-uniform shifted hypergraphs whose inverse image under exterior shifting is the set of bases of a matroid: those are exactly the hypergraphs whose hyperedges form an initial lex-segment.…

Combinatorics · Mathematics 2025-12-04 Lazar Guterman , Eran Nevo

We present a systematic study of symmetries, invariants and moduli spaces of classes of coframes. We introduce a classifying Lie algebroid to give a complete description of the solution to Cartan's realization problem that applies to both…

Differential Geometry · Mathematics 2012-10-08 Rui Loja Fernandes , Ivan Struchiner

We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

Phylogenetic trees summarize evolutionary relationships. The Billera-Holmes-Vogtmann (BHV) space for comparing phylogenetic trees has many elegant mathematical properties, but it does not encompass trees with differing leaf sets. To…

Populations and Evolution · Quantitative Biology 2025-08-12 Maria Alejandra Valdez Cabrera , Amy D Willis

Let $G=(V, E)$ be an undirected graph. The spanning trees polytope $P(G)$ is the convex hull of the characteristic vectors of all spanning trees of $G$. In this paper, we describe all facets of $P(G)$ as a consequence of the facets of the…

Combinatorics · Mathematics 2020-08-18 Brahim Chaourar
‹ Prev 1 4 5 6 7 8 10 Next ›