Related papers: Complexity and Algorithms for Euler Characteristic…
The Parareal algorithm is used to solve time-dependent problems considering multiple solvers that may work in parallel. The key feature is a initial rough approximation of the solution that is iteratively refined by the parallel solvers. We…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
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 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…
We consider the independence complexes of square grids with cylindrical boundary conditions. When one of the dimensions is small we use simple reductions induced by edge removals to show explicit natural homotopy equivalences between those…
A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
We revisit Christol's theorem on algebraic power series in positive characteristic and propose yet another proof for it. This new proof combines several ingredients and advantages of existing proofs, which make it very well-suited for…
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…
We discuss the universal orbifold Euler characteristic and generalized orbifold Euler characteristics corresponding to finitely generated groups $A$ (the $A$-Euler characteristics). We show that the collection of all $A$-Euler…
We describe a framework for estimating Hilbert-Samuel multiplicities $e_XY$ for pairs of projective varieties $X \subset Y$ from finite point samples rather than defining equations. The first step involves proving that this multiplicity…
In this paper, we establish more properties of generalized poly-Euler polynomials with three parameters and we investigate a kind of symmetrized generalization of poly- Euler polynomials. Moreover, we introduce a more general form of multi…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
We propose analogs of the classical Generalized Riemann Hypothesis and the Generalized Simplicity Conjecture for the characteristic p L-series associated to function fields over a finite field. These analogs are based on the use of absolute…
We revisit Allendoerfer-Weil's formula for the Euler characteristic of embedded hypersurfaces in constant sectional curvature manifolds, first taking some time to re-prove it while demonstrating techniques of [2] and then applying it to…
Dorpalen-Barry et al. proved Elser's conjecture about sign of Elser's number by interpreting them as certain sums of reduced Euler characteristics of an abstract simplicial complex known as $U$-nucleus complex. We prove a conjecture posed…
In this short paper, we give two proofs that the Euler characteristic is multiplicative, for fiber sequences of finitely dominated spaces. This is equivalent to proving that the Becker-Gottlieb transfer is functorial on $\pi_0$.
Reductions combine collections of input values with an associative and often commutative operator to produce collections of results. When the same input value contributes to multiple outputs, there is an opportunity to reuse partial…
It is shown that Euler's theorem for graphs can be generalized for 2-complexes. Two notions that generalize cycle and Eulerian tour are introduced (``circlet'' and ``Eulerian cover''), and we show that for a strongly-connected, pure…
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…