@article {IOPORT.01244209,
    author       = {Kalkbrener, M.},
    title        = {An upper bound on the number of monomials in determinants of sparse matrices with symbolic entries.},
    year         = {1997},
    journal      = {Mathematica Pannonica},
    volume       = {8},
    number       = {1},
    issn         = {0865-2090},
    pages        = {73-82},
    publisher    = {University of Miskolc, Miskolc},
    abstract     = {Summary: The objective of this paper is to gain some insight into how well sparsity is preserved under determinant computations. For a square matrix $A$ whose elements are indeterminates $x_1,\dots,x_n$ and zeros, the determinant $\det(A)$ is a polynomial in $x_1,\dots,x_n$ with integer coefficients. We derive an upper bound on the number of monomials in $\det(A)$ for a class of determinants which includes bigradients, Sylvester resultants and determinants of Toeplitz and Hankel matrices. Our approach is based on a result by Stanley in the theory of partially ordered sets.},
    identifier   = {01244209},
}