Related papers: The GeometricDecomposability package for Macaulay2

The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…

This is a survey article of geometric properties of noncommutative symmetric spaces of measurable operators $E(\mathcal{M},\tau)$, where $\mathcal{M}$ is a semifinite von Neumann algebra with a faithful, normal, semifinite trace $\tau$, and…

Associated to a simple undirected graph $G$ is a simplicial complex $\Delta_G$ whose faces correspond to the independent sets of $G$. A graph $G$ is called vertex decomposable if $\Delta_G$ is a vertex decomposable simplicial complex. We…

The main aim of this paper is to classify Ulrich ideals and Ulrich modules over two-dimensional Gorenstein rational singularities (rational double points) from a geometric point of view. To achieve this purpose, we introduce the notion of…

This paper describes the RationalMaps package for Macaulay2. This package provides functionality for computing several aspects of rational maps such as whether a map is birational, or a closed embedding.

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…

Throughout this work, the vertex decomposability and shellability of graphs formed from other graphs by various operations are investigated. Also among the other things, by using some graph operations, new classes of Cohen-Macaulay graphs…

Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…

Let M be a matrix whose entries are power series in several variables and determinant det(M) does not vanish identically. The equation det(M)=0 defines a hypersurface singularity and the (co)-kernel of M is a maximally Cohen-Macaulay module…

When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…

Let L be a finite Galois extension of K with Galois group G. We decompose any idempotent 2-cocycle f using finite sequences of descending two-sided ideals of the corresponding weak crossed product algebra A:= (L/k, G, f). We specialise the…

We generalize the classical de Rham decomposition theorem for Riemannian manifolds to the setting of geodesic metric spaces of finite dimension.

We classify tuples of (not necessarily commuting) isometries that admit von Neumann-Wold decomposition. We introduce the notion of twisted isometries for tuples of isometries and prove the existence of orthogonal decomposition for such…

Bipartite determinantal ideals are introduced by Illian and the author as a vast generalization of the classical determinantal ideals intensively studied in commutative algebra, algebraic geometry, representation theory and combinatorics.…

Nagel and R\"omer introduced the class of weakly vertex decomposable simplicial complexes, which include matroid, shifted, and Gorenstein complexes as well as vertex decomposable complexes. They proved that the Stanley-Reisner ideal of…

We describe a novel Yang-Baxter integrable vertex model. From this vertex model we construct a certain class of partition functions that we show are equal to the LLT polynomials of Lascoux, Leclerc, and Thibon. Using the vertex model…

{\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 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 describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…