[GAP Forum] CALL FOR ABSTRACTS -- Backtrack search techniques in groups and combinatorics at ICMS 2018

[Markus Pfeiffer]

CALL FOR ABSTRACTS -- DEADLINE APRIL 15 2018
CALL FOR EXTENDED ABSTRACTS -- DEADLINE APRIL 21 2018

Session on "Backtrack search techniques in groups and combinatorics" 

at the 

International Congress on Mathematical Software - ICMS 2018 -
University of Notre Dame, 24-27 July 2018, https://www.icms-conference.org/2018

We invite submissions of short abstracts and extended abstracts for our
session "Backtrack search techniques in groups and combinatorics".

We welcome submissions about work in progress, theoretical results,
experimental results, and in particular implementation details of state of the
art algorithms.

Accepted short abstracts will be presented at the congress.
Accepted extended abstracts will additionally appear in the conference proceedings.

If you would like to submit your work, please follow the guidelines at 
http://icms-conference.org/2018/submission-guidelines/. If you have any questions
please contact the session organisers by email (mp397 at st-andrews.ac.uk,
caj21 at st-andrews.ac.uk).

Cheers,
Chris and Markus

Session description:

Backtrack search is a vital part of solving many problems in computational group
theory, such as graph isomorphism, finding (non-point) stabilisers and
normalisers in permutation groups, finding canonical images of objects under a
group action, or short solutions to equations over a free group.

Efficient backtrack search implementations require a symbiosis of efficient algorithms,
high-performance code, and sophisticated mathematical methods to prune search
space. Some of the most prominent backtrack methods in computational mathematics
are McKay's graph isomorphism algorithm, Jeffrey Leon's partition backtrack
method for permutation groups, and Bernd Schmalz' "snakes and ladders" algorithm.

Many breakthroughs in AI-search, such as learning, heuristics and parallelism,
can improve performance by multiple orders of magnitude, and are applicable in
computational group theory.

We would like to invite experts from AI, combinatorics, computational group
theory and related areas with the aim of sharing and exchanging ideas, problems,
results and implementations.