Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.07570

ChatGPT for Computational Topology

Jian Liu·Li Shen·Guo-Wei Wei
View original source ↗Read source document ↗Export metadata ↓

Abstract

ChatGPT represents a significant milestone in the field of artificial intelligence (AI), finding widespread applications across diverse domains. However, its effectiveness in mathematical contexts has been somewhat constrained by its susceptibility to conceptual errors. Concurrently, topological data analysis (TDA), a relatively new discipline, has garnered substantial interest in recent years. Nonetheless, the advancement of TDA is impeded by the limited understanding of computational algorithms and coding proficiency among theoreticians. This work endeavors to bridge the gap between theoretical topological concepts and their practical implementation in computational topology through the utilization of ChatGPT. We showcase how a pure theoretician, devoid of computational experience and coding skills, can effectively transform mathematical formulations and concepts into functional code for computational topology with the assistance of ChatGPT. Our strategy outlines a productive process wherein a mathematician trains ChatGPT on pure mathematical concepts, steers ChatGPT towards generating computational topology code, and subsequently validates the generated code using established examples. Our specific case studies encompass the computation of Betti numbers, Laplacian matrices, and Dirac matrices for simplicial complexes, as well as the persistence of various homologies and Laplacians. Furthermore, we explore the application of ChatGPT in computing recently developed topological theories for hypergraphs and digraphs. This work serves as an initial step towards effectively transforming pure mathematical theories into practical computational tools, with the ultimate goal of enabling real applications across diverse fields.

Explore related subjects

math.ATcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian Liu, Li Shen, Guo-Wei Wei. 2023-11-15. ChatGPT for Computational Topology. https://doi.org/10.3934/fods.2024009

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Continuous Comparison of Free Simplicial Prounipotent and Pro-$p$ Resolutions

We give a continuous version of the comparison theorem for free simplicial resolutions in the categories of prounipotent groups over a field of characteristic zero and of pro-$p$ groups. The resolutions carry free bases compatible with degeneracies; their ranks may be infinite. In characteristic zero the lifting step follows from continuous linear splittings and the universal property of completed free Lie algebras. In the pro-$p$ case it follows from the classical projectivity of free pro-$p$ groups. A relative lifting argument and an explicit simplicial cylinder establish homotopy uniqueness. We formulate the free bases using actual surjections in the simplex category, so degeneracy words related by simplicial identities are identified from the outset, and we spell out the full matching objects used in the lifting argument. The question arose naturally in our preceding work on Bousfield--Kan completions of subcontractible presentations.

math.AT↗
arXiv2026

Bousfield--Kan Completions of Subcontractible Presentations

We study Bousfield--Kan completions through the interaction of free simplicial resolutions, their filtration spectral sequences, and a noncommutative arithmetic square. For every free discrete simplicial group of finite type, we express its integral pronilpotent completion as the homotopy pullback of its rational prounipotent completion and the product of its pro-$p$ completions over an explicit adelic simplicial group. The adelic entry is formed by taking restricted products at finite nilpotent stages and then their inverse limit; no nilpotency assumption on the original group of components is required. Finite subpresentations of contractible presentations provide an explicit application of this construction. Independence of the specified relators makes the positive-degree terms of the rational and mod-$p$ filtration spectral sequences vanish, with convergence verified on the quotient towers. Continuous comparison of free simplicial resolutions then realizes, in characteristic zero, the equivalence with a constant free prounipotent group by morphisms and homotopies in that category. For the corresponding presentation complex $K$ we obtain $R_\infty K\simeq K(F_R(Z),1)$ for $R=\mathbb Q,\mathbb F_p,\mathbb Z$, where $Z$ indexes a complementary basis and $F_R(Z)$ denotes, respectively, the rational points of a free prounipotent group, a free pro-$p$ group, or a free pronilpotent group. Compatible contractions at the nilpotent stages identify all four entries of the arithmetic square in this case.

math.AT↗
arXiv2026

On spaces of embeddings of circles in surfaces

We consider the space of embeddings of finitely many circles that bound disks in non-positively curved surfaces. We index the connected components of this space with finite rooted trees and show that the connected components are classifying spaces of the ``braided" automorphism groups of the associated trees. An intermediate step to proving these results is to construct a strong deformation retract onto the subspace of geometric circles; moreover, this strong deformation retraction is equivariant with respect to transformations of the surface.

math.AT↗