Möbius and coboundary polynomials for matroids
نویسندگان
چکیده
Abstract We study how some coefficients of two-variable coboundary polynomials can be derived from Betti numbers Stanley–Reisner rings. also explain the connection with these rings forces and Möbius to satisfy certain universal equations.
منابع مشابه
Relations Between Möbius and Coboundary Polynomials
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do not determine each other. Less is known about more specific cases. In this paper, we will investigate if it is possible that the Möbius polynomial of a matroid, together with the Möbius polynomial of the dual matroid, define the coboundary polynomial of the matroid. In some cases, the answer is aff...
متن کاملParametrized Tutte Polynomials of Graphs and Matroids
We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky, and Bollobás and Riordan. We give a generalized Zaslavsky– Bollobás–Riordan theorem that characterizes parametrized contraction–deletion functions on minor-closed classes of matroids, as well as the modifications necessary to apply the discussion to classes of graphs. In gener...
متن کاملTruncation Formulas for Invariant Polynomials of Matroids and Geometric Lattices
This paper considers the truncation of matroids and geometric lattices. It is shown that the truncated matroid of a representable matroid is again representable. Truncation formulas are given for the coboundary and Möbius polynomial of a geometric lattice and the spectrum polynomial of a matroid, generalizing the truncation formula of the rank generating polynomial of a matroid by Britz. Mathem...
متن کاملTotal Polynomials of Uniform Oriented Matroids
In this paper we introduce polynomials associated with uniform oriented matroids whose coefficients enumerate cells in the corresponding arrangements. These polynomials are quite useful in the study of many enumeration problems of combinatorial geometry, such as counting faces of polytopes, counting Radon partitions, counting k-sets, and so forth. We also describe some striking equations relati...
متن کاملA generalization of weight polynomials to matroids
Generalizing polynomials previously studied in the context of linear codes, we define weight polynomials and an enumerator for a matroid M . Our main result is that these polynomials are determined by Betti numbers associated with N0-graded minimal free resolutions of the Stanley-Reisner ideals of M and so-called elongations of M . Generalizing Greene’s theorem from coding theory, we show that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00906-3