The ACA meetings are organized as a series of Special Sessions.
The Special Sessions proposals for the ACA 2014 Conference should be submitted to the Program Chairs of the Conference, Ilias Kotsireas and Tony Shaska.
Edgar Martnez-Moro
Institute of Mathematics Universidad de
Valladolid, Spain
http://www.singacom.uva.es/~edgar
edgar@maf.uva.es
Steve Szabo
Eastern Kentucky University,
Department of Mathematics and Statistics,
Richmond, KY, USA
Steve.Szabo@eku.edu
See the home page for this session.
This is the first edition of a special session at ACA conference devoted
to providing a forum for exchange of ideas and research results related
to Computer Algebra Aspects of Finite Rings in a broad sense and also to
their applications.
Session topics will include (but are not limited to) the following:
1) Computer Algebra and Finite Rings
Computer representation and computation over finite rings and polynomial
rings over finite rings. C.A. software and development of packages
devoted to finite rings and related structures ...
2) Applications of Finite Rings
Applications to Combinatorics, Finite Geometries, Analysis of
Algorithms, Algebraic Cryptography and Coding Theory, Linear and
Polylinear Recurrence Sequences ...
It is planned to have 6-10 1/2 hour contributed talks in the session..
The submitted extended abstracts will be reviewed for soundness and
relevance to the session. Authors of the extended abstracts accepted
will be invited to submit their full revised papers for publication in a<
special issue of some mayor journal related to the topic.
Edgar Martnez-Moro
Institute of Mathematics Universidad de
Valladolid, Spain
http://www.singacom.uva.es/~edgar
edgar@maf.uva.es
Ilias Kotsireas
Wilfrid Laurier University,
Department of Physics and Computer
Science, Waterloo, Ontario, Canada
http://www.wlu.ca/science/physcomp/kotsireas/
ikotsire@wlu.ca
Steve Szabo
Eastern Kentucky University,
Department of Mathematics and Statistics,
Richmond, KY, USA
Steve.Szabo@eku.edu
See the home page for this session.
This is the ninth edition of this well established special session at
ACA conference 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 and Cryptography.
Session topics will include (but are not limited to) the following:
1) Computer Algebra in Coding Theory
Applications of the methods of applied algebraic geometry to coding
theory including decoding algorithms, combinatorial
constructions of codes, search of optimal codes ...
2) Computer Algebra in Cryptography
Algebraic cryptoanalysis. Post quantum, hash-based and lattice-based
cryptography. Multivariate PKC...
3) Interactions between Coding, Crypto and C.A.
Secret sharing schemes. Steganography. Code-based cryptography...
It is planned to have 12 1/2 hour contributed talks in the session. The
submitted extended abstracts will be reviewed for soundness and
relevance to the session. Authors of the extended abstracts accepted
will be invited to submit their full revised papers for publication in a
special issue of some mayor journal related to the topic.
This session will cover a wide range of topics in differential and
difference algebra, from differential/difference elimination and
Nullstellensatz to the Galois theory of differential and difference
equations with parameters, with emphasis on algorithms, including new
algorithms, new theory that will lead to new algorithms in the future,
and complexity estimates of existing algorithms.
See the home page for this session.
This session has a satellite conference in Manhattan both before and after the ACA Conference. See this web site.
Contact information:
Alexey Ovchinnikov
Department of Mathematics
CUNY Queens College
65-30 Kissena Blvd, Queens, NY 11367
aovchinnikov@qc.cuny.edu
See the home page for this session.
The homepage for the 2013 session with the scope and links to previous sessions can be found at
http://www.kent.ac.uk/smsas/personal/mgr/aadios2013/
and for the post-proceedings that we will soon publish in the LNCS Springer series, see
http://www.ricam.oeaw.ac.at/conferences/aca12/lncs.html
Thank you for your interest and best regards,
Moulay Barkatou, Thomas Cluzeau, Georg Regensburger, and Markus Rosenkranz
Although indefinite integration is a well-studied area, new techniques
are still being developed. In addition, these new techniques allow new
applications. For example, the correct integration of piecewise defined
functions and discontinuous functions allows us to solve differential
equations containing discontinuous effects.
This session will offer a venue for developers and users to discuss
principles, techniques and examples.
One main hope for this session is to create a forum for participants in
Albert Rich's "Rubi" integration project. This project has shown that
great improvements in the performance of integration systems are still
possible. The developers have been interacting through email and on-line
discussions until now. We hope to get them together in one room to
discuss progress. There are other groups working on integration. An
example is Victor Moll's book "Irresistible integrals". If we can
attract more interest, then an interesting session will result.
There will be an overlap with the educational session (assuming this
session runs again), because problems such as a parachutist falling and
then opening a parachute are examples of educational problems that have
been discussed in previous ACA meetings.
Organizers: David Jeffrey, Michael Wester and Michel Beaudin,
http://www.apmaths.uwo.ca/people/djeffrey.shtml
https://cours.etsmtl.ca/seg/mbeaudin/
Alkis Akritas, University of Thessaly, Greece
Michael Wester, University of New Mexico, USA
Jose Luis Galan Garcia, Universidad de Malaga, Spain
Michel Beaudin, ETS, Canada
Agustín de la Villa, Universidad Pontificia Comillas de Madrid, Spain
Gerardo Rodriguez, Universidad de Salamanca, Spain
See the home page for this session.
Overview:
Education has become one of the fastest growing application areas for computers
in general and computer algebra in particular. Computer Algebra Systems (CAS)
make for powerful teaching and learning tools within mathematics, physics,
chemistry, biology, economics, etc. Among them are:
(a) the commercial "heavy weights" such as Casio ClassPad 330, Derive, Magma,
Maple, Mathematica, MuPAD, TI NSpire CAS, and TI Voyage 200, and
(b) the free software/open source systems such as Axiom, Euler, Fermat,
wxMaxima, Reduce, and the rising stars such as GeoGebra, Sage, SymPy and Xcas
(the swiss knife for mathematics).
The goal of this session is to exchange ideas, discuss classroom experiences, and to explore significant issues relating to CAS
tools/use within education. Subjects of interest for this session will include new CAS-based teaching/learning strategies,
curriculum changes, new support materials, assessment practices from all scientific fields, and experiences of joint use of
applied mathematics and CAS.
Keywords: curves, surfaces, algebraic varieties, computer algebra, algorithmic treatment, applications.
See the home page for this session.
The geometry of algebraic curves and surfaces is a subject of major interest
in many different research fields as Algebraic Geometry, Computer Algebra,
Geometric Design, etc. On one hand, despite its apparent simplicity compared
to varieties of a higher dimension, algorithmic and theoretical questions on these
kinds of varieties go on and on. On the other hand, the study of curves
and surfaces has a great practical value because of its applications in fields such
as Computer Aided Geometric Design, Computer Vision, Coding Theory, etc.
The goal of this session is to bring together specialists of the areas mentioned
above so that they can present their current research on the topic, discuss on
the state of the art, and benefit from the perspective of other people working
on similar questions.
Information on the organizers:
Juan G. Alc'azar, Dpto. Fisica y Matematicas, Universidad de Alcal'a
(Facultad de Ciencias), Campus Universitario, Ctra. Madrid-Barcelona Km
33,600. E-28871 Alcal'a de Henares (Madrid), Spain.
E-mail address: juange.alcazar@uah.es
Sonia L. Rueda, Dpto. de Matematica Aplicada, E.T.S. Arquitectura,
Universidad Politecnica de Madrid, Avda. Juan de Herrera 4, 28040-Madrid,
Spain.
E-mail address: sonialuisa.rueda@upm.es
J. Rafael Sendra, Dpto. Fisica y Matematicas, Universidad de Alcal'a (Facultad de Ciencias), Campus Universitario, Ctra. Madrid-Barcelona Km 33,600. E-28871 Alcal'a de Henares (Madrid), Spain. E-mail address: rafael.sendra@uah.es
This session invites contributions on applications in areas not covered by the other sessions. Presentations on
challenges emerging in applications that lead to open problems in computer algebra are encouraged. Consequently, this
session will provide a forum for identifying new trends for the application of computer algebra and for theoretical
investigations. Past conferences included presentations on a variety of innovative topics, such as simulating car
traffic, designing rotating schedules for workers, determining flexibility of geometric structures. Similarly, this
session is looking for new applications that potentially raise open questions in computer algebra.
See the home page for this session.
Manfred Minimair, Department of Mathematics and Computer Science, Seton Hall University, New Jersey, USA.
E-mail address: manfred.minimair@shu.edu
Arithmetic geometry is the study of the solutions in k^n of a system of polynomials in n variables with coefficients in a ring k where k=Z, Q, Z/pZ, or a Dedekind domain.
The subject is a combination of algebraic number theory, commutative algebra, and algebraic geometry. During the last 30-40 years the subject has seen many developments
both theoretical and computational. In this section we intend to bring together experts in the area provide survey talks on the subject and recent developments.
Computational aspects of arithmetic geometry and applications in cryptography and coding theory will be encouraged.
See the home page for this session.
Topics of the session include, but are not limited to:
Integral extensions and integral closure
Algebraic curves
Jacobians of algebraic curves, rational torsion points in the Jacobian etc.
Computational number theory, rational points on curves
Curves defined over Q
Minimal discriminants and conductors
Selmer groups in Jacobians
Arithmetic invariant theory
The arithmetic of hyperelliptic curves
Pairings and Weil descent
Mordell-Weil group
Arithmetic Mirror Symmetry
See the home page for this session.
This session is on group actions in algebra and geometry.
This would include representation theory of Lie
groups, representation theory of finite groups, and invariant theory.
Symmetries in geometric spaces or in algebraic systems of
equations often lead to algorithms that allow us to compute
complicated, interesting examples that would otherwise be intractable.
This session will explore the interplay between representation
theory and algebraic geometry and some algebraic and algorithmic
questions that result.
Some people who said they would attend are:
Federico Galetto (Queens)
Nathan Ilten (Berkeley)
Han-Bom Moon (Fordham)
sciences, engineering, industry, communications, business, computer
science, physics and other areas.
- Submissions on the computational aspects of algebraic topology are particularly encouraged.
Christian Eder (University of Kaiserslautern, Germany) ederc@mathematik.uni-kl.de
Jean-Charles Faugère (UPMC, INRIA PolSys Team, Paris, France) Jean-Charles.Faugere@inria.fr
Michael Stillman (Cornell University, Ithaca, NY, US) mike@math.cornell.edu
See the home page for this session.
Gröbner bases are a fundamental tool in computer algebra with many applications in various areas. In 1965 Buchberger introduced a first algorithmic approach for their computation. For many high-level computer algebra algorithms Gröbner bases act as building blocks. Over the years many improvements and optimizations on the theory of Gröbner bases, but also advances in computer science and hardware, led to efficient implementations. Moreover, Göbner bases have various applications, for example, in the fields of robotics and cryptography that underline the importance of this field of computational algebra. The aim of this session is to gather researchers with an interest in the theory of Gröbner bases as well as those focussing on efficient implementations. We explicitly encourage submissions on computational aspects.
SESSION TOPICS will include (but are not limited to) the following:
- All aspects of new advances in computing Gröbner bases, for example
- F5-like resp. signature-based algorithms
- specialized linear algebra
- advances in parallel implementations
- exploitation of algebraic structures
- computations and utilizations of syzygies
- Recent results in complexity theory on (specialized) Gröbner basis computations
- Actual applications that demonstrate the efficiency of Gröbner bases for specific problem solving