Tutte polynomials for regular oriented matroids

被引:0
|
作者
Awan, Jordan [1 ]
Bernardi, Olivier [2 ]
机构
[1] Purdue Univ, Dept Stat, W Lafayette, IN 47907 USA
[2] Brandeis Univ, Dept Math, Waltham, MA 02453 USA
基金
美国国家科学基金会;
关键词
Regular matroid; Combinatorial reciprocity; Partially oriented matroid; Potts model;
D O I
10.1016/j.disc.2023.113687
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid N, we associate a polynomial invariant AN(q, y, z), which we call the A-polynomial. The A-polynomial has the following interesting properties among many others:center dot a specialization of AN gives the Tutte polynomial of the underlying unoriented matroid N,center dot when the oriented matroid N corresponds to an unoriented matroid (that is, when the elements of the ground set come in pairs with opposite orientations), the invariant AN is equivalent to the Tutte polynomial of this unoriented matroid (up to a change of variables),center dot the invariant AN detects, among other things, whether N is acyclic and whether N is totally cyclic.We explore various properties and specializations of the A-polynomial. We show that some of the known properties of the Tutte polynomial of matroids can be extended to the A -polynomial of regular oriented matroids. For instance, we show that a specialization of AN counts all the acyclic orientations obtained by reorienting some elements of N, according to the number of reoriented elements. Let us mention that in a previous article we had defined an invariant of oriented graphs that we called the B-polynomial, which is also a generalization of the Tutte polynomial. However, the B-polynomial of an oriented graph N is not equivalent to its A-polynomial, and the B-polynomial cannot be extended to an invariant of regular oriented matroids.(c) 2023 Elsevier B.V. All rights reserved.
引用
收藏
页数:34
相关论文
共 50 条