arXiv Analytics

Sign in

arXiv:1611.02746 [math.CO]AbstractReferencesReviewsResources

The $α$-representation for the characteristic function of a matroid

Eduard Yu. Lerner

Published 2016-11-08Version 1

Let $M=(E,\mathcal B)$ be an $\mathbb F_q$-linear matroid; denote by ${\mathcal B}$ the family of its bases, $s(M;\alpha)=\sum_{B\in\mathcal B}\prod_{e \in B} \alpha_e$, where ${\alpha_e\in \mathbb F_q}$. According to the Kontsevich conjecture stated in 1997, the number of nonzero values of $s(M;\alpha)$ is a polynomial with respect to $q$ for all matroids. This conjecture was disproved by P. Brosnan and P. Belkale. In this paper we express the characteristic polynomial of the dual matroid $M^\perp$ in terms of the "correct" Kontsevich formula (for $\mathbb F_q$-linear matroids). This representation generalizes the formula for a flow polynomial of a graph which was obtained by us earlier (and with the help of another technique). In addition, generalizing the correlation (announced by us earlier) that connects flow and chromatic polynomials, we define the characteristic polynomial of $M^\perp$ in two ways, namely, in terms of characteristic polynomials of $M/A$ and $M|_A$, respectively, $A\subseteq E$. The latter expressions are close to convolution-multiplication formulas established by V. Reiner and J. P. S. Kung.

Related articles: Most relevant | Search more
arXiv:2310.07104 [math.CO] (Published 2023-10-11)
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph
arXiv:1711.03868 [math.CO] (Published 2017-11-09)
On the $A_α$-characteristic polynomial of a graph
arXiv:2206.09284 [math.CO] (Published 2022-06-18)
Rank-Metric Lattices