Related papers: Computing characteristic classes of projective sch…

The Macaulay2 package CharacteristicClasses provides commands for the computation of the topological Euler characteristic, the degrees of the Chern classes and the degrees of the Segre classes of a closed subscheme of complex projective…

Let $V$ be a closed subscheme of a projective space $\mathbb{P}^n$. We give an algorithm to compute the Chern-Schwartz-MacPherson class, Euler characteristic and Segre class of $ V$. The algorithm can be implemented using either symbolic or…

We present an algorithm for the symbolic and numerical computation of the degrees of the Chern-Schwartz-MacPherson classes of a closed subvariety of projective space P^n. As the degree of the top Chern-Schwartz-MacPherson class is the…

The Macaulay2 package Cremona performs some computations on rational and birational maps between irreducible projective varieties. For instance, it provides methods to compute degrees and projective degrees of rational maps without any…

Let $V$ be a possibly singular scheme-theoretic complete intersection subscheme of $\mathbb{P}^n$ over an algebraically closed field of characteristic zero. Using a recent result of Fullwood ("On Milnor classes via invariants of singular…

A simple and efficient algorithm to numerically compute the genus of surfaces of three-dimensional objects using the Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar field in a…

We give an algorithm for computing Segre classes of subschemes of arbitrary projective varieties by computing degrees of a sequence of linear projections. Based on the fact that Segre classes of projective varieties commute with…

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.

Let $X_{\Sigma}$ be a smooth complete toric variety defined by a fan $\Sigma$ and let $V=V(I)$ be a subscheme of $X_{\Sigma}$ defined by an ideal $I$ homogeneous with respect to the grading on the total coordinate ring of $X_{\Sigma}$. We…

We describe the Macaulay2 package TateOnProducts and its capabilities, which include computing cohomology tables and Beilinson monads of sheaves on products of projective spaces and the derived category pushForward of a sheaf under a…

We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…

We compute the equivariant cohomology of complex projective spaces associated to finite-dimensional representations of $C_2$, using ordinary cohomology graded on representations of the fundamental groupoid, with coefficients in the Burnside…

We discuss the isomorphism problem of projective schemes; given two projective schemes, can we algorithmically decide whether they are isomorphic? We give affirmative answers in the case of one-dimensional projective schemes, the case of…

We present an efficient algorithm to compute Euler characteristic curves of gray scale images of arbitrary dimension. In various applications the Euler characteristic curve is used as a descriptor of an image. Our algorithm is the first…

In this article, we study Euler characteristic techniques in topological data analysis. Pointwise computing the Euler characteristic of a family of simplicial complexes built from data gives rise to the so-called Euler characteristic…

We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…

In this paper we derive a simple and useful combinatorial formula for the push-forwards of cohomology classes down projective towers, in terms of the push-forwards down the individual steps in the tower.

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.

Let $\mathcal{P}$ be a topological property. A.V. Arhangel'skii calls $X$ projectively $\mathcal{P}$ if every second countable continuous image of $X$ is $\mathcal{P}$. Lj.D.R. Ko$\check{c}$inac characterized the classical covering…

This note introduces the $\texttt{LikelihoodGeometry}$ package for the computer algebra system $\textit{Macaulay2}$. This package gives tools to construct the likelihood correspondence of a discrete algebraic statistical model, a variety…