Machine Learning and the Combinatorics of Cayley Graphs
par
Bâtiment Alix et Marwan Lahoud
IHES
Given an element of a finite group G, one may ask for its presentation as a minimal product of generators from some predetermined subset S. This problem also has a graph-theoretic formulation: given a vertex of the Cayley graph associated with G and S, find the shortest path back to the identity. We present a machine learning approach to answering this version of the question, develop it as a method for helping resolve further problems in combinatorial group theory, and present several conjectures posed with its aid.
========
Pour être informé des prochains séminaires vous pouvez vous abonner à la liste de diffusion en écrivant un mail à sympa@listes.math.cnrs.fr avec comme sujet: "subscribe seminaire_mathematique PRENOM NOM"
(indiquez vos propres prénom et nom) et laissez le corps du message vide.
Maxim Kontsevich