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 ...

Combinatorial polynomials, such as the Tutte, U‐ and Schubert polynomials, complement this by systematically organising information about graphs and posets into polynomial expressions.

A robust procedure is developed for estimating density functions from data. It requires the existence of a parametric function, called the key function, to give a first approximation to the density ...