ID: 2405.09610

Learning 3-Manifold Triangulations

May 15, 2024

View on ArXiv

Similar papers 2

Computational topology with Regina: Algorithms, heuristics and implementations

August 13, 2012

85% Match
Benjamin A. Burton
Geometric Topology
Computational Geometry
Mathematical Software

Regina is a software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such as 3-sphere recognition, unknot recognition and connected sum decomposition. This paper brings 3-manifold topologists up-to-date with Regina as it appears today, and documents for the first time in ...

Find SimilarView on arXiv

Algorithms in 3-manifold theory

February 6, 2020

85% Match
Marc Lackenby
Geometric Topology

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost surfaces, hierarchies, homomorphisms to finite groups, and hyperbolic structures.

Find SimilarView on arXiv

Geometric deep learning: going beyond Euclidean data

November 24, 2016

85% Match
Michael M. Bronstein, Joan Bruna, Yann LeCun, ... , Vandergheynst Pierre
Computer Vision and Pattern ...

Many scientific fields study data with an underlying structure that is a non-Euclidean space. Some examples include social networks in computational social sciences, sensor networks in communications, functional networks in brain imaging, regulatory networks in genetics, and meshed surfaces in computer graphics. In many applications, such geometric data are large and complex (in the case of social networks, on the scale of billions), and are natural targets for machine learni...

Find SimilarView on arXiv

Applications of topological graph theory to $2$-manifold learning

August 31, 2018

85% Match
Tyrus Berry, Steven Schluchter
Numerical Analysis

We show how, given a sufficiently large point cloud sampled from an embedded 2-manifold in $\mathbb{R}^n$, we may obtain a global representation as a cell complex with vertices given by a representative subset of the point cloud. The vertex spacing is based on obtaining an approximation of the tangent plane which insures that the vertex accurately summarizes the local data. Using results from topological graph theory, we couple our cell complex representation with the known C...

Find SimilarView on arXiv

Quantifying Extrinsic Curvature in Neural Manifolds

December 20, 2022

85% Match
Francisco Acosta, Sophia Sanborn, Khanh Dao Duc, ... , Miolane Nina
Neurons and Cognition

The neural manifold hypothesis postulates that the activity of a neural population forms a low-dimensional manifold whose structure reflects that of the encoded task variables. In this work, we combine topological deep generative models and extrinsic Riemannian geometry to introduce a novel approach for studying the structure of neural manifolds. This approach (i) computes an explicit parameterization of the manifolds and (ii) estimates their local extrinsic curvature--hence ...

Find SimilarView on arXiv

ICLR 2022 Challenge for Computational Geometry and Topology: Design and Results

June 18, 2022

85% Match
Adele Myers, Saiteja Utpala, Shubham Talbar, Sophia Sanborn, Christian Shewmake, Claire Donnat, Johan Mathe, Umberto Lupo, Rishi Sonthalia, Xinyue Cui, Tom Szwagier, Arthur Pignet, Andri Bergsson, Soren Hauberg, Dmitriy Nielsen, Stefan Sommer, David Klindt, Erik Hermansen, Melvin Vaupel, Benjamin Dunn, Jeffrey Xiong, Noga Aharony, Itsik Pe'er, Felix Ambellan, Martin Hanik, Esfandiar Nava-Yazdani, ... , Miolane Nina
Computational Geometry

This paper presents the computational challenge on differential geometry and topology that was hosted within the ICLR 2022 workshop ``Geometric and Topological Representation Learning". The competition asked participants to provide implementations of machine learning algorithms on manifolds that would respect the API of the open-source software Geomstats (manifold part) and Scikit-Learn (machine learning part) or PyTorch. The challenge attracted seven teams in its two month d...

Find SimilarView on arXiv

A census of hyperbolic platonic manifolds and augmented knotted trivalent graphs

February 6, 2016

85% Match
Matthias Goerner
Geometric Topology

We call a 3-manifold Platonic if it can be decomposed into isometric Platonic solids. Generalizing an earlier publication by the author and others where this was done in case of the hyperbolic ideal tetrahedron, we give a census of hyperbolic Platonic manifolds and all of their Platonic tessellations. For the octahedral case, we also identify which manifolds are complements of an augmented knotted trivalent graph and give the corresponding link. A (small version of) the Plato...

Find SimilarView on arXiv

Triangulated Manifolds with Few Vertices: Combinatorial Manifolds

June 19, 2005

84% Match
Frank H. Lutz
Combinatorics
Geometric Topology

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.

Find SimilarView on arXiv

DIMAL: Deep Isometric Manifold Learning Using Sparse Geodesic Sampling

November 16, 2017

84% Match
Gautam Pai, Ronen Talmon, ... , Kimmel Ron
Computer Vision and Pattern ...

This paper explores a fully unsupervised deep learning approach for computing distance-preserving maps that generate low-dimensional embeddings for a certain class of manifolds. We use the Siamese configuration to train a neural network to solve the problem of least squares multidimensional scaling for generating maps that approximately preserve geodesic distances. By training with only a few landmarks, we show a significantly improved local and nonlocal generalization of the...

Find SimilarView on arXiv

Deep neural networks architectures from the perspective of manifold learning

June 6, 2023

84% Match
German Magai
Machine Learning
Artificial Intelligence
Computer Vision and Pattern ...
Algebraic Topology

Despite significant advances in the field of deep learning in ap-plications to various areas, an explanation of the learning pro-cess of neural network models remains an important open ques-tion. The purpose of this paper is a comprehensive comparison and description of neural network architectures in terms of ge-ometry and topology. We focus on the internal representation of neural networks and on the dynamics of changes in the topology and geometry of a data manifold on dif...

Find SimilarView on arXiv