Proving identities on weight polynomials of tiered trees via Tutte polynomials

From MaRDI portal
Publication:2084993




Abstract: A {it tiered graph} G=(V,E) with m tiers is a simple graph with , where , and with a surjective map t from V to such that if v is a vertex adjacent to v in G with v>v, then t(v)>t(v). For any ordered partition p=(p1,p2,cdots,pm) of n, let settp denote the set of tiered trees with vertex set and with a map such that |t1(i)|=pi for all i=1,2,ldots,m. For any Tinsettp, let KT denote the complete tiered graph whose vertex set and tiering map are the same as those of T. If the edges of KT are ordered lexicographically by their endpoints, then the weight w(T) of T is the external activity of T in KT, i.e., the number of edges einE(KT)setminusE(T) such that e is the least element in the unique cycle determined by Tcupe. Let Pp(q)=sumTinsettpqw(T). Dugan, Glennon, Gunnells and Steingr'imsson [J. Combin. Theory, Ser. A 164 (2019) pp. 24-49] asked for an elementary proof of the identity Pp(q)=Ppi(p)(q) for any permutation pi of 1,2,cdots,m, where pi(p)=ppi(1),ppi(2),cdots,ppi(m)). In this article, we will prove an extension of this identity by applying Tutte polynomials. Furthermore, we also provide a proof of the identity P(1,p1,p2)(q)=P(p1+1,p2+1)(q) via Tutte polynomials.









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)