Littlewood–Richardson polynomials

On Classifications of Random Polynomials

 Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...

Tutte Polynomials and Link Polynomials

We show how the Tutte polynomial of a plane graph can be evaluated as the "homfly" polynomial of an associated oriented link. Then we discuss some consequences for the partition function of the Potts model, the Four Color Problem and the time complexity of the computation of the homfly polynomial.

Chain polynomials and Tutte polynomials

The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c © 2002 Elsevier Science B.V. All rights reserved.

Chromatic polynomials of some nanostars

Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most  colours, which is for a fixed graph G , a polynomial in  , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.

Tutte Polynomials of Flower Graphs