We show that if P(x) is a polynomial with nondecreasing, nonnegative coefficients, then the coefficient sequence of P(x + 1) is unimodal. Applications are given.
Generalizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are establishedwith absolu...
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
We study the zeros of two families of polynomials related to rook theory and matchings in graphs. One of these families is based on the cover polynomial of a digraph introduced by ...
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
Martin Reuter, Tarjei S. Mikkelsen, Evan C. Sherbr...
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...