Open Access
Issue
Wuhan Univ. J. Nat. Sci.
Volume 29, Number 6, December 2024
Page(s) 523 - 528
DOI https://doi.org/10.1051/wujns/2024296523
Published online 07 January 2025

© Wuhan University 2024

Licence Creative CommonsThis is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

0 Introduction

Weighted homology is a generalization of homology theory. In general, one of the main motivations of weighted homology is distinguishing different elements in the data set, which was initially defined on a simplicial complex where each simplex is assigned a weight value[1]. Later, Horak and Jost[2] first developed a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. Ren et al[3] developed the theory of weighted persistent homology of weighted simplicial complex, extended the homology of weighted simplicial complexes to the embedded homology of weighted hypergraphs[4], and proved that weighted persistent homology can tell apart filtrations that ordinary persistent homology does not distinguish[5].

Different from simplicial complexes and hypergraphs, the directed edges in a digraph may have two directions, and there may be directed loops in a digraph. Therefore, in this sense, the topological study of digraphs has more general significance in mathematics. In 2020, Wang et al[6] studied the persistent homology of vertex-weighted digraphs. They proved the persistent weighted path homology with coefficients in a filed is independent of the choices of weights.

According to Ref. [7], a simplicial complex can be viewed as a Δ-set, and a hypergraph can be represented as a graded subset of Δ-sets. Moreover, the set of allowed elementary paths on a digraph can be expressed as a graded subset of Δ-sets. Hence, our motivation for this paper is to define the weighted embedded homology of graded sets of Δ-sets which are called as super-hypergraphs[8], study the structure of the torsion part of weighted homology groups with coefficients in ZMathematical equation, and consider the relationship between the torsion parts of weighted embedded homology groups with integer coefficients of super-hypergraphs with different weights. The framework of the paper is as follows. Firstly, we respectively review the definition of embedded homology on super-hypergraphs in Section 1 and define the weighted embedded homology on super-hypergraphs in Section 2. Secondly, in Section 3, we give a quasi-partial order and a pseudo-metric on the set of all weights on a finite set. Notably, Subsection 3.2 provides the relationship between the torsion parts of weighted embedded homology with integer coefficients of super-hypergraphs under certain weights in Theorem 1 and Theorem 2.

1 Preliminaries

Let RMathematical equation be a communicative ring with a unit. Let X={Xn}n0Mathematical equation be a ΔMathematical equation-set with face maps

d i :   X n X n - 1 , 0 i n , Mathematical equation(1)

( x 0 x 1 x n ) x 0 x ^ i x n , x 0 x 1 x n X n , Mathematical equation

such that

d i d j = d j d i + 1   f o r   i j . Mathematical equation(2)

A graded subset of XMathematical equation is a sequence of sets U={Un}n0Mathematical equation such that each UnMathematical equation is a subset of XnMathematical equation. By Ref. [8, Definition 2.9], a super-hypergraph is a pair (U,X)Mathematical equation, where XMathematical equation is a ΔMathematical equation-set and UMathematical equation is a graded subset of XMathematical equation. By Refs. [7-9], the infimum chain complex Inf*(U,X)Mathematical equation

I n f * ( U , X ) = R ( U n ) n - 1 R ( U n - 1 ) , Mathematical equation

and the supremum chain complex Sup*(U,X)Mathematical equation

S u p * ( U , X ) = R ( U n ) + n + 1 R ( U n + 1 ) , Mathematical equation

induce the same homology groups, which is called the nMathematical equation-th embedded homology on super-hypergraphs with coefficient in RMathematical equation. That is,

H n ( U , X ; R ) = H n ( I n f * ( U , X ) ) H n ( S u p * ( U , X ) ) . Mathematical equation

Let XMathematical equation and YMathematical equation be ΔMathematical equation-sets. A ΔMathematical equation-map f: XYMathematical equation is a sequence of functions f: XnYn,n0Mathematical equation, such that fdi=difMathematical equation for each 0inMathematical equation. Suppose X,YMathematical equation are ΔMathematical equation-sets and f: XYMathematical equation is a ΔMathematical equation-map. If U,VMathematical equation are graded subsets of X,YMathematical equation respectively such that f(U)VMathematical equation, f:(U,X)(V,Y)Mathematical equation is called a morphism of super-hypergraphs. Then, by Ref. [8, Proposition 2.11], fMathematical equation induces chain maps

f # I n f :   I n f * ( U , X ) I n f * ( V , Y ) , f # S u p :   S u p * ( U , X ) S u p * ( V , Y ) . Mathematical equation

The chain maps f#InfMathematical equation and f#SupMathematical equation induce homomorphisms f#InfMathematical equation and f#SupMathematical equation of homology groups, respectively, such that the following diagram commutes

Illustration

Here l is the canonical inclusion of Inf*(U,X)Mathematical equation into Sup*(U,X)Mathematical equation, and l'Mathematical equation is the canonical inclusion of Inf*(V,Y)Mathematical equation into Sup*(V,Y)Mathematical equation. Letting f*=f*InfMathematical equation (or alternatively, letting f*=f*SupMathematical equation), we obtain a homomorphism of the embedded homology groups

f * :   H * ( U ; R ) H * ( V ; R ) . Mathematical equation

The following example gives a homomorphism between embedded homology groups with coefficients in ZMathematical equation.

Example 1 Let R=Mathematical equationZMathematical equation. Consider the following two ZMathematical equation-moudules(homology groups)

M = Z Z / 2 Z / 3 Z / 9 = < x > < y ( 2,1 ) > < y ( 3,1 ) >    < y ( 3,2 ) > Mathematical equation

M ' = Z Z / 9 Z / 4 = < x ' > < y ' ( 3,2 ) > < y ' ( 2,2 ) > , Mathematical equation

Let

f ( x ) = λ x ' + μ y ' ( 3,2 ) + ν y ' ( 2,2 ) , λ , μ , ν Z , f ( y ( 2,1 ) ) = 2 y ' ( 2,2 ) , f ( y ( 3,1 ) ) = 3 y ' ( 3,2 ) , f ( y ( 3,2 ) ) = κ y ' ( 3,2 ) , κ = 0 o r   3 , Mathematical equation

then f is a homomorphism between MMathematical equation and M'Mathematical equation.

2 Weighted Embedded Homology of Super-Hypergraphs

Let XMathematical equation be a ΔMathematical equation-set. Let w: X0ZMathematical equation be an integer-valued weight. Let pi: XnX0Mathematical equation be the projection sending x0x1xnMathematical equation to the iMathematical equation-th point xiMathematical equation.

We define the weighted boundary map as:

n w = i = 0 n ( - 1 ) i ( w p i ) d i , Mathematical equation

where diMathematical equation are the face maps as defined in Eq. (1). Then,

n w :   Z < X n > Z < X n - 1 > Mathematical equation

is a homomorphism of free ZMathematical equation-modules given by

n w ( x 0 x ) = i = 0 n ( - 1 ) i w ( x i ) x 0 x ^ i x n Mathematical equation

for any x0x1xnXnMathematical equation, and extends linearly over ZMathematical equation. Moreover,

n - 1 w n w = 0 , Mathematical equation

for any n1Mathematical equation. Hence, ZMathematical equation-modules

C n = Z < X n > , Mathematical equation

with a weighted boundary map

n w : C n C n - 1 Mathematical equation

is a chain complex.

Let UMathematical equation be a graded subset of XMathematical equation. Let

I n f n w ( U , X ) = R ( U n ) ( n w ) - 1 R ( U n - 1 ) , Mathematical equation(3)

S u p n w ( U , X ) = R ( U n ) + n + 1 w R ( U n + 1 ) . Mathematical equation(4)

Then Eq. (3) and Eq. (4) are both sub-chain complexes of {Cn,nw}Mathematical equation, called the weighted infimum chain complex of UMathematical equation in XMathematical equation and the weighted supremum chain complex of UMathematical equation in XMathematical equation , respectively. By Ref. [9], the canonical inclusion

τ :   I n f n w ( U , X ) S u p n w ( U , X ) Mathematical equation

induces an isomorphism in homology;

τ * :   H n ( I n f n w ( U , X ) ) H n ( S u p n w ( U , X ) ) , Mathematical equation

which is called the weighted embedded homology of (U,X)Mathematical equation, denoted as Hnw(U,X;R).Mathematical equation

For each n0Mathematical equation, let

W n w = { x C n | λ Z , λ 0 a n d y C n + 1 s u c h t h a t λ x = n + 1 w y } , Mathematical equation

where {Cn,nw}n0Mathematical equation is a chain complex. Then by Ref. [1, Theorem 11.4], for each n0Mathematical equation, there exists e1w,e2w,,el(w)wCnMathematical equation linearly independent on ZMathematical equation, and there exists e'1w,e'2w,,e'l(w)wWn-1wMathematical equation linearly-independent on ZMathematical equation, such that;

1) Unw=<e1w,e2w,,el(w)w>,Mathematical equation

2) Wn-1w=<e'1w,e'2w,,e'l(w)w>,Mathematical equation

3) nw|Unw:UnwWn-1w,Mathematical equation

4) nw(e1wel(w)w)=(b1wbl(w)w)(e'1we'l(w)w),Mathematical equation

where biw1Mathematical equation and b1w|b2w||bl(w)wMathematical equation. Note that l(w),eiw,e'iw,biw,1il(w)Mathematical equation are all depending on the weight w: X0ZMathematical equation.

The torsion part of the nMathematical equation-homology group can be expressed as

T o r ( H n ( { C k , k w } k 0 ) ) = Z / b 1 w Z / b l ( w ) w . Mathematical equation(5)

By substituting {Ck,kw}k0Mathematical equation with Inf*w(U,X)Mathematical equation or Sup*w(U,X)Mathematical equation in Eq. (5), we have the structure of the torsion part of Hnw(U,X;R)Mathematical equation.

By Ref. [7], the path homology of digraphs can be seen as the embedded homology on super-hypergraphs. Hence, we take the path homology of digraphs as an example to illustrate that the weighted embedded homology is generally different from the unweighted embedded homology. The readers may refer to Refs. [10-13] for details on path homology of digraphs.

Example 2 As shown in Fig. 1, let GMathematical equation be a cycle with vertex set V={v0,v1,v2}Mathematical equation and directed edge set:

E = { v 0 v 1 , v 1 v 2 , v 2 v 0 } . Mathematical equation

Thumbnail: Fig. 1 Refer to the following caption and surrounding text. Fig. 1 Example 2

Let w: VZMathematical equation be a weight on GMathematical equation with w(v0)=w0,w(v1)=w1Mathematical equation and w(v2)=w2Mathematical equation. Then,

Λ 0 ( V ) = Z { v 0 , v 1 , v 2 } , Λ 1 ( V ) = Z { v 0 v 1 , v 1 v 0 , v 1 v 2 , v 2 v 1 , v 0 v 2 , v 2 v 0 } , Λ 2 ( V ) = Z { v 0 v 1 v 2 , v 0 v 1 v 0 , v 1 v 2 v 0 , v 0 v 2 v 1 , v 0 v 2 v 0 , v 1 v 2 v 1 , v 1 v 0 v 2 , v 1 v 0 v 1 , v 2 v 0 v 1 , v 2 v 0 v 2 , v 2 v 1 v 2 , v 2 v 1 v 0 } , Λ 3 ( V ) = Z { v 0 v 1 v 2 v 0 , v 0 v 1 v 2 v 1 , v 0 v 1 v 0 v 1 , v 0 v 1 v 0 v 2 , v 0 v 2 v 0 v 1 , v 0 v 2 v 0 v 2 , v 0 v 2 v 1 v 0 , v 0 v 2 v 1 v 2 , v 1 v 0 v 1 v 0 , v 1 v 0 v 1 v 2 , v 1 v 0 v 2 v 0 , v 1 v 0 v 2 v 1 , v 1 v 2 v 0 v 1 , v 1 v 2 v 0 v 2 , v 1 v 2 v 1 v 0 , v 1 v 2 v 1 v 2 , v 2 v 0 v 1 v 0 , v 2 v 0 v 1 v 2 , v 2 v 0 v 2 v 0 , v 2 v 0 v 2 v 1 , v 2 v 1 v 0 v 1 , v 2 v 1 v 0 v 2 , v 2 v 1 v 2 v 0 , v 2 v 1 v 2 v 1 } Mathematical equation

and

A 0 ( G ) = Z < v 0 , v 1 , v 2 > , A 1 ( G ) = Z < v 0 v 1 , v 1 v 2 , v 2 v 0 > , A 2 ( G ) = Z < v 0 v 1 v 2 , v 1 v 2 v 0 , v 2 v 0 v 1 > , A 3 ( G ) = Z < v 0 v 1 v 2 v 0 , v 1 v 2 v 0 v 1 , v 2 v 0 v 1 v 2 > , Mathematical equation

Since,

0 w ( v i ) = 0 , 1 w ( v i v j ) = w ( v i ) v j - w ( v j ) v i = w i v j - w j v i , 2 w ( v i v j v k ) = w i v j v k - w j v i v k + w k v i v j , 3 w ( v i v j v k v l ) = w i v j v k v l - w j v i v k v l + w k v i v j v l - w l v i v j v k , Mathematical equation

it follows that,

Ω 0 w ( G ) = Z < v 0 , v 1 , v 2 > , Ω 1 w ( G ) = A 1 ( G ) ( 1 w ) - 1 A 0 ( G ) = Z < v 0 v 1 , v 1 v 2 , v 2 v 0 > ( 1 w ) - 1 Z < v 0 , v 1 , v 2 > = Z < v 0 v 1 , v 1 v 2 , v 2 v 0 > Ω 2 w ( G ) = A 2 ( G ) ( 2 w ) - 1 A 1 ( G ) = Z < v 0 v 1 v 2 , v 1 v 2 v 0 , v 2 v 0 v 1 > ( 2 w ) - 1 Z < v 0 v 1 , v 1 v 2 , v 2 v 0 > = { 0 ,                                                 i f w 0 , w 1 , w 2 0 , Z < v 0 v 1 v 2 > ,                                     i f w 1 = 0 , w 0 , w 2 0 , Z < v 1 v 2 v 0 > ,                                     i f w 2 = 0 , w 0 , w 1 0 , Z < v 2 v 0 v 1 > ,                                      i f w 0 = 0 , w 1 , w 2 0 , Z < v 0 v 1 v 2 , v 1 v 2 v 0 > ,                          i f w 1 = w 2 = 0 , w 0 0 , Z < v 0 v 1 v 2 , v 2 v 0 v 1 > ,                         i f w 1 = w 0 = 0 , w 2 0 , Z < v 1 v 2 v 0 , v 2 v 0 v 1 > ,                         i f w 0 = w 2 = 0 , w 1 0 , Z < v 0 v 1 v 2 , v 1 v 2 v 0 , v 2 v 0 v 1 > ,       i f w 0 = w 1 = w 2 = 0 , Mathematical equation

and

Ω 3 w ( G ) = A 3 ( G ) ( 3 w ) - 1 A 2 ( G ) = Z < v 0 v 1 v 2 v 0 , v 1 v 2 v 0 v 1 , v 2 v 0 v 1 v 2 > ( 3 w ) - 1 Z < v 0 v 1 v 2 , v 1 v 2 v 0 , v 2 v 0 v 1 > = { 0 ,                                                                                      i f a t l e a s t t w o o f w 0 , w 1 , w 2 0 , Z < v 0 v 1 v 2 v 0 > ,                                            i f w 1 = w 2 = 0 , w 0 0 , Z < v 1 v 2 v 0 v 1 > ,                                           i f w 2 = w 0 = 0 , w 1 0 , Z < v 2 v 0 v 1 v 2 > ,                                           i f w 0 = w 1 = 0 , w 2 0 , Z < v 0 v 1 v 2 v 0 , v 1 v 2 v 0 v 1 , v 2 v 0 v 1 v 2 > , i f w 0 = w 1 = w 2 = 0 . Mathematical equation

Hence,

H 1 ( G , w ; Z ) = K e r 1 w | Ω 1 w ( G ) / I m 2 w | Ω 2 w ( G ) = 0 , Mathematical equation(6)

for w1=0Mathematical equation and w0,w20Mathematical equation. By Ref. [10, Proposition 4.7], Eq. (6) is different from the unweighted 1-dimensional path homology group H1(G;Z)ZMathematical equation.

However, by Refs. [3,6,7], the following lemma holds.

Lemma 1   (Ref. [6, Theorem 2.2]) Let Mathematical equation be any field. Let Cn(U,X;)=Cn(U,X;Z)Mathematical equation. Then for any nonvanishing weight wMathematical equation on XMathematical equation,

H * w ( U , X ; ) = H * ( U , X ; ) . Mathematical equation

This implies that the weighted homology with Mathematical equation-coefficients does not depend on the choice of wMathematical equation.

Hence, by Lemma 1, we have

Corollary 1   The free part of H*w(U,X;Z)Mathematical equation does not depend on the choice of non-vanishing weight wMathematical equation.

Proof   The free part of H*w(U,X;Z)Mathematical equation is ZrMathematical equation, where r=dimΘH*w(U,X;Q)Mathematical equation. By Lemma 1, rMathematical equation does not depend on wMathematical equation. Hence, the free part of H*w(U,X;Z)Mathematical equation does not depend on the choice of wMathematical equation.

3 Main Results

In this section, we give a quasi-partial order and a pseudo-metric on the set made up of all non-vanishing weights on a finite set and consider the morphisms of weighted ΔMathematical equation-sets.

3.1 Vertex Weights on a Finite Set

Let VMathematical equation be a finite set. Let w,w',w : VZ\{0}Mathematical equation be non-vanishing weights on VMathematical equation. Using the following notations:

(i) w=w'Mathematical equation if for an arbitrary vertex vVMathematical equation, w(v)=w'(v)Mathematical equation;

(ii) ww'Mathematical equation if there exists a vertex vVMathematical equation such that w(v)w'(v)Mathematical equation;

(iii) ww'Mathematical equation if for an arbitrary vertex vVMathematical equation, w(v)=±w'(v)Mathematical equation;

(iv) ww'Mathematical equation if there exists a vertex vVMathematical equation such that |w(v)||w'(v)|Mathematical equation ;

(v) ww'Mathematical equation if for an arbitrary vertex vVMathematical equation, w(v)|w'(v)Mathematical equation (w(v)Mathematical equation divides w'(v)Mathematical equation);

(vi) w<w'Mathematical equation if ww'Mathematical equation and ww'Mathematical equation.

Then

(i) for any weight wMathematical equation on VMathematical equation, wwMathematical equation and wwMathematical equation and w=wMathematical equation ;

(ii) for any weights wMathematical equation and w'Mathematical equation on VMathematical equation, if ww'Mathematical equation and w'wMathematical equation, then ww'Mathematical equation;

(iii) for any weights w,w',wMathematical equation on VMathematical equation, if ww'Mathematical equation and w'wMathematical equation , then wwMathematical equation .

Hence, "Mathematical equation" is a quasi-partial order on the set SVMathematical equation of all the weights on VMathematical equation. A weight wMathematical equation on VMathematical equation is said minimal, if for any weight w'Mathematical equation on VMathematical equation, ww'Mathematical equation. That is,

w Mathematical equation is minimal Mathematical equationw(v)=±1Mathematical equation for any vertex vVMathematical equation.

Two weights wMathematical equation and w'Mathematical equation with w<w'Mathematical equation are said adjacent if there is no weight wMathematical equation on VMathematical equation such that w<w<w'Mathematical equation. Hence, w<w'Mathematical equation are adjacent if and only if there exists a unique vertex vVMathematical equation such that the following both hold:

(i) w'(v)=±pw(v)Mathematical equation for some prime pMathematical equation;

(ii) w'(u)=±pw(u)Mathematical equation for any uv,uVMathematical equation.

Therefore, we have a pseudo-metric dMathematical equation on SVMathematical equation such that for any two weights wMathematical equation and w'Mathematical equation on VMathematical equation ,

(i) d(w,w')=0Mathematical equation if ww'Mathematical equation ;

(ii) d(w,w')=1Mathematical equation if wMathematical equation and w'Mathematical equation are adjacent;

(iii) d(w,w')=inf{|γ||γ=w0w1wk-1wk ,where w0=w,Mathematical equationwk=w' , andwi-1 andwiareadjacent}Mathematical equation .

Here |γ|=kMathematical equation if γ=w0w1wk-1wkMathematical equation .

Note that any wMathematical equation is connected to the minimal weights by certain γMathematical equation. Hence, d(w,w')Mathematical equation make sense for any weights wMathematical equation and w'Mathematical equation.

3.2 Morphisms of Super-Hypergraphs

Let XMathematical equation and X'Mathematical equation be ΔMathematical equation-sets. Let w: X0Z\{0}Mathematical equation and w': X0'Z\{0}Mathematical equation be the weights on XMathematical equation and X'Mathematical equation, respectively. De-fine a map f: X0X0'Mathematical equation such that for each xiX0Mathematical equation,

w ' ( f ( x i ) ) | w ( x i ) , Mathematical equation(7)

and the weight of (x0x1xn)XnMathematical equation is defined to be the product of weights of all vertices xiMathematical equation, 0inMathematical equation. Obviously, fMathematical equation is a ΔMathematical equation-map between XMathematical equation and X'Mathematical equation. Furthermore, according to Ref. [6, Definition 1.1], since fMathematical equation satisfies Eq. (7), it is referred to as the morphism between weighted ΔMathematical equation-sets. Let U,U'Mathematical equation be graded subsets of X, X'Mathematical equation, respectively. Suppose f(U)U'Mathematical equation, then, fMathematical equation is a weighted morphism of super-hypergraphs.

Lemma 2   (Ref. [6, Theorem 1.1]) A morphism of weighted ΔMathematical equation-sets induces a homomorphism of weighted embedded homology on super-hypergraphs

f * :   H n w ( U , X ; Z ) H n w ' ( U ' , X ' ; Z ) , n 0 . Mathematical equation

Notably, in Lemma 2, let X=X'Mathematical equation,U=U'Mathematical equation and fMathematical equation be the identity map τMathematical equation on XMathematical equation. We have that

Corollary 2   Let wMathematical equation and w'Mathematical equation be two weights on XMathematical equation and w'wMathematical equation. Then, the identity map τMathematical equation on XMathematical equation induces a homomorphism

τ * :   H n w ( U , X ; Z ) H n w ' ( U , X ; Z ) , n 0 . Mathematical equation

The following results are based on Corollary 1 and Corollary 2.

Theorem 1   Let wMathematical equation and w'Mathematical equation be two weights on XMathematical equation and w'wMathematical equation. Then, the homomorphism τ*Mathematical equation splits into a direct sum

τ * = i d ( p p r i m e T o r p ( τ * ) ) , Mathematical equation

where idMathematical equation is the identity map on the free part of Hnw(U,X;Z)Mathematical equation and Torp(τ*)Mathematical equation is the restriction of τ*Mathematical equation to the pMathematical equation-torsion part

T o r p ( τ * ) :   T o r p ( H n w ( U , X ; Z ) ) T o r p ( H n w ' ( U , X ; Z ) ) . Mathematical equation

Proof   We observe that the τ*Mathematical equation sends the pMathematical equation-torsion part of Hnw(U,X;Z)Mathematical equation to the pMathematical equation-torsion part of Hnw'(U,X;Z)Mathematical equation. Moreover, by Corollary 1 τ*Mathematical equation sends the pMathematical equation-torsion part of Hnw(U,X;Z)Mathematical equation identically to the pMathematical equation-torsion part of Hnw'(U,X;Z)Mathematical equation. The splitting follows.

Moreover, we have

Theorem 2   Suppose for each vVMathematical equation, w(v)=pλw'(v)Mathematical equation. Here pMathematical equation is a fixed prime and λMathematical equation is a fixed positive integer. Then, for any prime qMathematical equation,

T o r q ( H n w ( U , X ; Z ) ) = { p λ T o r q ( H n w ' ( U , X ; Z ) ) , i f q = p , T o r q ( H n w ' ( U , X ; Z ) ) , i f q p . Mathematical equation

Moreover, Torq(τ*)Mathematical equation is the identity map if qpMathematical equation and is the canonical projection αpλαMathematical equation if q=pMathematical equation.

Proof   We observe that

K e r ( n w ) = K e r ( n w ' ) Mathematical equation

and

I m ( n w ) = p λ I m ( n w ' ) . Mathematical equation

The assertion follows.

Finally, we give an example to illustrate the crucial role of weights in Theorem 2, as shown in Fig. 2. We assign different weights to the vertices of the digraph in Example 2.

Thumbnail: Fig. 2 Refer to the following caption and surrounding text. Fig. 2 Example 3

Example 3 Let GMathematical equation be a digraph with the vertex set {v0,v1,v2}Mathematical equation and the directed edge set

{ v 0 v 1 , v 1 v 2 , v 2 v 0 } . Mathematical equation

Let w,w'Mathematical equation be two weight functions on GMathematical equation such that w(v0)=1,w(v1)=2,w(v2)=3Mathematical equation and w'(v0)=w'(v1)=w'(v2)=1Mathematical equation.

Consider the two weighted digraphs (G,w)Mathematical equation and (G,w')Mathematical equation. Let f be the morphism between (G,w)Mathematical equation (abbreviated as GMathematical equation) and (G,w')Mathematical equation (abbreviated as G'Mathematical equation) such that f(vi)=vi,0i2Mathematical equation. By calculation, we have that

1 w ( 3 v 0 v 1 + v 1 v 2 + 2 v 2 v 0 ) = 3 ( v 1 - 2 v 0 ) + 2 v 2 - 3 v 1 + 2 ( 3 v 0 - v 2 ) = 0 Mathematical equation

and

1 w ' ( 3 v 0 v 1 + v 1 v 2 + 2 v 2 v 0 ) = 3 ( v 1 - v 0 ) + v 2 - v 1 + 2 ( v 0 - v 2 ) = 2 v 1 - v 0 - v 2 . Mathematical equation

Hence, (3v0v1+v1v2+2v2v0)Ker1wMathematical equation and (3v0v1+v1v2+2v2v0)Ker1w'.Mathematical equation

Remark 1   In Example 3, we have that

K e r ( 1 w ) K e r ( 1 w ' ) , I m 2 w = I m 2 w ' , Mathematical equation

and

H 1 w ( G ; Z ) = Z , H 1 w ' ( G ' ; Z ) = Z . Mathematical equation

References

  1. Mac R J, Dawson G. Homology of weighted simplicial complexes[J]. Cahiers de Topologie et Géométrie Différentielle Catégoriques, 1990, 31 (3): 229-243. [MathSciNet] [Google Scholar]
  2. Horak D, Jost J. Spectra of combinatorial Laplace operators on simplicial complexes[J]. Advances in Mathematics, 2013, 244: 303-336. [CrossRef] [MathSciNet] [Google Scholar]
  3. Ren S Q, Wu C Y, Wu J. Weighted persistent homology[J]. Rocky Mountain Journal of Mathematics, 2018, 48(8): 2661-2687. [MathSciNet] [Google Scholar]
  4. Ren S Q, Wu C Y, Wu J. Hodge decompositions for weighted hypergraphs[EB/OL]. [2018-10-14]. http://arxiv.org/abs/1805.11331. [Google Scholar]
  5. Ren S Q, Wu C Y, Wu J. Computational tools in weighted persistent homology[J]. Chinese Annals of Mathematics, Series B, 2021, 42(2): 237-258. [CrossRef] [MathSciNet] [Google Scholar]
  6. Wang C, Ren S Q, Lin Y. Persistent homology of vertex-weighted digraphs[J]. Advance in Mathematics, 2020, 49(6): 737-755(Ch). [Google Scholar]
  7. Wang C, Ren S Q. Simplicial descriptions for digraphs and their path homology from the point of Δ-sets[J]. Mathematics in Practice and Theory, 2019, 49(22): 238-247(Ch). [Google Scholar]
  8. Grbić J, Wu J, Xia K L, et al. Aspects of topological approaches for data science[J]. Foundations of Data Science, 2022, 4(2): 165-216. [CrossRef] [MathSciNet] [Google Scholar]
  9. Bressan S, Li J Y, Ren S Q, et al. The embedded homology of hypergraphs and applications[J]. Asian Journal of Mathematics, 2019, 23(3): 479-500. [CrossRef] [MathSciNet] [Google Scholar]
  10. Grigor'yan A, Lin Y, Muranov Y, et al. Homologies of path complexes and digraphs[EB/OL]. [2012-07-12]. http://arxiv.org/abs/1207.2834. [Google Scholar]
  11. Grigoryan A, Lin Y, Muranov Y, et al. Path complexes and their homologies[J]. Journal of Mathematical Science, 2020, 248(5): 564-599. [CrossRef] [Google Scholar]
  12. Grigoryan A, Lin Y, Muranov Y, et al. Cohomology of digraphs and (undirected) graphs[J]. Asian Journal of Mathematics, 2015, 19(5): 887-932. [CrossRef] [MathSciNet] [Google Scholar]
  13. Grigoryan A, Muranov Y, Yau S T. Homologies of digraphs and Kunneth formulas[J]. Commun Anal Geom, 2017, 25(5): 969-1018. [CrossRef] [Google Scholar]

All Figures

Thumbnail: Fig. 1 Refer to the following caption and surrounding text. Fig. 1 Example 2
In the text
Thumbnail: Fig. 2 Refer to the following caption and surrounding text. Fig. 2 Example 3
In the text

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.