The goal of this paper is to obtain some comparison inequalities for a linear operator between polynomials in the plane. The polynomials under study have constraints on their zeros and the estimates ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

In this paper, we establish certain comparison inequalities of Bernstein-type for a linear operator between complex polynomials under certain constraints on their zeros. A variety of interesting ...

Combinatorial counting problems have rich connections to many areas of science including to algebra, probability, and dynamical systems in mathematics as well as to theoretical computer science and ...