June 6, 2024Open Access

On the enumeration of series-parallel matroids

Key Points

Key points are not available for this paper at this time.

Abstract

By the work of Ferroni and Larson, Kazhdan-Lusztig polynomials and Z-polynomials of complete graphs have combinatorial interpretations in terms of quasi series-parallel matroids. We provide explicit formulas for the number of series-parallel matroids and the number of simple series-parallel matroids of a given rank and cardinality, extending results of Ferroni-Larson and Gao-Proudfoot-Yang-Zhang.

Read Full Paperexternally

Demander à l'IA

Bookmark

View Full Paper

Cite This Study

Proudfoot et al. (Thu,) studied this question.

synapsesocial.com/papers/68e65e3eb6db6435875ed03a https://doi.org/https://doi.org/10.48550/arxiv.2406.04502

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1The Combinatorics Behind the Leading Kazhdan-Lusztig Coefficients of Braid Matroids2024
2Hilbert–Poincaré series of matroid Chow rings and intersection cohomology2024 · 13 citations
3Deletion formulas for equivariant Kazhdan-Lusztig polynomials of matroids2024
4Matroidal polynomials, their singularities, and applications to Feynman diagrams2024 · 1 citations
5The ultra log-concavity of <i>Z</i> -polynomials and <i>γ</i> -polynomials of uniform matroids2024

Demander à l'IA

Bookmark

View Full Paper