Papers
Topics
Authors
Recent
Search
2000 character limit reached

Improved bounds for the coefficient of flow polynomials

Published 18 Feb 2025 in math.CO | (2502.12773v1)

Abstract: Let GG be a connected bridgeless (n,m)(n,m)-graph which may have loops and multiedges, and let F(G,t)F(G,t) denote the flow polynomial of GG. Dong and Koh \cite{Dong1} established an upper bound for the absolute value of coefficient cic_{i} of t<sup>it<sup>{i} in the expansion of F(G,t)F(G,t), where 0imn+10\leqslant i \leqslant m-n+1. In this paper, we refine the aforementioned bound. Specifically, we demonstrate that when nmn+3n \leqslant m \leqslant n+3, cidi|c_{i}|\leqslant d_{i}, where did_{i} is the coefficient of t<sup>it<sup>{i} in the expansion j=1<sup>mn+1(t+j)\prod\limits_{j=1}<sup>{m-n+1}(t+j); and when mn+4m\geqslant n+4, cidi|c_{i}|\leqslant d_{i}, with did_{i} being the coefficient of t<sup>it<sup>{i} in the expansion (t+1)(t+2)(t+3)<sup>2(t+4)<sup>mn3(t+1)(t+2)(t+3)<sup>{2}(t+4)<sup>{m-n-3}. Furthermore, we prove that if GG is a connected bridgeless cubic graph having only real flow roots, then bicib_{i}\leqslant |c_{i}|, where bib_{i} is the coefficient of t<sup>it<sup>{i} in the expansion (t+1)(t+2)<sup>n2(t+1)(t+2)<sup>{\frac{n}{2}}. Notably, if GG is simple connected bridgeless cubic graph with only real flow roots, then bib_{i} is the coefficient of t<sup>it<sup>{i} in the expansion (t+1)(t+2)<sup>n22(t+3)<sup>2(t+1)(t+2)<sup>{\frac{n}{2}-2}(t+3)<sup>{2}.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.