Related papers: Poincare Hopf for vector fields on graphs

We prove Gauss-Bonnet and Poincare-Hopf formulas for multi-linear valuations on finite simple graphs G=(V,E) and answer affirmatively a conjecture of Gruenbaum from 1970 by constructing higher order Dehn-Sommerville valuations which vanish…

A directed graph G = (V,E) is singly connected if for any two vertices v, u of V, the directed graph G contains at most one simple path from v to u. In this paper, we study different algorithms to find a feasible but necessarily optimal…

A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the gain function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite…

We introduce the notion of strip complex. A strip complex is a special type of complex obtained by gluing "strips" along their natural boundaries according to a given graph structure. The most familiar example is the one dimensional complex…

Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…

Any simplicial Hopf algebra involves $2n$ different projections between the Hopf algebras $H_n,H_{n-1}$ for each $n \geq 1$. The word projection, here meaning a tuple $\partial \colon H_{n} \to H_{n-1}$ and $i \colon H_{n-1} \to H_{n}$ of…

Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The…

The independence complex $\mathrm{Ind}(G)$ of a graph $G$ is the simplicial complex formed by its independent sets. This article introduces a deformation of the simplicial boundary map of $\mathrm{Ind}(G)$ that gives rise to a double…

The Wiener index $W(G)$ is the sum of distances of all pairs of vertices of the graph $G$. The Wiener polarity index $W_{p}(G)$ of a graph $G$ is the number of unordered pairs of vertices $u$ and $v$ of $G$ such that the distance…

For a simplicial complex with n sets, let W^-(x) be the set of sets in G contained in x and W^+(x) the set of sets in G containing x. An integer-valued function h on G defines for every A subset G an energy E[A]=sum_x in A h(x). The…

Assume G is a finite abstract simplicial complex with f-vector (v0,v1, ...), and generating function f(x) = sum(k=1 v(k-1) x^k = v0 x + v1 x^2+ v2 x^3 + ..., the Euler characteristic of G can be written as chi(G)=f(0)-f(-1). We study here…

Given a CW-complex A we define an `A-shaped' homology theory which behaves nicely towards A-homotopy groups allowing the generalization of many classical results. We also develop a relative version of the Federer spectral sequence for…

Suppose one is given a discrete group G, a cocompact proper G-manifold M, and a G-self-map f of M. Then we introduce the equivariant Lefschetz class of f, which is globally defined in terms of cellular chain complexes, and the local…

A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…

Braid Floer homology is an invariant of proper relative braid classes. Closed integral curves of 1-periodic Hamiltonian vector fields on the 2-disc may be regarded as braids. If the Braid Floer homology of associated proper relative braid…

We apply the graph complex method to vector fields depending naturally on a set of vector fields and a linear symmetric connection. We characterize all possible systems of generators for such vector-field valued operators including the…

Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models…

We consider 1-forms on, so called, essentially isolated determinantal singularities (a natural generalization of isolated ones), show how to define analogues of the Poincar\'e--Hopf index for them, and describe relations between these…

A degenerate dynamical system is characterized by a state-dependent multiplier of the time derivative of the state in the time evolution equation. It can give rise to Hamiltonian systems whose symplectic structure possesses a non-constant…

A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…