Home Mathematics Existence and uniqueness of solutions to the norm minimum problem on digraphs
Article Open Access

Existence and uniqueness of solutions to the norm minimum problem on digraphs

  • Chong Wang EMAIL logo
Published/Copyright: October 6, 2022

Abstract

In this article, based on the path homology theory of digraphs, which has been initiated and studied by Grigor’yan, Lin, Muranov, and Yau, we prove the existence and uniqueness of solutions to the problem

w = min u Ω 2 ( G ) , u 0 1 2 u w 2 2 + u 1

for w H 1 ( G ) and any digraph G generated by squares and triangles belonging to the same cluster.

MSC 2010: 05C20; 05C50

1 Introduction

A digraph G is a pair ( V , E ) , where V is a finite set known as the set of vertices and E V × V { diag } is the set of directed edges. For vertices a , b V , the pair ( a , b ) E will be denoted by a b . In particular, a square is a digraph with four distinct vertices a , b , c , and d such that a b , b d , a c , and c d . A triangle is a digraph with three distinct vertices a , b , and c such that a b , b c , and a c .

An elementary p -path (or p -path for short) on G is a sequence { i k } k = 0 p of p + 1 vertices. If all pairs ( i k , i k + 1 ) are edges, then the p -path is called allowed.

Let K be a field. Let Λ p ( V ) be the K -linear space consisting of all the formal linear combinations of all elementary p -paths with the coefficients in K . An elementary p -path i 0 i p as an element of Λ p is denoted as e i 0 i p . The boundary operator p : Λ p ( V ) Λ p 1 ( V ) is a K -linear map such that for any elementary path e i 0 i p ,

e i 0 i n = q = 0 p ( 1 ) q e i 0 i q ^ i n ,

where i q ^ means omission of the index i q .

Let A p be the subspace of Λ p ( V ) , which consists of all the formal linear combinations of allowed paths on G , that is,

A p ( G ) = span { e i 0 i p : i 0 i p is allowed } .

For an element v = v i 0 i p e i 0 i p A p ( G ) , v is called a ( a , b )- c l u s t e r if, for any v i 0 i p 0 , i 0 = a and i p = b , where a and b are two fixed vertices in V .

Note that the boundary of an allowed path may not be allowed. Nevertheless, A p ( G ) has the following subspace:

Ω p ( G ) = { x A p ( G ) : x A p 1 ( G ) } ,

which satisfies p Ω p ( G ) Ω p 1 ( G ) for all p 1 . The elements in Ω p ( G ) are called -invariant p -paths. The path homology of G referred to in this article is the homology of the chain complex { Ω p ( G ) , p } p 0 , denoted as H p ( G , K ) or H p ( G ) for short (cf. [1,2,3, 4,5,6]).

In this article, our motivation is to prove the existence and uniqueness of solutions to the problem

w = min u Ω 2 , u 0 1 2 u w 2 2 + u 1

for w H 1 ( G ) and study the “smallest” representative element in the path homology class of digraphs under the given norm. It should be noted that since Ω p ( G ) has no unified form, we only consider the case of w H 1 ( G ) for digraphs that are generated by triangles or squares of the same cluster.

In information theory, signal processing, statistics, machine learning, and optimization theory, there is a lot of literature on analyzing, solving, and applying 1-norm minimization (cf. [7,8, 9,10,11, 12,13]). Our idea is to apply the existing results in signal theory, convex programming, and optimization theory to the study of path homology groups of digraphs. The main result of this article is as follows.

Theorem 1.1

Suppose G is a finite digraph generated by squares or triangles that belong to the same cluster. Then, for any representative element w of the homology class in H 1 ( G ) , the problem

w = min u Ω 2 ( G ) , u 0 1 2 u w 2 2 + u 1 ( )

has a unique solution u such that ( A T ) I ( w Au ) = sign ( u I ) , where A is the matrix of the boundary operator 2 : Ω 2 ( G ) Ω 1 ( G ) and I supp ( u ) .[1]

Finally, in Section 4, we illustrate the “smallest” representative element in the homology group H 1 ( G ) of some simple digraphs by examples.

2 Auxiliary results for the main theorem

In this section, before proving the main theorem, we give some auxiliary results. First,

Lemma 2.1

Let G = ( V , E ) be a digraph generated either by squares that belong to the same cluster or by triangles that belong to the same cluster. Then, the matrix A of the boundary operator 2 : Ω 2 ( G ) Ω 1 ( G ) is a full-column rank matrix.

Proof

Case 1. G is generated by squares that belong to the same cluster (Figure 1). Then,

Ω 1 ( G ) = A 1 ( G ) = span { e 12 , e 13 , , e 1 ( n 1 ) , e 2 n , e 3 n , , e ( n 1 ) n } , Ω 2 ( G ) = span { e 12 n e 13 n , e 13 n e 14 n , , e 1 ( n 2 ) n e 1 ( n 1 ) n } , dim Ω 1 ( G ) = 2 ( n 2 ) , dim Ω 2 ( G ) = n 3

and

A 2 ( n 2 ) × ( n 3 ) = 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 1 .

Hence, R ( A ) = n 3 , and A is a full-column rank matrix.

Case 2. G is generated by triangles that belong to the same cluster. Then,

Ω 1 ( G ) = A 1 ( G ) = span { e 12 , e 13 , , e 1 ( n 1 ) , e 1 n , e 2 n , e 3 n , , e ( n 1 ) n } , Ω 2 ( G ) = span { e 12 n , e 13 n , , e 1 ( n 1 ) n } , dim Ω 1 ( G ) = 2 ( n 2 ) + 1 , dim Ω 2 ( G ) = n 2

and

A ( 2 ( n 2 ) + 1 ) × ( n 2 ) = 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 1 1 1 1 0 0 0 0 0 1 0 0 0 0 0 1 0 0 0 0 0 0 1 .

Hence, R ( A ) = n 2 , and A is a full-column rank matrix.□

Figure 1 
               Case 1 and Case 2.
Figure 1

Case 1 and Case 2.

Remark 1

In fact, by [1], for digraph G discussed above, dim H 0 ( G ) = 1 , dim H 1 ( G ) = 0 , and dim H p ( G ) = 0 ( p 2 ). Let f be a self-map on G (a digraph map which maps G to G ). Then, the Lefschetz number Λ ( f ) = trace f H 0 trace f H 1 + trace f H 2 = 1 0 . Therefore, similar to [14], f has a fixed point.

Second, by [12], we have the following lemma.

Lemma 2.2

(cf. [12]). Let f be a strictly convex function. If f ( A x b ) + x 1 is constant on a convex set S , then both A x b and x 1 are constant on S .

3 Proof of the main theorem

In this section, we prove the existence and uniqueness of solutions to the minimization problem.

Proof of Theorem 1.1

Step 1. Existence.

Case 1. G is generated by squares that belong to the same cluster. Then, for any given one-dimensional closed path w H 1 ( G ) ,

w = l 1 e 12 + l 2 e 13 + + l n 2 e 1 ( n 1 ) + l 1 e 2 n + + l n 2 e ( n 1 ) n ,

where l i , l i K , 1 i n 2 .

Since

0 = w = ( l 1 + l 2 + + l n 2 ) e 1 + ( l 1 l 1 ) e 2 + + ( l n 2 l n 2 ) e n 1 + ( l 1 + + l n 2 ) e n ,

it follows that

l 1 + l 2 + + l n 2 = 0 l 1 = l 1 l 2 = l 2 l n 2 = l n 2 l 1 + l 2 + + l n 2 = 0

and

w = l 1 l 2 ( l 1 + l 2 + + l n 3 ) l 1 l 2 ( l 1 + l 2 + + l n 3 ) .

Let

0 u = span { e 12 n e 13 n , e 13 n e 14 n , , e 1 ( n 2 ) n e 1 ( n 1 ) n } Ω 2 , u = x 1 ( e 12 n e 13 n ) + x 2 ( e 13 n e 14 n ) + + x n 3 ( e 1 ( n 2 ) n e 1 ( n 1 ) n ) , x i K

and

f 1 ( x 1 , x 2 , , x n 3 ) = 1 2 u w 2 2 + u 1 = 1 2 Au w 2 2 + u 1 = ( x 1 l 1 ) 2 + ( x 2 x 1 l 2 ) 2 + + ( x n 3 x n 4 l n 3 ) 2 + ( l 1 + l 2 + + l n 3 x n 3 ) 2 + i = 1 n 3 x i

= i = 1 n 3 2 x i 2 2 i = 1 n 4 x i x i + 1 + i = 1 n 3 l i 2 + i = 1 n 3 l i 2 + i = 1 n 3 x i + 2 i = 1 n 4 ( l i + 1 l i ) x i 2 ( l 1 + l 2 + + l n 4 + 2 l n 3 ) x n 3 .

Then, the Hessian matrix of f 1 at any point ( x 1 , x 2 , , x n 3 ) K n 3 is given as follows:

( H 1 ) ( n 3 ) × ( n 3 ) = 4 2 0 0 0 0 0 2 4 2 0 0 0 0 0 2 4 2 0 0 0 0 0 0 0 4 2 0 0 0 0 0 2 4 2 0 0 0 0 0 2 4 .

Obviously, H 1 is a positive definite matrix and ( h 11 ) H 1 > 0 . Thus, f 1 has the minimum points. That is, there exists a solution to the problem ( ) for Case 1.

Case 2. G is generated by triangles that belong to the same cluster. Then, for any given one-dimensional closed path w H 1 ( G ) ,

w = l 1 e 12 + l 2 e 13 + + l n 2 e 1 ( n 1 ) + l n 1 e 1 n + l 1 e 2 n + + l n 2 e ( n 1 ) n ,

where l i , l i K , 1 i n 2 .

Since w = 0 , it follows that

l i = l i , i = 1 , 2 , , n 2 l 1 + l 2 + + l n 1 = 0

and

w ( 2 ( n 2 ) + 1 ) × 1 = l 1 l 2 l n 2 ( l 1 + l 2 + + l n 2 ) l 1 l 2 l n 2 .

Let

0 u = span { e 12 n , e 13 n , , e 1 ( n 1 ) n } Ω 2 ( G ) , u = x 1 e 12 n + x 2 e 13 n + + x n 2 e 1 ( n 1 ) n , x i K

and

f 2 ( x 1 , x 2 , , x n 2 ) = 1 2 u w 2 2 + u 1 = 1 2 Au w 2 2 + u 1 = ( x 1 l 1 ) 2 + ( x 2 l 2 ) 2 + + ( x n 2 l n 2 ) 2 + i = 1 n 2 x i + 1 2 [ x 1 + + x n 2 ( l 1 + + l n 2 ) ] 2

= i = 1 n 2 3 2 x i 2 2 i = 1 n 2 l i x i ( l 1 + + l n 2 ) i = 1 n 2 x i + i = 1 n 2 x i + i = 1 n 2 3 2 l i 2 + 1 i j n 2 x i x j + 1 i < j n 2 l i l j .

Then, the Hessian matrix of f 2 is given as follows:

( H 2 ) ( n 2 ) × ( n 2 ) = 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 .

Similar to Case 1, we have that the matrix H 2 is also a positive definite matrix and ( h 11 ) H 2 > 0 . Hence, f 2 has the minimum points, and there exists a solution to the problem ( ) for Case 2.

Step 2. Uniqueness. For any given w , by Step 1, the set of solutions of problem ( ) is not empty. Since f = 1 2 2 2 is a strictly convex function, the problem ( ) is a convex problem. Hence, by Lemma 2.2, Au w = Constant .

On the other hand, by Lemma 2.1, the matrix A of 2 : Ω 2 ( G ) Ω 1 ( G ) is a full-column rank matrix. Thus, if Au = Au , then u = u . That is, the solution to the problem ( ) is unique.

Step 3. We will prove the property of the solution of ( ) in Theorem 1.1 by solving linear equations.

For Case 1 of Step 1, by the structural characteristics of f 1 , it is sufficient to consider the following cases.

(1) Each x i 0 ( i = 1 , 2 , , n 3 ) . Then,

f x 1 = 4 x 1 2 x 2 + 2 ( l 2 l 1 ) + 1 = 0 f x 2 = 4 x 2 2 x 1 2 x 3 + 2 ( l 3 l 2 ) + 1 = 0 f x 3 = 4 x 3 2 x 2 2 x 4 + 2 ( l 4 l 3 ) + 1 = 0 f x n 4 = 4 x n 4 2 x n 5 2 x n 3 + 2 ( l n 3 l n 4 ) + 1 = 0 f x n 3 = 4 x n 3 2 x n 4 2 ( l 1 + l 2 + + l n 4 + 2 l n 3 ) + 1 = 0 .

By the first equation, 2 x 2 = 4 x 1 + 2 ( l 2 l 1 ) + 1 . Substituting it into the second equation up to the ( n 3 ) -th equation, we have that

2 x 3 = 6 x 1 4 l 1 + 2 l 2 + 2 l 3 + 3 , 2 x 4 = 8 x 1 6 l 1 + 2 ( l 2 + l 3 + l 4 ) + 6 , 2 x 5 = 10 x 1 8 l 1 + 2 ( l 2 + + l 5 ) + 10 , 2 x i = 2 i x 1 2 ( i 1 ) l 1 + 2 ( l 2 + + l i ) + i ( i 1 ) 2 , 2 i n 3 .

Hence,

x 1 = l 1 n 3 4 , x 2 = l 1 + l 2 n 4 2 , x 3 = l 1 + l 2 + l 3 3 n 5 4 , x 4 = l 1 + l 2 + l 3 + l 4 4 n 6 4 , x i = k = 1 i l k i ( n i 2 ) 4 , i = 1 , , n 3 .

Therefore,

u = x 1 x 2 x i x n 3 = l 1 n 3 4 l 1 + l 2 n 4 2 l 1 + l 2 + + l i i ( n i 2 ) 4 l 1 + l 2 + + l n 3 n 3 4 .

(2) x 1 0 and x i 0 ( i = 2 , 3 , , n 3 ). Then,

u = x 1 x 2 x i x n 3 = l 1 ( n 3 ) ( n 6 ) 4 ( n 2 ) l 1 + l 2 ( n 4 ) 2 2 ( n 2 ) l 1 + l 2 + + l i ( n i 2 ) ( i n 2 i 4 ) 4 ( n 2 ) l 1 + l 2 + + l n 3 n 2 5 n + 2 4 ( n 2 ) .

(3) x 2 0 and x i 0 ( i = 1 , 3 , , n 3 ). Then,

u = x 1 x 2 x 3 x n 4 x n 3 = l 1 n 2 9 n + 20 2 ( 2 n 4 ) l 1 + l 2 2 n 2 20 n + 44 2 ( 2 n 4 ) l 1 + l 2 + l 3 3 n 2 29 n + 64 2 ( 2 n 4 ) l 1 + l 2 + + l n 4 2 n 2 14 n + 8 2 ( 2 n 4 ) l 1 + l 2 + + l n 3 n 2 7 n + 4 2 ( 2 n 4 ) ,

x j = k = 1 j l k n 2 j + ( 2 n ) j 2 ( 4 j + 8 ) n + 10 j + 16 2 ( 2 n 4 ) , j 2 .

(4) x n 3 0 and x i 0 ( i = 1 , 2 , , n 4 ). Then,

u = x 1 x 2 x 3 x n 4 x n 3 = l 1 n 2 5 n + 2 2 ( 2 n 4 ) l 1 + l 2 2 n 2 12 n + 8 2 ( 2 n 4 ) l 1 + l 2 + l 3 3 n 2 21 n + 18 2 ( 2 n 4 ) l 1 + l 2 + + l n 4 2 n 2 16 n + 32 2 ( 2 n 4 ) l 1 + l 2 + + l n 3 n 2 9 n + 18 2 ( 2 n 4 ) ,

x j = k = 1 j l k j [ n 2 ( j + 4 ) n + 2 j ] 2 ( 2 n 4 ) , j 1 .

Hence, by calculation, we have that ( A T ) I ( w Au ) = sign ( u I ) , where I supp ( u ) for all cases. Therefore, for any given w , by the uniqueness of solutions to the problem ( ) , the unique solution u must be one of all possible cases satisfying ( A T ) I ( w Au ) = sign ( u I ) , where I supp ( u ) .

For Case 2 of Step 1, consider the following cases.

(1) Each x i 0 ( i = 1 , 2 , , n 2 ) . Then,

f x 1 = 3 x 1 ( 3 l 1 + l 2 + + l n 2 ) + x 2 + x 3 + + x n 2 + 1 = 0 f x 2 = 3 x 2 ( l 1 + 3 l 2 + l 3 + + l n 2 ) + x 1 + x 3 + + x n 2 + 1 = 0 f x 3 = 3 x 3 ( l 1 + l 2 + 3 l 3 + l 4 + + l n 2 ) + x 1 + x 2 + x 4 + + x n 2 + 1 = 0 f x n 2 = 3 x n 2 ( l 1 + l 2 + + l n 3 + 3 l n 2 ) + x 1 + x 2 + + x n 3 + 1 = 0 .

Hence,

u = x 1 x 2 x n 2 = l 1 1 n l 2 1 n l n 2 1 n .

(2) Some x i 0 . Without loss of generality, x 1 0 and x i 0 ( i = 2 , 3 , , n 3 ). Then,

u = x 1 x 2 x n 2 = l 1 + n 2 n l 2 2 n l 3 2 n l n 2 2 n .

Then, we also have that the unique solution u of the problem ( ) satisfies ( A T ) I ( w Au ) = sign ( u I ) , where I supp ( u ) .

Therefore, Theorem 1.1 is proved.□

Remark 2

The conclusion of Theorem 1.1 is independent of the selection of the basis of Ω 2 ( G ) .

Furthermore, by the partitioned matrix, we have the following corollary.

Corollary 3.1

Let G = ( V , E ) be a digraph generated by clusters satisfying the following conditions:

  1. each cluster is composed of different squares or triangles;

  2. different clusters intersect at most at one vertex.

Then the matrix A of the boundary operator 2 : Ω 2 ( G ) Ω 1 ( G ) is a full column rank matrix and there is a unique solution u to the problem ( ) satisfying ( A T ) I ( w Au ) = sign ( u I ) where I supp ( u ) .

4 Examples

In this section, we first show how coefficients and norms play an important role in the problem ( ) .

Example 4.1

Let G be a digraph as follows (Figure 2). Then,

Ω 2 ( G ) = span { e 125 e 135 , e 135 e 145 } .

Let

w = [ 4 ( e 125 e 145 ) ] = 4 ( e 12 e 14 + e 25 e 45 )

be a one-dimensional closed path on G . Suppose

u = x 1 ( e 125 e 135 ) + x 2 ( e 135 e 145 ) Ω 2 ( G ) .

Then,

u w = ( x 1 4 ) e 12 + ( x 2 x 1 ) e 13 + ( 4 x 2 ) e 14 + ( x 1 4 ) e 25 + ( x 2 x 1 ) e 35 + ( 4 x 2 ) e 45 .

Hence, u w 0 depends on whether the three formulas ( x 1 4 ) , ( x 2 x 1 ) , and ( 4 x 2 ) are zero or not, and as long as two of the three formulas are zero, the third one must be zero. Thus, it is sufficient to consider the following cases:

  1. If x 1 = 4 , x 2 = 4 , u w 0 + u 1 = 8 ;

  2. If x 1 = 4 , x 2 4 , u w 0 + u 1 = 4 + 4 + x 2 ;

  3. If x 2 = x 1 , x 1 4 , u w 0 + u 1 = 4 + 2 x 1 ;

  4. If x 2 = 4 , x 1 4 , u w 0 + u 1 = 4 + 4 + x 1 ;

  5. If x 1 4 , x 2 4 , x 2 x 1 , u w 0 + u 1 = 6 + x 1 + x 2 .

Therefore, there exists no non-zero solution of the problem

min { u w 0 + u 1 }

in R or Q .

Consider another closed 1-path

w = [ 1 2 ( e 125 e 135 ) + 4 ( e 135 e 145 ) ] = 1 2 ( e 12 + e 25 ) + 7 2 ( e 13 + e 35 ) 4 ( e 14 + e 45 ) .

Then, the minimum points of min u Ω 2 ( G ) , u 0 { u w 0 + u 1 } are not unique. Specifically,

u w = x 1 1 2 e 12 + x 2 x 1 7 2 e 13 + ( 4 x 2 ) e 14 + x 1 1 2 e 25 + x 2 x 1 7 2 e 35 + ( 4 x 2 ) e 45 .

Similarly, consider the following cases:

  1. If x 1 = 1 2 , x 2 = 4 , u w 0 + u 1 = 1 2 + 4 = 9 2 ;

  2. If x 1 = 1 2 , x 2 4 , u w 0 + u 1 = 4 + 1 2 + x 2 9 2 ;

  3. If x 2 = 4 , x 1 1 2 , u w 0 + u 1 = 4 + 4 + x 1 8 ;

  4. If x 2 x 1 = 7 2 , x 1 1 2 ( x 2 4 ) , u w 0 + u 1 = 4 + x 1 + x 1 + 7 2 4 + 7 2 ;

  5. If x 1 1 2 , x 2 4 , x 2 x 1 7 2 , u w 0 + u 1 = 6 + x 1 + x 2 6 .

Hence, min f ( x 1 , x 2 ) = 9 2 when u = 1 2 4 or 1 2 0 .

Next, for given digraphs, we try to find the “smallest” representative element in the homology class H 1 ( G ) with coefficients in any field K (in particular, K = Q or R ).

Figure 2 
               Example 4.1.
Figure 2

Example 4.1.

Example 4.2

Let G be the digraph in Example 4.1. Then,

Ω 2 ( G ) = pan { e 125 e 135 , e 135 e 145 } .

For any element u Ω 2 ( G ) , it can be written as follows:

u = x 1 ( e 125 e 135 ) + x 2 ( e 135 e 145 ) , x 1 , x 2 K .

Since dim H 1 ( G ) = 0 , it follows that

H 1 ( G ) = { [ 0 ] } = { [ ( e 12 + e 25 ) ( e 14 + e 45 ) ] } = { [ ( e 13 + e 35 ) ( e 14 + e 45 ) ] } = { [ ( e 12 + e 25 ) ( e 13 + e 35 ) ] } .

Consider the following closed 1-paths.

  1. w = ( e 12 + e 25 ) ( e 13 + e 35 ) . Then,

    f ( x 1 , x 2 ) = 1 2 u w 2 2 + u 1 = ( x 1 1 ) 2 + ( x 2 x 1 + 1 ) 2 + x 2 2 + x 1 + x 2 .

    Hence, when u = x 1 x 2 = 3 4 0 , w = min f ( x 1 , x 2 ) = 7 8 .

  2. w = ( e 13 + e 35 ) ( e 14 + e 45 ) . Then,

    f ( x 1 , x 2 ) = 1 2 u w 2 2 + u 1 = x 1 2 + ( x 2 x 1 1 ) 2 + ( 1 x 2 ) 2 + x 1 + x 2 .

    Hence, when u = x 1 x 2 = 0 3 4 , w = min f ( x 1 , x 2 ) = 7 8 .

  3. w = ( e 12 + e 25 ) ( e 14 + e 45 ) . Then,

    f ( x 1 , x 2 ) = 1 2 u w 2 2 + u 1 = ( x 1 1 ) 2 + ( x 2 x 1 ) 2 + ( 1 x 2 ) 2 + x 1 + x 2 .

    Hence, when u = x 1 x 2 = 1 2 1 2 , w = min f ( x 1 , x 2 ) = 3 2 .

Remark 3

By Example 4.2, we know that in all intuitively visible one-dimensional closed paths

( e 12 + e 25 ) ( e 14 + e 45 ) ( e 13 + e 35 ) ( e 14 + e 45 ) ( e 12 + e 25 ) ( e 13 + e 35 ) ,

the paths that happen to be the boundaries of the elements in the basis of Ω 2 ( G ) are the “smallest” representative elements for digraphs generated by squares that belong to the same cluster.

In the following example, we illustrate that for digraph G whose Ω 2 ( G ) is generated by triangles that belong to the same cluster, Remark 3 still holds.

Example 4.3

Without loss of generality, take the following digraph G as an example (Figure 3). Let

Ω 2 ( G ) = span { e 125 , e 135 , e 145 } u = x 1 e 125 + x 2 e 135 + x 3 e 145 , x 1 , x 2 , x 3 K .

Consider the following cases.

  1. w = e 12 + e 25 e 15 = e 125 . Then,

    f ( x 1 , x 2 , x 3 ) = 1 2 u w 2 2 + u 1 = 3 2 x 1 2 + 3 2 x 2 2 + 3 2 x 3 2 + x 1 x 2 + x 1 x 3 + x 2 x 3 3 x 1 x 2 x 3 + 3 2 + x 1 + x 2 + x 3

    and

    u = 2 3 0 0 , w = min f ( x 1 , x 2 , x 3 ) = 5 6 .

  2. w = ( e 12 + e 25 ) ( e 13 + e 35 ) = ( e 125 e 135 ) . Then,

    f ( x 1 , x 2 , x 3 ) = 1 2 u w 2 2 + u 1 = 3 2 x 1 2 + 3 2 x 2 2 + 3 2 x 3 2 + x 1 x 2 + x 1 x 3 + x 2 x 3 2 x 1 + 2 x 2 + 2 + x 1 + x 2 + x 3

    and

    u = 1 2 1 2 0 , w = min f ( x 1 , x 2 , x 3 ) = 3 2 .

Then, we have that w = e 12 + e 25 e 15 = e 125 is the boundary of one basis element of Ω 2 ( G ) , and its norm is the smallest in all intuitively visible one-dimensional elementary closed paths ( e 125 < ( e 125 e 135 ) ).

Figure 3 
               Example 4.3.
Figure 3

Example 4.3.

Acknowledgement

The author would like to thank Prof. Yong Lin for his support, discussions, and encouragement. The author would also like to express her deep gratitude to the reviewer(s) for their careful reading, valuable comments, and helpful suggestions.

  1. Funding information: This work was funded by the Science and Technology Project of Hebei Education Department (Grant No. ZD2022168) and the Project of Cangzhou Normal University (No. XNJJLYB2021006).

  2. Conflict of interest: The author states no conflict of interest.

  3. Data availability statement: Data sharing is not applicable to this article as no datasets were generated or analyzed during this study.

References

[1] A. Grigor’yan, Y. Lin, Y. Muranov, and S. T. Yau, Homologies of path complexes and digraphs, DOI: https://doi.org/10.48550/arXiv.1207.2834. Search in Google Scholar

[2] A. Grigor’yan, Y. Lin, Y. Muranov, and S. T. Yau, Cohomology of digraphs and (undirected) graphs, Asian J. Math. 19 (2015), no. 5, 887–932, https://doi.org/10.4310/AJM.2015.v19.n5.a5. Search in Google Scholar

[3] A. Grigor’yan, Y. Lin, Y. Muranov, and S. T. Yau, Path complexes and their homologies, J. Math. Sci. (N.Y.) 248 (2020), no. 5, 564–599, https://doi.org/10.1007/s10958-020-04897-9. Search in Google Scholar

[4] A. Grigor’yan, Y. Muranov, and S. T. Yau, Homologies of digraphs and Künneth formulas, Comm. Anal. Geom. 25 (2017), no. 5, 969–1018, https://doi.org/10.4310/CAG.2017.v25.n5.a4. Search in Google Scholar

[5] A. Grigor’yan, Y. Muranov, V. Vershinin, and S. T. Yau, Path homology theory of multigraphs and quivers, Forum Math. 30 (2018), no. 5, 1319–1337, https://doi.org/10.1515/forum-2018-0015. Search in Google Scholar

[6] A. Grigor’yan, R. Jimenez, Y. Muranov, and S. T. Yau, Homology of path complexes and hypergraphs, Topology Appl. 267 (2019), 106877, https://doi.org/10.1016/j.topol.2019.106877. Search in Google Scholar

[7] J. J. Fuchs, On sparse representations in arbitrary redundant bases, IEEE Trans. Inform. Theory 50 (2004), no. 6, 1341–1344, https://doi.org/10.1109/TIT.2004.828141. Search in Google Scholar

[8] J. J. Fuchs, Recovery of exact sparse representations in the presence of bounded noise, IEEE Trans. Inform. Theory 51 (2005), no. 10, 3601–3608, https://doi.org/10.1109/TIT.2005.855614. Search in Google Scholar

[9] D. Donoho, Compressed sensing, IEEE Trans. Inform. Theory 52 (2006), no. 4, 1289–1306, DOI: https://doi.org/10.1017/CBO9780511794308. 10.1109/TIT.2006.871582Search in Google Scholar

[10] V. de Silva and R. Ghrist, Coverage in sensor networks via persistent homology, Algebr. Geom. Topol. 7 (2007), 339–358, https://doi.org/10.2140/agt.2007.7.339. Search in Google Scholar

[11] A. Tahbaz-Salehi and A. Jadbaba, Distributed coverage verification in sensor networks without location information, IEEE Trans. Automat. Control. 55 (2010), no. 8, 1837–1849, https://doi.org/10.1109/TAC.2010.2047541. Search in Google Scholar

[12] R. Tibshirani, Regression shrinkage and selection via the lasso: a retrospective, J. R. Stat. Soc. Ser. B. Stat. Methodol. 73 (2011), no. 3, 273–282, https://doi.org/10.1111/j.1467-9868.2011.00771.x. Search in Google Scholar

[13] H. Zhang, W. Yin, and L. Cheng, Necessary and sufficient conditions of solution uniqueness in 1-norm minimization, J. Optim. Theory Appl. 164 (2015), no. 1, 109–122, https://doi.org/10.1007/s10957-014-0581-z. Search in Google Scholar

[14] D. Ferrario, Generalized Lefschetz numbers of pushout maps, Topology Appl. 68 (1996), 67–81, DOI: https://doi.org/10.1016/0166-8641(96)00040-5. 10.1016/0166-8641(96)00040-5Search in Google Scholar

Received: 2022-03-10
Revised: 2022-05-25
Accepted: 2022-09-07
Published Online: 2022-10-06

© 2022 Chong Wang, published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Articles in the same Issue

  1. Regular Articles
  2. A random von Neumann theorem for uniformly distributed sequences of partitions
  3. Note on structural properties of graphs
  4. Mean-field formulation for mean-variance asset-liability management with cash flow under an uncertain exit time
  5. The family of random attractors for nonautonomous stochastic higher-order Kirchhoff equations with variable coefficients
  6. The intersection graph of graded submodules of a graded module
  7. Isoperimetric and Brunn-Minkowski inequalities for the (p, q)-mixed geominimal surface areas
  8. On second-order fuzzy discrete population model
  9. On certain functional equation in prime rings
  10. General complex Lp projection bodies and complex Lp mixed projection bodies
  11. Some results on the total proper k-connection number
  12. The stability with general decay rate of hybrid stochastic fractional differential equations driven by Lévy noise with impulsive effects
  13. Well posedness of magnetohydrodynamic equations in 3D mixed-norm Lebesgue space
  14. Strong convergence of a self-adaptive inertial Tseng's extragradient method for pseudomonotone variational inequalities and fixed point problems
  15. Generic uniqueness of saddle point for two-person zero-sum differential games
  16. Relational representations of algebraic lattices and their applications
  17. Explicit construction of mock modular forms from weakly holomorphic Hecke eigenforms
  18. The equivalent condition of G-asymptotic tracking property and G-Lipschitz tracking property
  19. Arithmetic convolution sums derived from eta quotients related to divisors of 6
  20. Dynamical behaviors of a k-order fuzzy difference equation
  21. The transfer ideal under the action of orthogonal group in modular case
  22. The multinomial convolution sum of a generalized divisor function
  23. Extensions of Gronwall-Bellman type integral inequalities with two independent variables
  24. Unicity of meromorphic functions concerning differences and small functions
  25. Solutions to problems about potentially Ks,t-bigraphic pair
  26. Monotonicity of solutions for fractional p-equations with a gradient term
  27. Data smoothing with applications to edge detection
  28. An ℋ-tensor-based criteria for testing the positive definiteness of multivariate homogeneous forms
  29. Characterizations of *-antiderivable mappings on operator algebras
  30. Initial-boundary value problem of fifth-order Korteweg-de Vries equation posed on half line with nonlinear boundary values
  31. On a more accurate half-discrete Hilbert-type inequality involving hyperbolic functions
  32. On split twisted inner derivation triple systems with no restrictions on their 0-root spaces
  33. Geometry of conformal η-Ricci solitons and conformal η-Ricci almost solitons on paracontact geometry
  34. Bifurcation and chaos in a discrete predator-prey system of Leslie type with Michaelis-Menten prey harvesting
  35. A posteriori error estimates of characteristic mixed finite elements for convection-diffusion control problems
  36. Dynamical analysis of a Lotka Volterra commensalism model with additive Allee effect
  37. An efficient finite element method based on dimension reduction scheme for a fourth-order Steklov eigenvalue problem
  38. Connectivity with respect to α-discrete closure operators
  39. Khasminskii-type theorem for a class of stochastic functional differential equations
  40. On some new Hermite-Hadamard and Ostrowski type inequalities for s-convex functions in (p, q)-calculus with applications
  41. New properties for the Ramanujan R-function
  42. Shooting method in the application of boundary value problems for differential equations with sign-changing weight function
  43. Ground state solution for some new Kirchhoff-type equations with Hartree-type nonlinearities and critical or supercritical growth
  44. Existence and uniqueness of solutions for the stochastic Volterra-Levin equation with variable delays
  45. Ambrosetti-Prodi-type results for a class of difference equations with nonlinearities indefinite in sign
  46. Research of cooperation strategy of government-enterprise digital transformation based on differential game
  47. Malmquist-type theorems on some complex differential-difference equations
  48. Disjoint diskcyclicity of weighted shifts
  49. Construction of special soliton solutions to the stochastic Riccati equation
  50. Remarks on the generalized interpolative contractions and some fixed-point theorems with application
  51. Analysis of a deteriorating system with delayed repair and unreliable repair equipment
  52. On the critical fractional Schrödinger-Kirchhoff-Poisson equations with electromagnetic fields
  53. The exact solutions of generalized Davey-Stewartson equations with arbitrary power nonlinearities using the dynamical system and the first integral methods
  54. Regularity of models associated with Markov jump processes
  55. Multiplicity solutions for a class of p-Laplacian fractional differential equations via variational methods
  56. Minimal period problem for second-order Hamiltonian systems with asymptotically linear nonlinearities
  57. Convergence rate of the modified Levenberg-Marquardt method under Hölderian local error bound
  58. Non-binary quantum codes from constacyclic codes over 𝔽q[u1, u2,…,uk]/⟨ui3 = ui, uiuj = ujui
  59. On the general position number of two classes of graphs
  60. A posteriori regularization method for the two-dimensional inverse heat conduction problem
  61. Orbital stability and Zhukovskiǐ quasi-stability in impulsive dynamical systems
  62. Approximations related to the complete p-elliptic integrals
  63. A note on commutators of strongly singular Calderón-Zygmund operators
  64. Generalized Munn rings
  65. Double domination in maximal outerplanar graphs
  66. Existence and uniqueness of solutions to the norm minimum problem on digraphs
  67. On the p-integrable trajectories of the nonlinear control system described by the Urysohn-type integral equation
  68. Robust estimation for varying coefficient partially functional linear regression models based on exponential squared loss function
  69. Hessian equations of Krylov type on compact Hermitian manifolds
  70. Class fields generated by coordinates of elliptic curves
  71. The lattice of (2, 1)-congruences on a left restriction semigroup
  72. A numerical solution of problem for essentially loaded differential equations with an integro-multipoint condition
  73. On stochastic accelerated gradient with convergence rate
  74. Displacement structure of the DMP inverse
  75. Dependence of eigenvalues of Sturm-Liouville problems on time scales with eigenparameter-dependent boundary conditions
  76. Existence of positive solutions of discrete third-order three-point BVP with sign-changing Green's function
  77. Some new fixed point theorems for nonexpansive-type mappings in geodesic spaces
  78. Generalized 4-connectivity of hierarchical star networks
  79. Spectra and reticulation of semihoops
  80. Stein-Weiss inequality for local mixed radial-angular Morrey spaces
  81. Eigenvalues of transition weight matrix for a family of weighted networks
  82. A modified Tikhonov regularization for unknown source in space fractional diffusion equation
  83. Modular forms of half-integral weight on Γ0(4) with few nonvanishing coefficients modulo
  84. Some estimates for commutators of bilinear pseudo-differential operators
  85. Extension of isometries in real Hilbert spaces
  86. Existence of positive periodic solutions for first-order nonlinear differential equations with multiple time-varying delays
  87. B-Fredholm elements in primitive C*-algebras
  88. Unique solvability for an inverse problem of a nonlinear parabolic PDE with nonlocal integral overdetermination condition
  89. An algebraic semigroup method for discovering maximal frequent itemsets
  90. Class-preserving Coleman automorphisms of some classes of finite groups
  91. Exponential stability of traveling waves for a nonlocal dispersal SIR model with delay
  92. Existence and multiplicity of solutions for second-order Dirichlet problems with nonlinear impulses
  93. The transitivity of primary conjugacy in regular ω-semigroups
  94. Stability estimation of some Markov controlled processes
  95. On nonnil-coherent modules and nonnil-Noetherian modules
  96. N-Tuples of weighted noncommutative Orlicz space and some geometrical properties
  97. The dimension-free estimate for the truncated maximal operator
  98. A human error risk priority number calculation methodology using fuzzy and TOPSIS grey
  99. Compact mappings and s-mappings at subsets
  100. The structural properties of the Gompertz-two-parameter-Lindley distribution and associated inference
  101. A monotone iteration for a nonlinear Euler-Bernoulli beam equation with indefinite weight and Neumann boundary conditions
  102. Delta waves of the isentropic relativistic Euler system coupled with an advection equation for Chaplygin gas
  103. Multiplicity and minimality of periodic solutions to fourth-order super-quadratic difference systems
  104. On the reciprocal sum of the fourth power of Fibonacci numbers
  105. Averaging principle for two-time-scale stochastic differential equations with correlated noise
  106. Phragmén-Lindelöf alternative results and structural stability for Brinkman fluid in porous media in a semi-infinite cylinder
  107. Study on r-truncated degenerate Stirling numbers of the second kind
  108. On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
  109. Some new characterizations of finite p-nilpotent groups
  110. A Billingsley type theorem for Bowen topological entropy of nonautonomous dynamical systems
  111. F4 and PSp (8, ℂ)-Higgs pairs understood as fixed points of the moduli space of E6-Higgs bundles over a compact Riemann surface
  112. On modules related to McCoy modules
  113. On generalized extragradient implicit method for systems of variational inequalities with constraints of variational inclusion and fixed point problems
  114. Solvability for a nonlocal dispersal model governed by time and space integrals
  115. Finite groups whose maximal subgroups of even order are MSN-groups
  116. Symmetric results of a Hénon-type elliptic system with coupled linear part
  117. On the connection between Sp-almost periodic functions defined on time scales and ℝ
  118. On a class of Harada rings
  119. On regular subgroup functors of finite groups
  120. Fast iterative solutions of Riccati and Lyapunov equations
  121. Weak measure expansivity of C2 dynamics
  122. Admissible congruences on type B semigroups
  123. Generalized fractional Hermite-Hadamard type inclusions for co-ordinated convex interval-valued functions
  124. Inverse eigenvalue problems for rank one perturbations of the Sturm-Liouville operator
  125. Data transmission mechanism of vehicle networking based on fuzzy comprehensive evaluation
  126. Dual uniformities in function spaces over uniform continuity
  127. Review Article
  128. On Hahn-Banach theorem and some of its applications
  129. Rapid Communication
  130. Discussion of foundation of mathematics and quantum theory
  131. Special Issue on Boundary Value Problems and their Applications on Biosciences and Engineering (Part II)
  132. A study of minimax shrinkage estimators dominating the James-Stein estimator under the balanced loss function
  133. Representations by degenerate Daehee polynomials
  134. Multilevel MC method for weak approximation of stochastic differential equation with the exact coupling scheme
  135. Multiple periodic solutions for discrete boundary value problem involving the mean curvature operator
  136. Special Issue on Evolution Equations, Theory and Applications (Part II)
  137. Coupled measure of noncompactness and functional integral equations
  138. Existence results for neutral evolution equations with nonlocal conditions and delay via fractional operator
  139. Global weak solution of 3D-NSE with exponential damping
  140. Special Issue on Fractional Problems with Variable-Order or Variable Exponents (Part I)
  141. Ground state solutions of nonlinear Schrödinger equations involving the fractional p-Laplacian and potential wells
  142. A class of p1(x, ⋅) & p2(x, ⋅)-fractional Kirchhoff-type problem with variable s(x, ⋅)-order and without the Ambrosetti-Rabinowitz condition in ℝN
  143. Jensen-type inequalities for m-convex functions
  144. Special Issue on Problems, Methods and Applications of Nonlinear Analysis (Part III)
  145. The influence of the noise on the exact solutions of a Kuramoto-Sivashinsky equation
  146. Basic inequalities for statistical submanifolds in Golden-like statistical manifolds
  147. Global existence and blow up of the solution for nonlinear Klein-Gordon equation with variable coefficient nonlinear source term
  148. Hopf bifurcation and Turing instability in a diffusive predator-prey model with hunting cooperation
  149. Efficient fixed-point iteration for generalized nonexpansive mappings and its stability in Banach spaces
Downloaded on 7.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/math-2022-0495/html
Scroll to top button