English
Related papers

Related papers: On the enumeration of series-parallel matroids

200 papers

The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…

Data Structures and Algorithms · Computer Science 2019-06-03 Satoru Iwata , Yusuke Kobayashi

This article is a survey of matroid theory aimed at algebraic geometers. Matroids are combinatorial abstractions of linear subspaces and hyperplane arrangements. Not all matroids come from linear subspaces; those that do are said to be…

Algebraic Geometry · Mathematics 2014-09-12 Eric Katz

Postnikov gave a combinatorial description of the cells in a totally-nonnegative Grassmannian. These cells correspond to a special class of matroids called positroid. We prove his conjecture that a positroid is exactly an intersection of…

Combinatorics · Mathematics 2010-10-12 Suho Oh

We compute the Kazhdan-Lusztig polynomial of the uniform matroid of rank n-1 on n elements by proving that the i-th coefficient of is equal to the number of ways to choose i non-intersecting chords in an (n-i+1)-gon. We also show that the…

Combinatorics · Mathematics 2015-12-22 Nicholas Proudfoot , Max Wakefield , Benjamin Young

Gao and Xie (2021) conjectured that the inverse Kazhdan-Lusztig polynomial of any matroid is log-concave. Although the inverse Kazhdan-Lusztig polynomial may not always have only real roots, we conjecture that the Hadamard product of an…

Combinatorics · Mathematics 2025-04-25 Matthew H. Y. Xie , Philip B. Zhang

We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…

Group Theory · Mathematics 2025-04-11 Luis Felipe Prieto-Martínez , Javier Rico

We show that the number of linear spaces on a set of $n$ points and the number of rank-3 matroids on a ground set of size $n$ are both of the form $(cn+o(n))^{n^2/6}$, where $c=e^{\sqrt 3/2-3}(1+\sqrt 3)/2$. This is the final piece of the…

Combinatorics · Mathematics 2024-05-31 Matthew Kwan , Ashwin Sah , Mehtaab Sawhney

Irreducibility results for parabolic induction of representations of the general linear group over a local non-archimedean field can be formulated in terms of Kazhdan--Lusztig polynomials of type $A$. Spurred by these results and some…

Combinatorics · Mathematics 2018-09-25 Erez Lapid

We show a precise formula, in the form of a monomial, for certain families of parabolic Kazhdan-Lusztig polynomials of the symmetric group. The proof stems from results of Lapid-Minguez on irreducibility of products in the…

Representation Theory · Mathematics 2018-09-11 Maxim Gurevich

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Carolyn Chun

We introduce the notion of a categorical valuative invariant of polyhedra or matroids, in which alternating sums of numerical invariants are replaced by split exact sequences in an additive category. We provide categorical lifts of a number…

Combinatorics · Mathematics 2024-10-23 Ben Elias , Dane Miyata , Nicholas Proudfoot , Lorenzo Vecchi

B\'ar\'any, Kalai, and Meshulam recently obtained a topological Tverberg-type theorem for matroids, which guarantees multiple coincidences for continuous maps from a matroid complex to d-dimensional Euclidean space, if the matroid has…

Combinatorics · Mathematics 2017-05-11 Pavle V. M. Blagojević , Albert Haase , Günter M. Ziegler

A famous theorem of Galvin states that the list chromatic number of the intersection of two partition matroids equals its chromatic number. Kiraly and Berczi et. al. conjectured that this equality holds for any two matroids. We prove this…

Combinatorics · Mathematics 2024-07-15 He Guo

The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…

Combinatorics · Mathematics 2007-05-23 Mark Jerrum

In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly…

Combinatorics · Mathematics 2007-05-23 W. M. B. Dukes

Motivated by the $Z$-polynomials of matroids, Ferroni, Matherne, Stevens, and Vecchi introduced the inverse $Z$-polynomial of a matroid. In this paper, we prove several fundamental properties of the inverse $Z$-polynomial, including…

Combinatorics · Mathematics 2025-07-03 Alice L. L. Gao , Xuan Ruan , Matthew H. Y. Xie

We present an algebraic framework which simultaneously generalizes the notion of linear subspaces, matroids, valuated matroids, oriented matroids, and regular matroids. To do this, we first introduce algebraic objects called tracts which…

Combinatorics · Mathematics 2018-12-13 Matthew Baker , Nathan Bowler

We show that the Combinatorial Invariance Conjecture for Kazhdan-Lusztig polynomials due to Lusztig and to Dyer, its parabolic analog due to Marietti, and a refined parabolic version that we introduce, are equivalent. We use this to give a…

Combinatorics · Mathematics 2025-06-04 Grant T. Barkley , Christian Gaetz

We obtain new combinatorial formulae for modified Hall--Littlewood polynomials, for matrix elements of the transition matrix between the elementary symmetric functions and Hall-Littlewood's ones, and for the number of rational points over…

Quantum Algebra · Mathematics 2007-05-23 Anatol N. Kirillov

Morphisms of matroids are combinatorial abstractions of linear maps and graph homomorphisms. We introduce the notion of basis for morphisms of matroids, and show that its generating function is strongly log-concave. As a consequence, we…

Combinatorics · Mathematics 2020-04-02 Christopher Eur , June Huh