Related papers: Complexity and Algorithms for Euler Characteristic…
While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…
Using the lattice-theoretic version of the Euler characteristic introduced by V. Klee and G.-C. Rota in the Sixties, we define the Euler characteristic of a formula in G\"{o}del logic (over finitely or infinitely many truth-values). We then…
This paper is concerned with the design and analysis of a fully adaptive eigenvalue solver for linear symmetric operators. After transforming the original problem into an equivalent one formulated on $\ell_2$, the space of square summable…
We formalise, in Coq, the opening sections of Parity Complexes [Street1991] up to and including the all important excision of extremals algorithm. Parity complexes describe the essential combinatorial structure exhibited by simplexes, cubes…
In this paper we extend the notion of the Euler characteristic to persistent homology and give the relationship between the Euler integral of a function and the Euler characteristic of the function's persistent homology. We then proceed to…
In this paper we give an attempt to extend some arithmetic properties such as multiplicativity, convolution products to the setting of operators theory. We provide a significant examples which are of interest in number theory. We also give…
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…
In a 1967 paper, Banchoff stated that a certain type of polyhedral curvature, that applies to all finite polyhedra, was zero at all vertices of an odd-dimensional polyhedral manifold; one then obtains an elementary proof that…
A detailed analysis of the remainder obtained by truncating the Euler series up to the $n$th-order term is presented. In particular, by using an approach recently proposed by Weniger, asymptotic expansions of the remainder, both in inverse…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
In this paper, we numerically study a class of solutions with spiraling singularities in vorticity for two-dimensional, inviscid, compressible Euler systems, where the initial data have an algebraic singularity in vorticity at the origin.…
In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…
Many practical problems in almost all scientific and technological disciplines have been classified as computationally hard (NP-hard or even NP-complete). In life sciences, combinatorial optimization problems frequently arise in molecular…
Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries of shapes and utilized to compute distances. In this…
We apply the Yau-Zaslow-Beauville method to compute the Euler characteristic of the generalized Kummer varieties attached to a complex abelian surface (a calculation also done by Goettsche and Soergel by different methods). It is related to…
In this paper we introduce and study the Euler characteristic associated with algebraic modules generated by arbitrary elements of certain noncommutative polyballs. We provide several asymptotic formulas and prove some of its basic…
We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we…
Current algorithms for context-free parsing inflict a trade-off between ease of understanding, ease of implementation, theoretical complexity, and practical performance. No algorithm achieves all of these properties simultaneously. Might et…
We obtain a recursive formula for the characteristic number of degree $d$ curves in $\mathbb{P}^2$ with prescribed singularities (of type $A_k$) that are tangent to a given line. The formula is in terms of the characteristic number of…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…