Related papers: Complexity and Algorithms for Euler Characteristic…

Ordinary Differential Equations are derived for the adjoint Euler equations firstly using the method of characteristics in 2D. For this system of partial-differential equations, the characteristic curves appear to be the streamtraces and…

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…

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…

The theory of holographic algorithms, which are polynomial time algorithms for certain combinatorial counting problems, yields insight into the hierarchy of complexity classes. In particular, the theory produces algebraic tests for a…

We present a computer algebra approach to proving identities on Bernoulli polynomials and Euler polynomials by using the extended Zeilberger's algorithm given by Chen, Hou and Mu. The key idea is to use the contour integral definitions of…

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

We discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, nonreduced) projective scheme. For example, the algorithm yields the topological Euler characteristic…

Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…

Generating functions for the number of commuting m-tuples in the symmetric groups are obtained. We define a natural sequence of ``orbifold Euler characteristics'' for a finite group G acting on a manifold X. Our definition generalizes the…

Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…

The aim of this paper is twofold. One is to give a definition of the Euler characteristic of infinite acyclic categories with filtrations and the other is to prove the invariance of the Euler characteristic under the subdivision of finite…

We write the Euler characteristic X(G) of a four dimensional finite simple geometric graph G=(V,E) in terms of the Euler characteristic X(G(w)) of two-dimensional geometric subgraphs G(w). The Euler curvature K(x) of a four dimensional…

We make explicit computations in the formal symplectic geometry of Kontsevich and determine the Euler characteristics of the three cases, namely commutative, Lie and associative ones, up to certain weights.From these, we obtain some…

We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…

This paper explains how to use quantum field theory techniques to find formal power series that encode the virtual Euler characteristics of $\mathrm{Out}(F_n)$ and related graph complexes. Finding such power series was a necessary step in…

In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…

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…

We present a novel method of associating Euclidean features to simplicial complexes, providing a way to use them as input to statistical and machine learning tools. This method extends the node2vec algorithm to simplices of higher…

This paper presents a series of general properties of the r-Complexity calculus, a complexity measurement for assessing the performance and asymptotic behaviour of real-world algorithms. This research describes characteristics such as…

We prove a complexity dichotomy theorem for Holant Problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted…