통합자연과학논문집 (Journal of Integrative Natural Science)

조선대학교 기초과학연구원 (The Basic Science Institute Chosun University)
권호 표지
DOI QR코드

DOI QR Code

어떤 최대최소문제들에 대한 컴퓨터대수체계(CAS)의 이용

How to Use CAS to Solve Certain Minmax Problems

  • 투고 : 2010.12.09
  • 심사 : 2010.12.23
  • 발행 : 2010.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we study how to use CAS to solve certain minmax problems. More specifically, we reduce some to the problems about the packing of certain convex sets in the plane, and use Recognize algorithm to obtain good hypotheses for results. This method can be widely used to solve same types of mathematical problems.

키워드

참고문헌

  1. D. Cox, J. Little, and D. O'Shea, "Ideals, Varieties, and Algorithms", 2nd edition, Springer-Verlag, New York, 1996
  2. D. Cox, J. Little, and D. O'Shea, "Using Algrbraic Geometry", Springer-Verlag, New York, 1998
  3. S. H. Kim, "Planar packings and mappings related to certain minmax problems", Math. Inequal. Appl., Vol. 6, no 2, pp.351-374, 2003.