Related papers: The Euler characteristic of an even-dimensional gr…
A connected combinatorial 2-manifold is called degree-regular if each of its vertices have the same degree. A connected combinatorial 2-manifold is called weakly regular if it has a vertex-transitive automorphism group. Clearly, a weakly…
We give a list of universal linear relations between the Euler characteristics of manifolds consisting of multisingularities of a generic Lagrangian map into a five-dimensional space. From these relations it follows, in particular, that the…
When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…
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…
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…
A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained…
We generalize Llarull's scalar curvature comparison to Riemannian manifolds admitting metric connections with parallel and alternating torsion and having a nonnegative curvature operator on 2-vectors. As a byproduct, we show that Euler…
Let $M$ be a graph manifold such that each piece of its JSJ decomposition has the $\Bbb H^2 \times \Bbb R$ geometry. Assume that the pieces are glued by isometries. Then, there exists a complete Riemannian metric on $\Bbb R \times M$ which…
We find an algorithm to compute the quadratic Euler characteristic of a smooth projective complete intersection of hypersurfaces of the same degree. As an example, we compute the quadratic Euler characteristic of a smooth projective…
The magnitude of a graph is one of a family of cardinality-like invariants extending across mathematics; it is a cousin to Euler characteristic and geometric measure. Among its cardinality-like properties are multiplicativity with respect…
For $g\ge 2$ and $n\ge 0$, let $\mathcal{H}_{g,n}\subset \mathcal{M}_{g,n}$ denote the complex moduli stack of $n$-marked smooth hyperelliptic curves of genus $g$. A normal crossings compactification of this space is provided by the theory…
We study the Bakry-\'Emery curvature function $\mathcal{K}_{G,x}:(0,\infty]\to \mathbb{R}$ of a vertex $x$ in a locally finite graph $G$ systematically. Here $\mathcal{K}_{G,x}(\mathcal{N})$ is defined as the optimal curvature lower bound…
The subclass of Euler graphs with only one type of cycles under (mod 4) operation was studied in Part-1 of this series. It was established that such graphs under regularity are nonexistent for degree >2. Here we consider the subclass of…
In this article we develop a graphical calculus for stable invariants of Riemannian manifolds akin to the graphical calculus for Rozansky-Witten invariants for hyperk\"ahler manifolds; based on interpreting trivalent graphs with colored…
We prove that particle models whose action is given by the integrated $n$-th curvature function over the world line possess $n+1$ gauge invariances. A geometrical characterization of these symmetries is obtained via Frenet equations by…
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…
We prove a Lefschetz formula for general simple graphs which equates the Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of simplices in G which are fixed by T. The degree i(x) of x with respect to T is defined…
We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…
Given a finite simplicial complex L and a collection of pairs of spaces indexed by its vertex set, one can define their polyhedral product. We record a simple formula for its Euler characteristic. In special cases the formula simplifies…
A multigraph is a nonsimple graph which is permitted to have multiple edges, that is, edges that have the same end nodes. We introduce the concept of spanning simplicial complexes $\Delta_s(\mathcal{G})$ of multigraphs $\mathcal{G}$, which…