Related papers: Complexity and Algorithms for Euler Characteristic…
For an $n$-fold geometrically cyclic branched covering $Y$ of a smooth, projective scheme $X$ branched at a smooth closed subscheme $Z\subset X$ with $n \in k^\times$, we compute the quadratic Euler characteristic of $Y$ in terms of certain…
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…
The angle defect, which is the standard way to measure curvature at the vertices of polyhedral surfaces, goes back at least as far as Descartes. Although the angle defect has been widely studied, there does not appear to be in the…
In this work, singular surfaces are obtained from smooth orientable closed surfaces by applying three basic simple loop operations, collapsing operation, zipping operation and double loop identification, each of which produces different…
Assume that the coefficients of a polynomial in a complex variable are Laurent polynomials in some complex parameters. The parameter space (a complex torus) splits into strata corresponding to different combinations of coincidence of the…
We lift the Euler characteristic of a nearly perfect complex to a relative algebraic K-group by passing to its l-adic Euler characteristics.
We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…
In this paper we introduce a method which allows us to study properties of the random uniform simplicial complex. That is, we assign equal probability to all simplicial complexes with a given number of vertices and then consider properties…
Datasets are mathematical objects (e.g., point clouds, matrices, graphs, images, fields/functions) that have shape. This shape encodes important knowledge about the system under study. Topology is an area of mathematics that provides…
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…
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…
Euler calculus is based on integrating simple functions with respect to the Euler characteristic. This paper makes the case for extending Euler calculus to continuous integrands by integrating with respect to (Gaussian) curvature. This…
Via counting over finite fields, we derive explicit formulas for the E-polynomials and Euler characteristics of GL(d)- and PGL(d)-character varieties of free groups. We prove a positivity property for these polynomials and relate them to…
The variational properties of the scalar so--called ``Universal'' equations are reviewed and generalised. In particular, we note that contrary to earlier claims, each member of the Euler hierarchy may have an explicit field dependence. The…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…
We use Seiberg--Witten-like relations in the topological recursion framework to obtain virtual Euler characteristics for uni- and multicellular maps for ensembles of classic orthogonal polynomials and for ensembles related to nonorientable…
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…
In this paper, we study some properties of Euler polynomials arising from umbral calculus. Finally, we give some interesting identities of Euler polynomials using our results. Recently, Dere and Simsek have studied umbral calculus related…
The Euler characteristic of a very affine variety encodes the algebraic complexity of solving likelihood (or scattering) equations on this variety. We study this quantity for the Grassmannian with $d$ hyperplane sections removed. We provide…
Using the weak factorization theorem we give a simple presentation for the value group of the universal Euler characteristic with compact support for varieties of characteristic zero and describe the value group of the universal Euler…