Proving identities on weight polynomials of tiered trees via Tutte polynomials
From MaRDI portal
Publication:2084993
Abstract: A {it tiered graph} with tiers is a simple graph with , where , and with a surjective map from to such that if is a vertex adjacent to in with , then . For any ordered partition of , let denote the set of tiered trees with vertex set and with a map such that for all . For any , let denote the complete tiered graph whose vertex set and tiering map are the same as those of . If the edges of are ordered lexicographically by their endpoints, then the weight of is the external activity of in , i.e., the number of edges such that is the least element in the unique cycle determined by . Let . Dugan, Glennon, Gunnells and Steingr'imsson [J. Combin. Theory, Ser. A 164 (2019) pp. 24-49] asked for an elementary proof of the identity for any permutation of , where . In this article, we will prove an extension of this identity by applying Tutte polynomials. Furthermore, we also provide a proof of the identity via Tutte polynomials.
Recommendations
Cites work
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 67325 (Why is no real title available?)
- scientific article; zbMATH DE number 1369835 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A bijective enumeration of tiered trees
- Intransitive trees
- The Tutte polynomial
- Tiered trees, weights, and \(q\)-Eulerian numbers
- Torus orbits on homogeneous varieties and Kac polynomials of quivers
Cited in
(2)
This page was built for publication: Proving identities on weight polynomials of tiered trees via Tutte polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084993)