Text only print
Full screen print
Seminar on Geometric Complex Analysis
Seminar information archive ～05/01｜Next seminar｜Future seminars 05/02～
| Date, time & place | Monday 10:30 - 12:00 128Room #128 (Graduate School of Math. Sci. Bldg.) |
|---|---|
| Organizer(s) | Kengo Hirachi, Shigeharu Takayama |
2024/06/10
10:30-12:00 Room #128 (Graduate School of Math. Sci. Bldg.)
Katsusuke Nabeshima (Tokyo Univ. of Science)
Computing Noetherian operators of polynomial ideals
--How to characterize a polynomial ideal by partial differential operators -- (Japanese)
https://forms.gle/gTP8qNZwPyQyxjTj8
Katsusuke Nabeshima (Tokyo Univ. of Science)
Computing Noetherian operators of polynomial ideals
--How to characterize a polynomial ideal by partial differential operators -- (Japanese)
[ Abstract ]
Describing ideals in polynomial rings by using systems of differential operators in one of the major approaches to study them. In 1916, F.S. Macaulay brought the notion of an inverse system, a system of differential conditions that describes an ideal. In 1937, W. Groebner mentioned the importance of the Macaulay's inverse system in the study of linear differential equations with constant coefficient, and in 1938, he introduced differential operators to characterize ideals that are primary to a rational maximal ideal. After that the important results and the terminology came from L. Ehrenpreise and V. P. Palamodov in 1961 and 1970, that is the characterization of primary ideals by the differential operators. The differential operators allow one to characterize the primary ideal by differential conditions on the associated characteristic variety. The differential operators are called Noetherian operators.
In this talk, we consider Noetherian operators in the context of symbolic computation. Upon utilizing the theory of holonomic D-modules, we present a new computational method of Noetherian operators associated to a polynomial ideal. The computational method that consists mainly of linear algebra techniques is given for computing them. Moreover, as applications, new computational methods of polynomial ideals are discussed by utilizing the Noetherian operators.
[ Reference URL ]Describing ideals in polynomial rings by using systems of differential operators in one of the major approaches to study them. In 1916, F.S. Macaulay brought the notion of an inverse system, a system of differential conditions that describes an ideal. In 1937, W. Groebner mentioned the importance of the Macaulay's inverse system in the study of linear differential equations with constant coefficient, and in 1938, he introduced differential operators to characterize ideals that are primary to a rational maximal ideal. After that the important results and the terminology came from L. Ehrenpreise and V. P. Palamodov in 1961 and 1970, that is the characterization of primary ideals by the differential operators. The differential operators allow one to characterize the primary ideal by differential conditions on the associated characteristic variety. The differential operators are called Noetherian operators.
In this talk, we consider Noetherian operators in the context of symbolic computation. Upon utilizing the theory of holonomic D-modules, we present a new computational method of Noetherian operators associated to a polynomial ideal. The computational method that consists mainly of linear algebra techniques is given for computing them. Moreover, as applications, new computational methods of polynomial ideals are discussed by utilizing the Noetherian operators.
https://forms.gle/gTP8qNZwPyQyxjTj8
