Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula
Computing homotopy groups of spheres has long been a fundamental objective in algebraic topology. Various theoretical and algorithmic approaches have been developed to tackle this problem. In this paper we take a step towards the goal of comprehending the group-theoretic structure of the generators of these homotopy groups by leveraging the power of machine learning. Specifically, in the simplicial group setting of Wu's formula, we reformulate the problem of generating simplicial cycles as a problem of sampling from the intersection of algorithmic datasets related to Dyck languages. We present and evaluate language modelling approaches that employ multi-label information for input sequences, along with the necessary group-theoretic toolkit and non-neural baselines.
Code (1)
Tasks
Language ModellingSimilar Papers 제목 키워드 기반
Principled Simplicial Neural Networks for Trajectory Prediction
We consider the construction of neural network architectures for data on simplicial complexes. In studying maps on the chain complex of a simplicial complex, we define three desirable properties of a simplicial neural ne…
PredictionTrajectory PredictionTopological Signal Processing over Simplicial Complexes
The goal of this paper is to establish the fundamental tools to analyze signals defined over a topological space, i.e. a set of points along with a set of neighborhood relations. This setup does not require the definitio…
Algebraic Topological Networks via the Persistent Local Homology Sheaf
In this work, we introduce a novel approach based on algebraic topology to enhance graph convolution and attention modules by incorporating local topological properties of the data. To do so, we consider the framework of…
Random walks on simplicial complexes
The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial co…
Simplicial Neural Networks:First Steps and Future Applications
It is well-known that artificial neural networks are universal approximators. The Universal Approximation Theorem proves that, given a continuous function on a compact set embedded in an $n$-dimensional space, there exis…