Symbolic computation of Appell polynomials using Maple.
Alkahby, H., Ansong, G., Frempong-Mireku, P., Jalbout, A. (2001)
Electronic Journal of Differential Equations (EJDE) [electronic only]
Similarity:
Displaying similar documents to “Remarks on some recent results about polynomials with restricted zeros”
Symbolic computation of Appell polynomials using Maple.
Non-symmetric Hall-Littlewood polynomials.
Descouens, François, Lascoux, Alain (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Ruscheweyh differential operator sets of basic sets of polynomials of several complex variables in hyperelliptical regions.
Hassan, G.F. (2006)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Kazhdan-Lusztig polynomials: history, problems, and combinatorial invariance.
Brenti, Francesco (2002)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On certain formulas of Karlin and Szegö.
Leclerc, Bernard (1998)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On real polynomials without nonnegative roots.
Brunotte, Horst (2009)
Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]
Similarity:
Bernstein quasianalytic functions on algebraic sets.
Skiba, Alicja (2003)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Some orthogonal polynomials in four variables.
Dunkl, Charles F. (2008)
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]
Similarity:
Noncommutative analogs of symmetric polynomials
Maciej Burnecki (1993)
Colloquium Mathematicae
Similarity:
The special function ش , II
Andrea Ossicini (2006)
Kragujevac Journal of Mathematics
Similarity:
Location of the critical points of certain polynomials
Somjate Chaiya, Aimo Hinkkanen (2013)
Annales UMCS, Mathematica
Similarity:
Let D¯ denote the unit disk {z : |z| < 1} in the complex plane C. In this paper, we study a family of polynomials P with only one zero lying outside D¯. We establish criteria for P to satisfy implying that each of P and P' has exactly one critical point outside D¯.
Skew divided difference operators and Schubert polynomials.
Kirillov, Anatol N. (2007)
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]
Similarity:
On the computation of the GCD of 2-D polynomials
Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis (2007)
International Journal of Applied Mathematics and Computer Science
Similarity:
The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.