Sciweavers

COMBINATORICS
1999
91views more  COMBINATORICS 1999»
14 years 3 days ago
A Criterion for Unimodality
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.
George Boros, Victor H. Moll
JCT
2000
81views more  JCT 2000»
14 years 7 days ago
Generalized Rook Polynomials
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...
Jay Goldman, James Haglund
JC
2000
138views more  JC 2000»
14 years 7 days ago
Multivariate Polynomials, Duality, and Structured Matrices
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...
Bernard Mourrain, Victor Y. Pan
JACM
2000
119views more  JACM 2000»
14 years 7 days ago
A subdivision-based algorithm for the sparse resultant
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...
John F. Canny, Ioannis Z. Emiris
CSL
2002
Springer
14 years 7 days ago
On the Automatizability of Resolution and Related Propositional Proof Systems
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 ...
Albert Atserias, Maria Luisa Bonet
EJC
2000
14 years 7 days ago
Further Investigations Involving Rook Polynomials With Only Real Zeros
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 ...
James Haglund
ADCM
2000
61views more  ADCM 2000»
14 years 8 days ago
Asymptotic convergence of degree-raising
It is well known that the degree-raised Bernstein-B
Michael S. Floater, Tom Lyche
VC
2008
102views more  VC 2008»
14 years 9 days ago
Solving nonlinear polynomial systems in the barycentric Bernstein basis
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...
JSC
2007
80views more  JSC 2007»
14 years 9 days ago
Improved dense multivariate polynomial factorization algorithms
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-...
Grégoire Lecerf
TSP
2008
118views more  TSP 2008»
14 years 10 days ago
Approximating Functions From Sampled Fourier Data Using Spline Pseudofilters
Recently, new polynomial approximation formulas were proposed for the reconstruction of compactly supported piecewise smooth functions from Fourier data. Formulas for zero and firs...
Ana Gabriela Martínez, Alvaro R. De Pierro