Compact Computer Algebra

A few decades ago, minimizing resource use was a crucial factor in the development of any computer algebra software. Many successful systems were born under these conditions, including CAMAL, Maple, Derive and Macaulay as examples. Since then, hardware improvements have pushed the concern of base resource requirements into the background: the user interfaces to modern systems typically require more resources to launch than the algebra engine, and algorithm implementation often focuses on the complexity to solve very large problems.

The art of compact computer algebra is becoming again increasingly important. New directions for symbolic computing include the migration from workstations to handheld devices and the changing role from standalone applications to lightweight services within integrated systems. Whether running on a graphing calculator or as support of a client-side web application, certain applications of computer algebra require compact data representation, space-efficient algorithms and effective memory management.

The purpose of this session is to communicate efforts in research, design, development and application of compact computer algebra. We invite contributions in all aspects of this area, including, but not limited to

• math education tools (eg. Derive, TI-Nspire, Class-Pad, HP 50g),
• portable and Internet-accessible symbolic calculators (eg. Mate, Symbolic Calculator),
• CAS for personal digital assistants (eg. AsirPad).
• "spell checkers" for math content in document processing software
• validators for online and offline mathematical recognizers
• backend engines to pen-computing interfaces
• math editing components for 2D expression

• David R. Stoutemyer
  Department of Information and Computer Science, U. of Hawaii
  Some Ways to Implement Computer Algebra Compactly [abstract]

• Mitsushi Fujimoto
  Department of Mathematics, Fukuoka U. of Education
  On the User Interface of AsirPad -- a Pen-based CAS for PDA [abstract]

• Michael Monagan
  Department of Mathematics, Simon Fraser U.
  How fast can we multiply and divide sparse polynomials? [abstract]

• Chris DeSalvo
  SpaceTime Mathematics
  Computer algebra for mobile devices in the real world [abstract]

If you are interested in presenting your work at CCA, please visit Call for Papers and Software Demos page for instructions on submission for contributions.

Important Dates

Abstracts Due	-- June 30
Conference	-- July 27-30
Compact Computer Algebra Session	-- July 29

09:00 - 09:05	Elena Smirnova	Session opening and welcome	photo
09:05 - 10:00	David R. Stoutemyer	Some Ways to Implement Computer Algebra Compactly (invited)	photo
10:00 - 10:30	David J. Jeffrey	Two for One. LU matrix factors and Moore-Penrose inverse.	photo
10:30 - 11:00	Coffee break
11:00 - 12:00	Michael Monagan	How fast can we multiply and divide sparse polynomials? (invited)	photo
12:00 - 13:30	Lunch		photo
13:30 - 14:30	Plenary Talk		photo
14:30 - 14:50	Coffee break
14:50 - 15:20	Akira Suzuki	Implementation of CGS on small devices	photo
15:20 - 16:15	Mitsushi Fujimoto	On the User Interface of AsirPad -- a Pen-based CAS for PDA (invited)	photo
16:15 - 16:45	Stephen M. Watt	Compact Representation and Recognition for Handwritten Mathematical Characters	photo
16:45 - 17:00	Break
17:00 - 17:55	Chris DeSalvo	Computer algebra for mobile devices in the real world (invited)	photo
17:55 - 18:25	Hiroshi Kai	A MathML content markup editor on the xfy	photo
(paper)	Fred Gustavson & Tadeusz Swirszcz	In-Place Transposition of Rectangular Matrices

• Elena Smirnova
  Education Technology, Texas Instruments, Canada
  
  
  
• Stephen M. Watt
  Ontario Research Centre for Computer Algebra, U of Western Ontario, Canada