Related papers: Computing Schur complexes
We shortly describe the algorithms behind some of the functions provided by the Macaulay2 package MultiprojectiveVarieties, a package for multi-projective varieties and rational maps between them.
In this note, working in the context of simplicial sets, we give a detailed study of the complexity for computing chain level Steenrod squares, in terms of the number of face operators required. This analysis is based on the combinatorial…
We introduce the CpMackeyFunctors package for Macaulay2, which allows for computations with Mackey functors over a cyclic group of prime order.
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…
\pkg{multiplex} is a computer program that provides algebraic tools for the analysis of multiple network structures within the \proglang{R} environment. Apart from the possibility to create and manipulate multivariate data representing…
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 define the corresponding Hardy space, Schur multipliers and their realizations, and interpolation. Possible applications of the present work include matrices of quaternions, matrices of split quaternions, and other algebras of…
Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with…
We introduce the AdditiveToricVarieties package for Macaulay2, a software system for algebraic geometry and commutative algebra, with methods for working with additive group actions on complete toric varieties. More precisely, we implement…
We describe a significant update to the Macaulay2 package A1BrouwerDegrees. We extend several methods in the previous version of the package to the setting of finite \'{e}tale algebras, allowing the computation of transfers along finite…
We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis. This includes a survey on some classification results and a discussion of the relation to other approaches.
We discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, nonreduced) projective scheme. For example, the algorithm yields the topological Euler characteristic…
We introduce the package combinatorics for the software CoCoA. This package provides a data structure and the necessary methods for computing several known enumerative combinatorial invariants.
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
We have developed a graphical user interface (GUI) based package $\mu$2mech to perform phase-field simulation for predicting microstructure evolution. The package can take inputs from ab initio calculations and CALPHAD (Calculation of Phase…
In this Macaulay2 \cite{M2} package we define an object called {\it linear code}. We implement functions that compute basic parameters and objects associated with a linear code, such as generator and parity check matrices, the dual code,…
We prove a duality theorem for Cohen--Macaulay simplicial complexes. This is a generalisation of Poincar\'e Duality, framed in the language of combinatorial sheaves. Our treatment is self-contained and accessible for readers with a working…
We describe a novel method for computing sheaf cohomology over weighted projective spaces and stacks using exterior algebra and differential module techniques, generalizing an algorithm due to Eisenbud-Fl\o ystad-Schreyer over projective…
We present a method to compute the degrees of the Segre classes of a subscheme of complex projective space. The method is based on generic residuation and intersection theory. It has been implemented using the software system Macaulay2.
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…