Recently, in a work that grew out of their exploration of interlacing polynomials, Marcus, Spielman and Srivastava and then Marcus studied certain combinatorial polynomial convolutions. These convolutions preserve real-rootedness and capture expectations of characteristic polynomials of unitarily invariant random matrices, thus providing a link to free probability. We explore analogues of these types of convolutions in the setting of max-plus algebra. In this setting the max-permanent replaces the determinant and the maximum is the analogue of the expected value. Our results resemble those of Marcus et al., however, in contrast to the classical setting we obtain an exact and simple description of all roots.
- Max-plus algebra
- Maxplus polynomial convolution
- Maxplus characteristic polynomial
- Hadamard product