Related papers: $\mathbb{A}^1$-Brouwer degrees in Macaulay2
Local rings are ubiquitous in algebraic geometry. Not only are they naturally meaningful in a geometric sense, but also they are extremely useful as many problems can be attacked by first reducing to the local case and taking advantage of…
We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…
Thanks to a connection between two completely different topics, the classical eigenvalue problem in a finite dimensional real vector space and the Brouwer degree for maps between oriented differentiable real manifolds, we were able to…
{\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…
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…
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 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 introduce the package LatticePolytopes for Macaulay2. The package provides methods for computations related to Cayley structures, local positivity and smoothness for lattice polytopes.
Numerical Algebraic Geometry uses numerical data to describe algebraic varieties. It is based on the methods of numerical polynomial homotopy continuation, an alternative to the classical symbolic approaches of computational algebraic…
We describe a Macaulay2 package for computing Schur complexes. This package expands on the ChainComplexOperations package by David Eisenbud.
We provide a clarification of the classification of two-dimensional algebras over an arbitrary base field. Using this clarification, we determine the number of non-isomorphic two-dimensional algebras over a finite field.
Non-degenerate bilinear forms over fields of characteristic 2, in particular, non-symmetric ones, are classified with respect to various equivalences, and the Lie algebras preserving them are described. Although it is known that there are…
We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.
We introduce Brauer complex of symmetric SB-algebra, and reformulate in terms of Brauer complex the so far known invariants of stable and derived equivalence of symmetric SB-algebras. In particular, the genus of Brauer complex turns out to…
Recently the so-called Atiyah conjecture about l^2-Betti numbers has been disproved. The counterexamples were found using a specific method of computing the spectral measure of a matrix over a complex group ring. We show that in many…
Symbolic powers are a classical commutative algebra topic that relates to primary decomposition, consisting, in some circumstances, of the functions that vanish up to a certain order on a given variety. However, these are notoriously…
We describe the computer algebra software package SpectralSequences for the computer algebra system Macaulay2. This package implements many data types, objects and algorithms which pertain to, among other things, filtered complexes,…
We introduce the $\textit{Macaulay2}$ package $\texttt{OIGroebnerBases}$ for working with OI-modules over Noetherian polynomial OI-algebras. The main methods implement OI-analogues of Buchberger's algorithm and Schreyer's theorem to compute…
We prove some new relations between weak approximation and some rational equivalence relations (Brauer and R-equivalence) in algebraic groups over arithmetical fields. By using weak approximation and local - global approach, we compute…
In this project, we will study the Brauer group that was first defined by R. Brauer. The elements of the Brauer group are the equivalence classes of finite dimensional central simple algebra. Therefore understanding the structure of the…