Papers
Topics
Authors
Recent
Search
2000 character limit reached

Abstract simplicial complexes in {\tt Macaulay2}

Published 14 Apr 2025 in math.AG, math.AC, math.AT, math.CO, and math.KT | (2504.10381v1)

Abstract: {\tt AbstractSimplicialComplexes.m2} is a computer algebra package written for the computer algebra system {\tt Macaulay2} \cite{M2}. It provides new infrastructure to work with abstract simplicial complexes and related homological constructions. Its key novel feature is to implement each given abstract simplicial complex as a certain graded list in the form of a hash table with integer keys. Among other features, this allows for a direct implementation of the associated reduced and non-reduced simplicial chain complexes. Further, it facilitates construction of random simplicial complexes. The approach that we employ here builds on the {\tt Macaulay2} package {\tt Complexes.m2} \cite{Stillman:Smith:Complexes.m2}. It complements and is entirely different from the existing {\tt Macaulay2} simplicial complexes framework that is made possible by the package {\tt SimplicialComplexes.m2} \cite{Smith:et:al:SimplicialComplexes.m2:jsag}.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.