4 papers · 1 filter
Orlik-Solomon algebras determine the Tutte polynomials of matroids of rank at most three
Jianxuan Luo, Tingzeng Wu, Hong-Jian Lai
Let be a simple matroid of rank on the ground set , let denote its Tutte polynomial, and let …
A sharp upper bound on the number of spanning forests of regular graphs
T. Wu, S. Lu, X. Dong
Let be a simple graph on vertices, and let denote the number of its spanning forests. Bencs and Csikvári [Upper bound for the number of spanning forests of regular g…
On the Greedoid Tutte Polynomial for simple rooted graphs
Jianxuan Luo, Tingzeng Wu, Hong-Jian Lai
The Tutte polynomial, through its rank-generating formula, provides a unified framework for describing various combinatorial structures of graphs and matroids, and serves as an imp…
Immanantal polynomials of the linear combination matrices of graphs
Xiangshuai Dong, Tingzeng Wu
The immanant is a generalized matrix function associated with irreducible characters of the symmetric group. The immanantal polynomial of matrix is defined as the immanant of m…