Related papers: Simplicial complexes in Macaulay2
We provide an overview of the Macaulay2 package VersalDeformations, which algorithmically computes versal deformations of isolated singularities, as well as local (multi)graded Hilbert schemes.
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…
We introduce the Macaulay2 package GradedLieAlgebras for doing computations in graded Lie algebras presented by generators and relations.
We consider the general model for dynamical systems defined on a simplicial complex. We describe the conjugacy classes of these systems and show how symmetries in a given simplicial complex manifest in the dynamics defined thereon,…
We outline a novel clustering scheme for simplicial complexes that produces clusters of simplices in a way that is sensitive to the homology of the complex. The method is inspired by, and can be seen as a higher-dimensional version of,…
Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies…
Defined by a single axiom, finite abstract simplicial complexes belong to the simplest constructs of mathematics. We look at a a few theorems.
We explain a Macaulay2 implementation of a construction, which appeared in [Holweck-Oeding arXiv:2206.13662], of a graded algebra structure on the direct sum of a Lie algebra $\mathfrak{g}$ (typically $\mathfrak{sl}_n$) and a…
We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of…
Cellular resolutions are a technique for constructing resolutions of monomial ideals by giving a cell complex labeled by monomials, or more generally, by monomial modules. This \verb|Macaulay2| package allows us to work with cellular…
We introduce the Macaulay2 package ThinSincereQuivers for studying acyclic quivers, the moduli of their thin-sincere representations, and the reflexive flow polytopes associated to them. We provide some background on the topic and…
We describe a recently revived version of the software package SubalgberaBases, which is distributed in the Macaulay2 computer algebra system. The package allows the user to compute and manipulate subagebra bases -- which are also known as…
This is the Hadamard package for Macaulay2 which computes the Hadamard product of projective subvarieties.
We introduce the \verb|Macaulay2| package \verb|RepHomology| for the computations of representation homology of certain spaces. The main methods implement computing the representation homology of surfaces (with group coefficients, and…
We present the Macaulay2 package TropicalToric.m2 for toric intersection theory computations using tropical geometry.
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
In this paper we provide a description of the package \textit{PolyominoIdeals} for \textit{Macaulay2} that allows to deal with collections of cells, polyominoes and related binomial ideals.
This article describes the \emph{Macaulay2} package \emph{FrobeniusThresholds}, designed to estimate and calculate $F$-pure thresholds, more general $F$-thresholds, and related numerical invariants arising in the study of singularities in…
The package \texttt{NumericalCertification} implements methods for certifying numerical approximations of solutions for a given system of polynomial equations. For certifying regular solutions, the package implements Smale's $\alpha$-theory…