Acknowledgement
Supported by : National Research Foundation of Korea (NRF)
References
- J. Ahn, The degree-complexity of the defining ideal of a smooth integral curve. J. Symbolic Comput. 43 (2008), no. 6-7, 422-441. https://doi.org/10.1016/j.jsc.2007.07.008
- D. Bayer and D. Mumford, What can be computed in algebraic geometry? Computational algebraic geometry and commutative algebra (Cortona, 1991), 1-48, Sympos. Math., XXXIV, Cambridge Univ. Press, Cambridge, 1993.
- D. Cox, J. Little, and D. O'Shea, Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra. Second edition. Undergraduate Texts in Mathematics. Springer-Verlag, New York, 1997.
- D. Cox, J. Little, and D. O'Shea, Using algebraic geometry. Graduate Texts in Mathematics, 185. Springer-Verlag, New York, 1998.
- A. Conca and J. Sidman, Generic initial ideals of points and curves. J. Symbolic Comput. 40 (2005).
- D. Eisenbud, The geometry of syzygies. A second course in commutative algebra and algebraic geometry. Graduate Texts in Mathematics, 229. Springer-Verlag, New York, 2005.
- D. Eisenbud, Commutative algebra with a view toward algebraic geometry, Graduate Texts in Mathematics, 150. Springer-Verag, New York, 1995.
- D. Eisenbud and S. Goto. Linear free resolutions and minimal multiplicity, J. Algebra 88, 1984, 89-133. https://doi.org/10.1016/0021-8693(84)90092-9
- M. Green, Generic Initial Ideals, in Six lectures on Commutative Algebra, (Elias J., Giral J.M., Miro-Roig. R.M., Zarzuela S., eds.), Progress in Mathematics 166, Birkhauser, 1998, 119-186.
- M. Haiman, Hilbert schemes, polygraphs and the Macdonald positivity conjec- ture, J. Amer. Math. Soc. 14 (2001), 941-1006 https://doi.org/10.1090/S0894-0347-01-00373-3