Double Sylvester sums for subresultants and multi-Schur functions

Journal of Symbolic Computation

Volumn 35, Issue 6, 2003, Pages 689-710

  Lascoux, Alain ^a   Pragacz, Piotr ^b  

^a CNRS   (France)

^b INSTITUTE OF MATHEMATICS   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037939770     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00038-5     Document Type: Article

References (36)

1. Akyildiz, E., Carrell, J.B., 1987. An algebraic formula for the Gysin homomorphism from G / B to G / P. Illinois J. Math. 31, 312-320.
2. Borchardt, C.W., 1860. Über eine Interpolationsformel für eine Art symmetrischer Functionen und über deren Anwendung. Math. Abh. der Akademie der Wissenschaften zu Berlin, 1-20.
3. Brion, M., 1996. The push-forward and Todd class of flag bundles. In: Pragacz, P. (Ed.), Parameter Spaces, (Volume 36 in series). Banach Center Publications, Warsaw, pp. 45-50.
4. Brown, W.S., 1971. On Euclid's algorithm and the computation of polynomial greatest common divisors. J. Assoc. Comp. Mach. 18, 476-504.
5. Brown, W.S., Traub, J.F., 1971. On Euclid's algorithm and the theory of subresultant. J. Assoc. Comp. Mach. 18, 505-514.
6. Chardin, M., 1991. Differential resultants and subresultants, In: Fundamentals of Computation Theory (Gosen, 1991), Springer Lecture Notes in Computer Science, vol. 529. pp. 180-189.
7. Collins, G.E., 1967. Subresultants and reduced polynomial remainder sequences. J. Assoc. Comp. Mach. 14, 128-142.
8. Collins, G.E., 1973. Computer algebra of polynomials and rational functions. Amer. Math. Monthly 80, 725-755.
9. Collins, G.E., 1975. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In: Automata Theory and Formal Languages (Kaiserslautern, 1975), Springer Lecture Notes in Computer Science, vol. 33. pp. 134-183.
10. Gonzales, L., Lombardi, H., Recio, T., Roy, M.-F., 1990. Spécialisation de la suite de Sturm et sous-résultants, Preprint 1990-8. Department of Mathematics, Statistics and Computation, University of Cantabria.
11. Hong, H., 1997. Subresultants under composition. J. Symbolic Comput. 23, 355-366.
12. Hong, H., 2001. Ore subresultant coefficients in solutions. Appl. Algebra Engrg. Comm. Comput. 5, 421-428.
13. Jacobi, C.G.J., 1969. Additamenta ad commentationem quae inscripta est: Disquisitiones analyticae de fractionibus simplicibus, Gessammelte Werke, Chelsea reprint, pp. 553-582.
14. Jouanolou, J.-P., 1991. Le formalisme du résultant. Adv. Math. 90, 117-263.
15. Jouanolou, J.-P., 1995-96. Unpublished notes from the course on elimination theory at L. Pasteur University in Strasbourg.
16. Józefiak, T., Lascoux, A., Pragacz, P., 1982. Classes of determinantal varieties associated with symmetric and skew-symmetric matrices. Math. USSR Izv. 18, 575-586.
17. Lascoux, A., 1975. Fonctions de Schur et Grassmanniennes. C. R. Acad. Sci. Paris 281, 813-815, 851-854.
18. Lascoux, A., 1986. La résultante de deux polynômes. In: Malliavin, M.-P. (Ed.), Séminaire d' Algèbre Dubreil-Malliavin 1985, Springer Lecture Notes in Mathematics, vol. 1220. pp. 56-72.
19. Lascoux, A., 1990a. Diviser!. In: Lothaire, (Ed.), Mots. Hermes, Paris, pp. 221-231.
20. Lascoux, A., 1990b. Wroński's factorization of polynomials. In: Balcerzyk, S. et al. (Eds.), Topics in Algebra, (Volume 26(2) in series). Banach Center Publications, Warsaw, pp. 379-386.
21. Lascoux, A., Schützenberger, M.-P., 1985. Formulairé raisonné de fonctions symétriques. Université Paris 7.
22. Lascoux, A., Schützenberger, M.-P., 1987. Symmetrizing operators on polynomial rings. Funct. Anal. Appl. 21, 77-78.
23. Li, Z., 1998. A subresultant theory for Ore polynomials with applications. In: ISSAC, Proceedings of International Symposium on Symbolic and Algebraic Computation, pp. 132-139.
24. Lombardi, H., Roy, M.-F., El Din, M.S., 2000. New structure theorem for subresultants. J. Symbolic Comput. 29, 663-689.
25. Loos, R.G.K., 1982. Generalized polynomial remainder sequences. In: Buchberger, R. et al. (Eds.), Computer Algebra, Symbolic and Algebraic Computation. Springer-Verlag, Vienna, New York, pp. 115-137.
26. Newton, I., 1687. Philosophiæ Naturalis Principia Mathematica. London.
27. Pragacz, P., 1987. A note on elimination theory. Indag. Math. (N.S.) 49, 215-221.
28. Pragacz, P., 1991. Algebro-geometric applications of Schur S- and Q-polynomials. In: Malliavin, M.-P. (Ed.), Séminaire d'Algèbre Dubreil-Malliavin 1989-1990, Springer Lecture Notes in Mathematics, vol. 1478. pp. 130-191.
29. Pragacz, P., 1996. Symmetric polynomials and divided differences in formulas of intersection theory. In: Pragacz, P. (Ed.), Parameter Spaces, (Volume 36 in series). Banach Center Publications, Warsaw, pp. 125-171.
30. Salmon, G., 1885. Modern Higher Algebra. Chelsea Publishing Company, New York.
31. Shen, B.Z., 1992. Solving a congruence on a graded algebra by a subresultant sequence and its application. J. Symbolic Comput. 14, 505-522.
32. Sylvester, J.J., 1839. On rational derivation from equations of coexistence. Philosophical Magazine XV, 428-435. Also: Complete Works, Chelsea reprint, vol. 1, paper 7, pp. 40-46.
33. Sylvester, J.J., 1840. Note on elimination. Philosophical Magazine XVII, 379-380. Also: Complete Works, Chelsea reprint, vol. 1, paper 10, p. 58.
34. Sylvester, J.J., 1853. A theory of the syzygetic relations of two rational integral functions. Philosophical Transactions of the Royal Society of London CXLIII, Part III, 407-548. Also: Complete Works, Chelsea reprint, vol. 1, paper 57, pp. 429-586.
35. Trudi, N., 1862. Teoria di Determinanti. Napoli.
36. Hoene-Wroński, J.M., 1815-17. Philosophie de la Technie Algorithmique: Loi Suprême et Universelle; Réforme des Mathématiques. Paris.