Session Proposals
We accept proposals for special sessions at ACA 2008. Session proposals must be sent to the conference chairs before June 1, 2008. Information on how to propose sessions is available at the ACA website.Session Schedule
Find here the session schedule.Accepted Sessions
 Symbolic and Algebraic Computation for Optimization Tasks in Science and Engineering (Chibisov, Ganzha, Mayr)
 Symbolic Symmetry Analysis and Its Applications (Bila, Kogan)
 Computer Algebra and Coding Theory (MartínezMoro, Ruano, Hernando)
 Nonstandard Applications of Computer Algebra (RoanesLozano, Wester, Steinberg)
 Computer Algebra in Education (Akritas, Wester, Kutzler, Pletsch)
 Computer Algebra for Dynamical Systems, and Celestial Mechanics (Edneral, Myllari, Vassiliev)
 Compact Computer Algebra (Smirnova, Watt)
 Algebraic and Algorithmic Aspects of Differential and Integral Operators (Regensburger, Rosenkranz, Tsarev)
 Gröbner Bases and their Applications (Arnold, Kotsireas, Rosenkranz)
 Interaction Between Computer Algebra and Interval Computations (Krämer, Popova)
 Symbolic Computation and Deduction in System Design and Verification (Anai, Kanno, SofronieStokkermans, Sturm)
 Symbolic Computation and Quantum Field Theory (Kauers, Schneider)
 Symbolic and Numeric Computation (Akritas, Kai, Sasaki, Shirayanagi, Stefanescu)
 Parallel Computer Algebra (Malaschonok)
 Computer Algebra in Group Theory and Representation Theory (Cohen, Vavilov, Wilson)
In order to contribute to one of the sessions, please contact the session organizers directly.
Session Title  Symbolic and Algebraic Computation for Optimization Tasks in Science and Engineering  
Session Organization 


Session Description  Various applications in robotics, manufacturing, molecular biology, nanotechnology, etc. involve optimization and optimal control with constraints given by algebraic and differential equations (both ODEs and PDEs). Especially in the case of differential constraints, the "naive" approaches combining numerical solvers for differential equations and optimization algorithms may lead to lack of robustness or be very inefficient.
In order to deal with real life applications stability and fast convergence of numerical methods have to be provided. However, research in this field is very much in progress, and many problems concerning both the theoretical foundations and practical issues remain open: existence of optimizers for underlying continuous problem and necessary optimality conditions, questions of stability and convergence for numerical methods, the interplay between discretization and optimization, etc. These issues require a wide range of mathematical disciplines (e.g. optimal control theory, functional analysis, numerical analysis, etc.) as well as engineering understanding in order to choose the appropriate mathematical model for the problem at hand. The goal of this session is to bring together mathematicians and engineers, who develop or use algebraic and numerical methods, to exchange ideas and views, and to present both original research results involving computer algebra as well as challenging directions and industrial applications. Possible topics for this session include (but are not limited to):

Session Title  Symbolic Symmetry Analysis and Its Applications  
Session Organization 


Session Description  Phenomena observed in nature often have symmetry properties. These
symmetry properties are inherited by the equations that model these
phenomena and can be exploited to either obtain explicit solutions, or
an important geometric information about the solution set.
Symmetry analysis links various research disciplines including
differential equations, differential and algebraic geometry, numerical analysis,
and symbolic computation. Over the years, new types of symmetries have been
studied, such as nonclassical symmetries, potential symmetries, and
generalized symmetries, and used to obtain new solutions of equations
arising in mathematical physics, mathematical biology, image processing,
engineering, and financial mathematics. Many, but far from all symmetry
reduction techniques have been implemented, and many theoretical and
computational open problems remain.
The aim of this special session is to bring together researchers
interested in symmetry analysis, symbolic computation, and their
applications.
Here is the link to the webpage for our session at ACA 2007. 
Session Title  Computer Algebra and Coding Theory  
Session Organization 


Session Description 
This is the fifth session (previous was held at ACA 2004, ACA 2005 with the
same title and senior organizer E. Martínez Moro and in ACA 2006, ACA 2007
were entitled "coding theory and cryptography" by T. Shaska) devoted to
providing a forum for exchange of ideas and research results related to
Computer Algebra, both theoretical and algorithmic treatment of all kinds of
symbolic objects, in application to Coding Theory. Nowadays errorcorrecting
codes are important from both a mathematicaltheoretical point of view and
practical reasons. Computer Algebra evolved linking algorithmic and abstract
algebra to methods of computer science, at the same time Coding Theory is a
branch of communication theory using algebraic and algorithmic theories. As a
result there is a mutual interest from both disciplines. Applications of
Computer Algebra to Coding Theory can be divided in two categories:
application at an experimental level and applications at a conceptual or
theoretical level. At this session we will be devoted to both approaches.
The organizers will invite the speakers maintain a web page describing the session with talk abstracts provided. The session will be held in three hour blocks of time, with nine 1/2 hour talks. Prospective and interested invited speakers could be (among others):

Session Title  Nonstandard Applications of Computer Algebra  
Session Organization 


Session Description  In many of the ACA conferences from 1996 onwards, we have chaired a session devoted to "Nonstandard Applications of Computer Algebra". The session traditionally collects contributions that, while using Computer Algebra techniques and/or Computer Algebra Systems, can not be easily allocated in the "standard" sessions. Examples of topics treated in papers presented in previous editions of the conference are: Verification and Development of Expert Systems (using algebraic techniques), Railway Traffic Control, Artificial Intelligence, Thermodynamics, Molecular Dynamics, Statistics, Electrical Networks, Logic, Robotics, Sociology ... 
Session Title  Computer Algebra in Education  
Session Organization 


Session Description 
Education has become one of the fastest growing application areas for
computers in general and computer algebra in particular. Computer
algebra tools such as the TI Voyage 200/TI89 Titanium, Axiom, Derive,
Maple, Maxima, Mathematica, MuPAD or Reduce, make powerful teaching
tools in mathematics, physics, chemistry, biology, economy, etc.
The goal of this session is to exchange ideas and experiences, to hear about classroom experiments, and to discuss all issues related with the use of computer algebra tools in classroom (such as assessment, change of curricula, new support material, ...) If you are interested in presenting a paper, please contact one of the organizers. 
Session Title  Computer Algebra for Dynamical Systems, and Celestial Mechanics  
Session Organization 


Session Description 
Celestial Mechanics and Dynamical Systems are traditional fields for applications of computer algebra. This session is intended to discuss Computer Algebra methods and modern algorithms in the study of general continuous and discrete Dynamical Systems, Ordinary Differential Equations and Celestial Mechanics.
The following topics, among others, will be considered:

Session Title  Compact Computer Algebra  
Session Organization 


Session Description 
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 clientside web application, certain applications of computer algebra require compact data representation, spaceefficient 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

Session Title  Algebraic and Algorithmic Aspects of Differential and Integral Operators  
Session Organization 


Session Description 
The algebraic treatment of differential equations is a wellestablished
field with close ties to the symbolic community (see also the ACA
Session "Symbolic Symmetry Analysis and its Applications"). Algebraic
methods often commence from an operator perspective on the underlying
differential equations, e.g. in DModule theory or in factoring linear
differential operators (ODE/PDE, scalar/vector). On the other hand,
integral operators have as yet received comparably little attention in
an algebraic setting. In the context of linear differential equations,
they arise naturally as Green's operators for initial/boundary value
problems.
In this session, we would like to examine various relations between differential and integral operators. To this end, we want to bring together the following topics and communities:
For the current list of speakers, please refer to the session webpage. 
Session Title  Gröbner Bases and their Applications  
Session Organization 


Session Description 
The theory of Groebner Bases is a cornerstone of Computer Algebra which
has also found (often unexpected) applications to a wide spectrum of areas
in Science and Engineering. All major computer algebra systems offer
Gröbner Bases functionalities, and powerful standalone implementations
are also available.
This session is intended to discuss recent theoretical and practical developments in the theory of Gröbner bases as well as applications of Gröbner bases to other fields. Research contributions as well as expository papers are solicited. For more information and/or to present a paper at the session, please contact the session organizers by email. This session is a continuation of a series of sessions on the theory of Gröbner bases and its applications organized at previous ACA conferences and other workshops. Session Topics inlcude (but are not limited to):

Session Title  Interaction Between Computer Algebra and Interval Computations  
Session Organization 


Session Description 
For many years there is a considerable interaction between symbolic
algebraic and resultverification methods. The usage of validated
computations at critical points of some algebraic algorithms improves
the stability of the complete solution. Several hybrid algorithms
using floatingpoint and/or interval arithmetic in intermediate
computations combine the speed of numerical computations with the
exactness of symbolic methods providing still guaranteed correct
results and a dramatic speed up of the corresponding algebraic
algorithm. Embedding of interval data structures, hybrid and result
verification methods in computer algebra systems turn the latter into
valuable tool for reliable scientific computing while by applying
symbolicalgebraic methods interval computations expand the
methodology tools and get an increased efficiency.
This special session continues the tradition established by previous conferences and special sessions (including e.g. the conferences Intervalxx, ACA 2000, ACA 2003 and ACA 2006 sessions) on interval and computeralgebraic methods in science and engineering. The aim is to bring together participants from diverse areas of mathematics, computer science, various life & engineering/science disciplines that will demonstrate the progress in the interaction between symbolic algebraic and resultverification methods. The meeting goal is to stimulate the communication, coordination, integration, and cross fertilization of ideas capable to meet the research challenges.

Session Title  Symbolic Computation and Deduction in System Design and Verification  
Session Organization 


Session Description 

Session Title  Symbolic computation and quantum field theory  
Session Organization 


Session Description 
Feynman parameter integrals play an important role in perturbative quantum theory. Depending on the massscale parameters of the problem
and the number of external invariants, these multiple integrals can be written in Mellin space, e.g., in terms of generalized hypergeometric multisums.
Then the resulting sum expressions in terms of e (the divergent integrals are regularized by analytical continuation of the spacetime to the dimension 42e
for a small parameter e) and of the Mellin parameter N are considered in its Laurent series expansion w.r.t. e. For instance, in single scale problems up to loop
order 3 the coefficients of the corresponding Laurent expansion can be simplified to closed form in terms of nested harmonic sums.
Within the physics community, highly specialized efficient algorithms and software, like Vermaseren's package SUMMER implemented in FORM,
have been developed for carrying out these computations for the sum expressions. Mostly independent of these developments, algorithms for symbolic summation and integration have ever since been subject to research in computer algebra. Today, a fairly far developed algebraic summation and integration theory is available which gives rise to algorithms applicable to to a wide class of problems. Implementations of these algorithms are also available and these have been able to discover and/or prove many deep identities in special functions and combinatorics in the past. It turns out that the more general algorithms arising from this research can also be successfully applied in particle physics. In the session, we want to bring together people from both sides, to present the different techniques, and to discuss possible combinations that may help in handling challenging problems from quantum field theory. 
Session Title  Symbolic and Numeric Computation  
Session Organization 


Session Description 
Symbolic and Numeric Computation or Approximate Algebraic Computation,
is now one of the main streams of current computer algebra. Even so,
only relatively few fundamental algebraic operations have been studied
so far, and many applications have been left untouched. Researchers
continue to study many more algebraic operations from the viewpoint
of approximate computation, to take advantage of the fusion of
symbolic and numeric computations, and to apply approximate algebraic
algorithms to science and technology.
Research contributions as well as expository papers are welcomed. For more information please contact the session organizers by email. This session covers the following topics, but is not restricted to these.

Session Title  Parallel Computer Algebra  
Session Organization 


Session Description 
The goal of the session is to provide a forum for developers of parallel methods,
algorithms and software in the field of Computer Algebra.

Session Title  Computer Algebra in Group Theory and Representation Theory  
Session Organization 


Session Description 
For the last decades several directions of group
theory critically depend on the power of symbolic
calculation. This is especially the case for the
study of finite simple groups and algebraic groups,
combinatorial group theory, and representation theory,
but the influence of computer algebra rapidly
expands into other branches of group theory.
Several highly efficient specialised systems have been created and grouptheory oriented packages within general purpose CAS have been developed over the last years. The purpose of the section is to exchange ideas and experience and discuss recent progress in applying computer tools to the study of deep and difficult problems of group theory, representation theory and Lie theory. In fact, applications to group theory and representation theory are (alongside with algebraic geometry and commutative algebra, and number theory), among the most significant applications of computers in mathematics. Computer algebra aspects of the following topics, among others, will be considered:
Submission of talk title and abstract: June 15, 2008. 