Related papers: A Direct Algorithm to Compute the Topological Eule…

We prove a simple formula for MacPherson's Chern class of hypersurfaces in nonsingular varieties. The result highlights the relation between MacPherson's class and other definitions of homology Chern classes of singular varieties, such as…

Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…

An explicit computation of the so-called string-theoretic E-function of a normal complex variety X with at most log-terminal singularities can be achieved by constructing one snc-desingularization of X, accompanied with the intersection…

By the work of J.Huh, one can interpret binomial coefficients as a solution to an intersection problem on a permutohedral variety $X_E$. Applying Hirzebruch-Riemann-Roch, this intersection problem is equivalent to computing Euler…

We study $\mathbb{S}_n$-equivariant weight-graded and topological Euler characteristics of the universal Picard stack $\mathrm{Pic}_{g, n}^d \to \mathcal{M}_{g, n}$ of degree-$d$ line bundles over $\mathcal{M}_{g, n}$. We prove that in the…

The Euler characteristic of Chow varieties of algebraic cycles of a given degree in complex projective spaces was computed by Blaine Lawson and Stephen Yau by using holomorphic symmetries of cycles spaces. In this paper we compute this in a…

The Chern-Fulton class is a generalization of Chern class to the realm of arbitrary embeddable schemes. While Chern-Fulton classes are sensitive to non-reduced scheme structure, they are not sensitive to possible singularities of the…

The Euler Characteristic Transform (ECT) has proven to be a powerful representation, combining geometrical and topological characteristics of shapes and graphs. However, the ECT was hitherto unable to learn task-specific representations. We…

We study the use of the Euler characteristic for multiparameter topological data analysis. Euler characteristic is a classical, well-understood topological invariant that has appeared in numerous applications, including in the context 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…

Let G be a countable discrete group and let M be a smooth proper cocompact G-manifold without boundary. The Euler operator defines via Kasparov theory an element, called the equivariant Euler class, in the equivariant K-homology of M. The…

We obtain several new characterizations of splayedness for divisors: a Leibniz property for ideals of singularity subschemes, the vanishing of a `splayedness' module, and the requirements that certain natural morphisms of modules and…

We prove an analogue of the Riemann-Hurwitz theorem for computing Euler characteristics of pullbacks of coherent sheaves through finite maps of smooth projective varieties, subject only to the condition that the irreducible components of…

Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

The Euler characteristic of a very affine variety encodes the number of critical points of the likelihood equation on this variety. In this paper, we study the Euler characteristic of the complement of a hypersurface arrangement with…

Let F be the complete flag variety over Spec(Z) with the tautological filtration 0 \subset E_1 \subset E_2 \subset ... \subset E_n=E of the trivial bundle E over F. The trivial hermitian metric on E(\C) induces metrics on the quotient line…

We present a method to compute the Euler characteristic of an algebraic subset of $\bc^n$. This method relies on clasical tools such as Gr\"obner basis and primary decomposition. The existence of this method allows us to define a new…

Topological invariants, including the Chern numbers, can topologically classify parameterized Hamiltonians. We find that topological invariants can be properly defined and calculated even if the parameter space is discrete, which is done by…

The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…