Computing curves bounding trigonometric planar maps: symbolic and hybrid methods

  • Authors:
  • Daniel Lichtblau

  • Affiliations:
  • Wolfram Research, Inc., Champaign, IL

  • Venue:
  • ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

A few years ago S-H Kim investigated some problems at the boundary of number theory, optimization, and geometry. One question regarded an optimal packing of certain “triangular oval” planar curves and another looked at some related transformations of ℝ2 to ℝ2. These were investigated primarily using tools from calculus but it turns out that computational algebra methods may instead be employed to particular advantage. Moreover, generalizations that are beyond the reach of such methods are still amenable to hybrid approaches using numeric and symbolic methods in tandem. We introduce some of the specific problems and generalizations, and show by detailed example how such techniques may be implemented and deployed.