Related papers: Simplicial complexes in Macaulay2
We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…
In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…
We analyze the symplectic and complex structures on the panelled web 4-manifolds. In particular, we give infinite family of examples of almost complex but not symplectic and not complex 4-manifolds in the non-simply connected case.
We study dualizing complexes on algebraic stacks. In particular, we show their existence for (tame) Deligne--Mumford stacks of equicharacteristic in great generality.
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially Cohen-Macaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
We present two approaches to constructing an integration map for smooth Deligne cohomology. The first is defined in the simplicial model, where a class in Deligne cohomology is represented by a simplicial form, and the second in a related…
An isomorphism of symplectically tame smooth pseudocomplex structures on the complex projective plane which is a homeomorphism and differentiable of full rank at two points is smooth.
Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
Normaliz is a tool for the computation of Hilbert bases of normal affine monoids and related tasks. We describe the Macaulay 2 interface to Normaliz. It makes Normaliz accessible for operations on monoid algebras in Macaulay 2 and,…
In this expository article, we survey the rapidly emerging area of random geometric simplicial complexes.
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
We study random 2-dimensional complexes in the Linial - Meshulam model and find torsion in their fundamental groups at various regimes. We find a simple algorithmically testable criterion for a subcomplex of a random 2-complex to be…
Finite group actions on free resolutions and modules arise naturally in many interesting examples. Understanding these actions amounts to describing the terms of a free resolution or the graded components of a module as group…
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity…
In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…