Related papers: Computing Euler characteristics using quantum fiel…
In this paper we obtain some explicit expressions for the Euler characteristic of a rank n coherent sheaf F on P^N and of its twists F(t) as polynomials in the Chern classes c_i(F), also giving algorithms for the computation. The employed…
We compute the Euler characteristics of tautological vector bundles and their exterior powers over the Quot schemes of curves. We give closed-form expressions over punctual Quot schemes in all genera. For higher rank quotients of a trivial…
Trace formulas play a central role in the study of spectral geometry and in particular of quantum graphs. The basis of our work is the result by Kurasov which links the Euler characteristic $\chi$ of metric graphs to the spectrum of their…
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…
We prove several claims made by Kontsevich about the orbifold Euler characteristic of the three types of graph homology introduced by him. For this purpose, first we develop a simplified version of the Feynman diagram method, which requires…
The Euler characteristic $\chi =|V|-|E|$ and the total length $\mathcal{L}$ are the most important topological and geometrical characteristics of a metric graph. Here, $|V|$ and $|E|$ denote the number of vertices and edges of a graph. The…
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…
By using methods of umbral nature, we discuss new rules concerning the operator ordering. We apply the technique of formal power series to take advantage from the wealth of properties of the exponential operators. The usefulness of the…
We establish a novel representation of arbitrary Euler-Zagier sums in terms of weighted vacuum graphs. This representation uses a toy quantum field theory with infinitely many propagators and interaction vertices. The propagators involve…
The study of solutions to polynomial equations over finite fields has a long history in mathematics and is an interesting area of contemporary research. In recent years the subject has found important applications in the modelling of…
We develop a general method for computing the homological Euler characteristic of finite index subgroups G of GL_m(O_K) where O_K is the ring of integers in a number field K. With this method we find, that for large, explicitly computed…
The weighted Euler characteristic transform (WECT) and Euler characteristic function (ECF) have proven to be useful tools in a variety of applications. However, current methods for computing these functions are either not optimized for GPU…
Quantum computers can efficiently solve problems which are widely believed to lie beyond the reach of classical computers. In the near-term, hybrid quantum-classical algorithms, which efficiently embed quantum hardware in classical…
Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…
We provide a generating function for the (graded) dimensions of M. Kontsevich's graph complexes of ordinary graphs. This generating function can be used to compute the Euler characteristic in each loop order. Furthermore, we show that…
We compute the quadratic Euler characteristic of the symmetric powers of a smooth, projective curve over any field $k$ that is not of characteristic two, using the Motivic Gauss-Bonnet Theorem of Levine-Raksit. As an application, we show…
The Euler characteristic transform (ECT) is a simple to define yet powerful representation of shape. The idea is to encode an embedded shape using sub-level sets of a a function defined based on a given direction, and then returning the…
We transformed the generalized exponential power series to another functional form suitable for further analysis. By applying the Cauchy-Euler differential operator in the form of an exponential operator, the series became a sum of…
Let G be a finite, complex reflection group and f its discriminant polynomial. The fibers of f admit commuting actions of G and a cyclic group. The virtual $G\times C_m$ character given by the Euler characteristic of the fiber is a…
We give explicit computations of the $\Gamma$-Euler characteristic of several families of orbit space definable translation groupoids. These include the translation groupoids associated to finite-dimensional linear representations of the…