ACA'2020 Session: Algorithmic Combinatorics

ACA'2020: Home, Sessions

Organizers

Aims and Scope

The interplay between computer algebra and combinatorics has been very fruitful for many years and can be subsumed under the name "algorithmic combinatorics", which nowadays is a well-established research area. It is one of the many success stories concerning the applications of computer algebra, and it perfectly demonstrates how two scientific disciplines can interact and inspire each other: on the one hand, combinatorialists appreciate the power of computer algebra systems, and on the other hand, problems from combinatorics are one of the driving forces for the development of new computer algebra algorithms and packages.

Examples include the enumeration of different types of lattice walks, the study of symmetry classes of plane partitions and alternating sign matrices, various types of tiling problems in the plane, the counting of lattice points in polytopes and the computation of Ehrhart polynomials, partition analysis and q-identities, graph theory, and pattern avoidance questions. There are numerous ways in which experimental mathematics, and specifically computer algebra, can contribute to these problem areas:

Currently, algorithmic combinatorics is a very active research area, and we hope that this special session will result in a vivid exchange of ideas and that it will foster future collaborations and interactions.

Call for Contributions

If you are interested in presenting your recent work in this session, please send your title and abstract to one of the session organizers, no later than April 23, 2020; see the section important dates on the ACA homepage. Please use the LaTeX template for your submission.