Next Article in Journal
Third-Order Functional Differential Equations with Damping Term: Oscillatory Behavior of Solutions
Previous Article in Journal
Estimation for Longitudinal Varying Coefficient Partially Nonlinear Models Based on QR Decomposition
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Additive Derivations of Incidence Modules

1
School of Mathematics, Statistics and Mechanics, Beijing University of Technology, Beijing 100124, China
2
Department of Mathematics, College of Science, Qassim University, Buraydah 52571, Saudi Arabia
3
Department of Mathematics, University of Kotli AJK, Kotli 11100, Pakistan
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(12), 876; https://doi.org/10.3390/axioms14120876
Submission received: 22 October 2025 / Revised: 18 November 2025 / Accepted: 25 November 2025 / Published: 28 November 2025

Abstract

Let R be an associative ring and M a left R-module. This paper examines the structural properties of the incidence module I ( P , M ) , associated with a module M over a ring R and a locally finite poset P . We provide a complete characterization of when an additive derivation on I ( P , M ) is inner, for the case where P is a finite and connected poset. These criteria are then generalized to arbitrary posets, revealing a profound connection between the algebraic properties of the module and the graph-theoretic structure of P as a directed graph.
MSC:
16D10; 16D25; 16D20

1. Introduction

Ring theory provides a unifying language across diverse mathematical disciplines, offering a powerful structural framework for investigating problems of both classical and contemporary importance. While rings with derivations do not undergo substantial modifications, their study has attracted considerable attention over the past five decades. Scholars have extensively explored the connections between derivations and the structural properties of rings, leading to profound insights.
This paper devotes significant attention to the derivation of incidence ring, referencing a highly informative introduction in [1], which presents a historical overview of derivation studies, along with a comprehensive list of references. Specifically, we investigate the incidence modules I ( P , M ) for an arbitrary partially ordered set P over an associative ring R. The foundational results on the derivation of incidence rings are detailed in [2], with the key outcome presented in ([2], Theorem 7.1.4). This theorem characterizes the derivations of I ( P , R ) , where R is assumed to be a commutative ring with identity and P is regarded as a partially ordered set.
Baclawski [3] examined the I ( P , F ) of a locally finite poset P over a field F using derivations. He showed that every derivation can be decomposed as the sum of an inner derivation and a derivation induced by an additive function on the intervals of P . Although such decompositions are generally non-unique, the author provided a complete characterization of derivations that are simultaneously inner and generated by additive functions. Moreover, it was shown that the existence of either a minimal element 0 or a maximal element 1 in the poset P implies that all derivations of I ( P , F ) is necessarily inner.
Khripchenko [4] further generalized these findings by examining derivations in broader classes of incidence rings and applying the theoretical framework established by Baclawski and Spiegel and O’Donnell to these structures. His work extended the applicability of these results to more general algebraic contexts.
Suppose R is a commutative ring and P is a connected, finite partially ordered set. While not every additive derivation of the I ( P , R ) is necessarily inner, it is possible to identify those additive derivations that exhibit this property. This work characterizes the inner derivations of I ( P , R ) for arbitrary locally finite posets P .
Stanley [5] initiated the study of the isomorphism problem for incidence algebra. Baclawski [3] further explored the structural properties of derivations and automorphisms in this context. More recently, Xiao [6] extended Herstein’s program on Lie-type mappings [7] to incidence algebras. He showed Jordan derivations coincide with derivations for 2-torsion-free R. Moreover, it was subsequently demonstrated that Lie derivations and Lie triple derivations of I ( P , R ) are of the standard form in [8,9], respectively.
An additive mapping D : R R is a derivation if it fulfills the Leibniz rule:
D ( p q ) = D ( p ) q + p D ( q ) for all p , q R .
Thus, Der ( R ) denotes all derivations of R, and Inn ( R ) Der ( R ) is a subring. A straightforward example is the classical derivative operator applied to algebras of differentiable functions. In the context of noncommutative rings, however, the fundamental examples are conceptually different. For any elements c , p , q R , the following identity holds:
[ c , p q ] = [ c , p ] q + p [ c , q ]
For a fixed c R , define D : R R by
D ( P ) = [ p , c ] for all p R .
For any two elements p , c R , the commutator [ p , c ] is defined as
[ p , c ] = p c c p
The derivation function D ( p ) is defined as
D ( p ) = [ p , c ] = p c c p , for all p R
where [ p , c ] represents the commutator of p and c, measuring the extent to which they fail to commute. If [ p , c ] = 0 , then p and c commute.
A straightforward computation confirms that D is additive and satisfies
D ( p q ) = [ p q , c ] = p [ q , c ] + [ p , c ] q = p D ( q ) + D ( p ) q for all p , q R .
Thus, D is a derivation, specifically referred to as an inner derivation of R associated with c, often denoted as I c . While every inner derivation on R is a derivation, there exist numerous examples of derivations that are not inner.
Recall the definition of an incidence ring I ( P , R ) . Let P be a locally finite partially ordered set, where for any p q , there are only finitely many elements z P such that p z q . The incidence ring I ( P , R ) , as defined in [2], consists of the set of functions.
I ( P , R ) = { g : P × P R : g ( p , q ) = 0 unless p q } ,
with the following operations
( g + h ) ( p , q ) = f ( p , q ) + h ( p , q )
g h ( p , q ) = p z q g ( p , z ) h ( z , q ) .
for all g , h in I ( P , R ) and p , q in X, if R is commutative, then I ( P , R ) forms an R-algebra, where the operation is defined as ( r g ) ( p , q ) = r g ( p , q ) for any r R .
An incidence ring I ( P , R ) is a potent tool in algebraic combinatorics that utilizes algebraic structures to represent the combinatorial interaction between components, such as points and lines. The incidence ring formalizes these interactions often by using functions or matrices that specify the components that are incident to one another. The study of incidence rings in algebraic systems is both fascinating and challenging. Module theories and posets interact to form incidence rings, providing a fruitful ground for research. Continuing our investigation, we examine incidence modules. We focus on the incidence module I ( P , M ) , where M is a left R-module and P is a locally finite poset defined over M. However, the need for a more refined and adaptable structure resulted in the implementation of incidence modules. Incidence modules expand upon the fundamental notion of incidence rings by integrating module theory, thus enabling a more refined and flexible methodology for investigating combinatorial combinations. This progress is especially beneficial for additive derivation in incidence modules, as the additive characteristics of modules allow for a more thorough and adaptable examination of combinatorial structures. This allows mathematicians to investigate more intricate interactions and obtain results that are not readily achievable within incidence rings alone.
The goal of this paper is to introduce the idea of incidence modules as a way to study derivations in a structured way. This is because the author wants to learn more about the algebraic property of I ( P , R ) . We want to investigate the operation of additive and inner derivations inside directed graphs by using I ( P , M ) , which are fundamental in combinatorial and graph theory. Directed graphs, due to their intricate connectivity characteristics, serve as an optimal framework for analyzing the behavior of these derivatives. This method provides a toolkit for examining the algebraic structure of I ( P , R ) and facilitates future applications in graph theory, network analysis, and other disciplines. This paper presents I ( P , M ) to provide a formal method for comprehending additive derivations, inner derivations, and their operation inside a directed graph.
This section presents foundational definitions and known results concerning I ( P , M ) and their associated derivations.

2. Preliminaries

Throughout this paper, let R be an associative ring with identity. A partially ordered set (poset) P is called locally finite if for every p , q P with p q , the interval [ p , q ] = { z P p z q } is a finite set. This condition is essential for the convolution product in the incidence ring I ( P , R ) and module I ( P , M ) to be well-defined. The Hasse diagram of a poset P is a directed graph whose vertices are the elements of P, and there is a directed edge from p to q if and only if q covers p (i.e., p < q and there is no z such that p < z < q ).
Let M be a left R-module, and all R-modules are unital.
Let R be a commutative ring with identity and P be a locally finite poset. Throughout this paper, all R-modules are assumed to be unital, meaning that the identity element 1 R acts as the identity map on the module (i.e., 1 · m = m for all m M ). Under these conditions, I ( P , R ) forms an incidence ring. Now, let M be a left R-module and I ( P , M ) , be the incidence module. By definition, I ( P , M ) is the set of all functions defined as
I ( P , M ) = { κ : P × P M with κ ( p , q ) = 0 unless p q } ,
with the following operations:
( κ + β ) ( p , q ) = κ ( p , q ) + β ( p , q )
( f κ ) ( p , q ) = p t q f ( p , t ) κ ( t , q )
for all κ , β in I ( P , M ) , f in I ( P , R ) and p , q in P , the module I ( P , M ) becomes an R-module under the operations
( r f ) ( p , q ) = r · f ( p , q )
for any r R . When R is commutative, I ( P , M ) acquires the structure of an I ( P , R ) -bimodule. Indeed, in this case, M may be regarded as an R-bimodule by defining m · r = r · m for all r R and m M . Consequently, we obtain the scalar multiplication k f for k I ( P , M ) and f I ( P , R ) .
In an incidence module the element δ m is defined as follows:
δ m ( p , q ) = m if p = q 0 otherwise
In particular, if M = R and m = 1 R , let δ = δ 1 .
The function δ m I ( P , M ) as an element of I ( P , M ) and, for any ( p , q ) P × P with p q , we define e p q I ( P , R ) as
e p q ( u , v ) = 1 if ( u , v ) = ( p , q ) 0 otherwise
For convenience of statements we write m e p q , i.e.,
m e p q ( u , v ) = m if ( u , v ) = ( p , q ) 0 otherwise
Definition 1.
Let P be a locally finite poset and R a commutative ring with identity. An element α I ( P , M ) is additive if it satisfies the condition:
α ( p , q ) = α ( p , z ) + α ( z , q ) for each triple p z q .
In addition, α ( p , p ) = 0 for all p P .
Now, suppose that α I ( P , R ) is additive. We define the map L α : I ( P , M ) I ( P , M ) by convolution, where for any f I ( P , M ) , L α ( f ) = α f is given by
( L α ( f ) ) ( p , q ) = α f ( p , q ) = α ( p , q ) f ( p , q )
for all p , q P .
The map L α satisfies the following two properties for all f , g I ( P , M ) and r R :
1.
L α ( f + g ) = L α ( f ) + L α ( g ) ;
2.
L α ( r f ) = r L α ( f ) .
Definition 2.
Let A be an R-algebra and M be an A-bimodule. A linear mapping D : M M is called a derivation if for all m 1 , m 2 M , a A , and r R , the following conditions hold:
1.
D ( m 1 + m 2 ) = D ( m 1 ) + D ( m 2 ) ;
2.
D ( r m ) = r D ( m ) ;
3.
D ( a m ) = d ( a ) m + a D ( m ) .
where d : A A is a derivation of the algebra A. If d is an inner derivation, meaning d ( a ) = [ a , b ] = a b b a for some fixed b A , then D is called an inner derivation of the module M.
For each b A , the map D b : M M defined by
D b ( m ) = b · m m · b , for all m M
is an inner derivation with respect to b.
Definition 3.
Let A be an R-algebra and M be an A-bimodule. A linear mapping D : M M is called a derivation if for all m 1 , m 2 M , a A , and r R , the following conditions hold:
1.
D ( m 1 + m 2 ) = D ( m 1 ) + D ( m 2 ) ;
2.
D ( r m ) = r D ( m ) ;
3.
D ( a m ) = d ( a ) m + a D ( m ) .
where d : A A is a derivation of the algebra A. If d is an inner derivation, meaning d ( a ) = [ a , b ] = a b b a for some fixed b A , then D is called an inner derivation of the module M.
For each b A , the map D b : M M defined by
D b ( m ) = b · m m · b , for all m M
is an inner derivation with respect to b.
The following result is a consequence which follows from [2] (Theorem 7.1.4, Propositions 7.1.6, 7.1.8).
Proposition 1.
Let M be an R-bimodule and P a locally finite partially ordered set. If P contains an element that is comparable with every element of P , then every additive derivation of I ( P , M ) is inner.
An element comparable to all in P is not needed for every additive derivation of I ( P , M ) to be inner. To illustrate, consider the incidence algebra associated with the poset P 1 , whose Hasse diagram is shown below.
                                            Axioms 14 00876 i001
Clearly, there is no element in P 1 that is comparable with all other elements in P 1 . Example 1 shows all additive derivations of I ( P 1 , M ) are inner.
However, in some cases, in which the I ( P , M ) allows for additive derivations that are not inner. Such a situation occurs for the I ( P , M ) of the partially ordered set P 2 shown below.
                                            Axioms 14 00876 i002
  • Spiegel and O’Donnell presented this example in ([2], page 257). Consequently, this result also follows from the subsequent discussion (see Example 2).

3. Conditions for an Additive Derivation to Be Inner

3.1. Finite and Connected Partially Ordered Sets

In this subsection, we assume that the poset P is finite and connected. A poset P is defined as connected if, for any p , q in P , there exists a sequence p 0 , p 1 , , p n P such that p = p 0 , q = p n , and p i p i + 1 or p i + 1 p i , for all 0 i n 1 . According to this condition, a chain in P connects p and q, with all pairs in the chain comparable, even if p and q are not directly comparable. Based on the partially ordered set, comparisons can be conducted in either direction (increasing or decreasing), allowing traversal from p to q within the structure of the partially ordered set. This implies that P has a connected Hasse diagram. In a Hasse diagram, the process of navigating between comparable elements in a partially ordered set by following the edges of the diagram is called traversal.
In short, a finite and connected partially ordered sets allows movement between elements using order relations, and its Hasse diagram visually represents this connectivity. Understanding these structures is essential for both theoretical insights and practical applications across various domains.
In this subsection, we demonstrate how viewing P as a directed graph facilitates the formulation of a condition under which an additive derivation of I ( P , M ) is inner.
Let G = ( P , A ) be a directed graph, where P represents the set of vertices and A the set of edges. The edge ( p , q ) A whenever q covers p, i.e., p < q and { h P : p < h < q } = , which is used to define the partially ordered set P . Below, we provide a restatement of key definitions relevant to directed graphs. For further results and definitions from graph theory, see [10].
Definition 4.
Let G = ( V , A ) be a directed graph, where V constitutes a collection of vertices and A comprises ordered pairs known as arcs between vertices in V. For v , w V , let W represent a sequence of vertices v 0 v 1 v k such that v 0 = v , v k = w , and v i v i + 1 for vertices 0 i k 1 . Let W : v = v 0 v 1 v k = w represent this sequence. A sequence W is called a walk from v to w in G if for every 0 i k 1 , either ( v i , v i + 1 ) or ( v i + 1 , v i ) belongs to A. If v = w , the walk is closed at v. A semipath is a walk where each vertex is distinct. If G has a unique semipath for every pair p , q V , then G is classified as a tree. As noted in [11], a path in G = ( V , A ) is a sequence of distinct vertices ( v 0 , v 1 , , v k ) such that ( v i , v i + 1 ) A for 0 i < k , with forward arcs. A semipath from v to w is a path (or counter-path) if ( v i , v i + 1 ) or ( v i + 1 , v i ) A .
Let G = ( V , A ) be a directed graph, and let W and U be paths in G. Each path induces a subgraph of G; we denote their vertex sets by V ( W ) and V ( U ) , and their edge sets by A ( W ) and A ( U ) , respectively. The intersection of the paths W and U is defined as the subgraph G = ( V , A ) of G, where
V = V ( W ) V ( U ) , A = A ( W ) A ( U ) .
This subgraph, denoted G = W U , consists precisely of the vertices and edges common to both paths.
Let G = ( V , A ) be a directed graph and T a set. A weight function on G is a mapping w : A T , and the graph G equipped with w is termed a weighted directed graph. Now, let G = ( V , A ) be a weighted directed graph with a weight function w : A M . We define the set of reverse edges of A as A = { ( u , v ) ( v , u ) A } . The weight function w then induces a function η w : A A M given by
η w ( u , v ) = w ( u , v ) , if ( u , v ) A , w ( v , u ) , if ( u , v ) A .
Let α be an additive element of I ( X , M ) . We can transform G = ( P , A ) into a weighted directed graph with weights in M as follows: for each edge ( u , v ) in A, the weight of the edge ( u , v ) is α ( u , v ) . Observe that if p = v 0 v 1 v k = q is a path in P , then α ( p , q ) = i = 0 k 1 η ( v i , v i + 1 ) . When there are two distinct semipaths connecting p to q in P , the sum of the directed edge weights may differ. For instance, consider the poset P 2 related to the Hasse diagram below:
                                            Axioms 14 00876 i003
If α is an additive element, then η α ( a , b ) + η α ( b , d ) = 1 0 = η α ( a , c ) + η α ( c , d ) . The next theorem shows that this equation gives a complete characterization of inner derivations L α .
Let W : p = v 0 v 1 v k = q be a walk from p to q. For an additive element α I ( P , M ) , we define the sum of directed edge weights along W as
Υ W α ( x , y ) = i = 0 k 1 η α ( v i , v i + 1 ) .
The following lemma holds:
Lemma 1.
Let P be a partially ordered set, and let M be an R-bimodule. Suppose that W : p = v 0 v 1 v k = q represents a walk connecting p to q in P , and let α I ( P , M ) be additive. The function Υ W α is a map from the set of walks in P to I ( P , M ) , which assigns a value in the bimodule to each walk.
(a)
If W is a path, then Υ W α = α ( p , q ) . If W is a counter-path, then Υ W α = α ( p , q ) .
(b)
If W 1 : p = v 0 v l = z and W 2 : z = v l v k = q , where 0 < l < k , then the composition of the walks W = W 1 W 2 satisfies
Υ W α ( p , q ) = Υ W 1 α ( p , z ) + Υ W 2 α ( z , q ) .
Specifically, if W is a closed walk (i.e., p = q ), then
Υ W α ( p , p ) = Υ W 1 W 2 α ( p , p ) = 0 .
(c)
If W 1 : q = v k v 1 v 0 = p is the inverse walk of W , then W 1 is a walk connecting q to p in P , and
Υ W 1 α ( q , p ) = Υ W α ( p , q ) ,
where Υ W α ( p , q ) represents the additive inverse of Υ W α ( p , q ) in the bimodule I ( P , M ) . If W is a semipath, then so is its inverse W 1 .
Theorem 1.
Let P be a partially ordered set, M an R-bimodule, and α in I ( P , M ) an additive element. Then additive derivation L α is inner if and only if, for every pair of distinct elements p , q P and any semipaths H 1 , H 2 connecting p to q, the following holds:
Υ H 1 α ( p , q ) = Υ H 2 α ( p , q ) .
Proof. 
First, assume that α is inner. According to [2] (Theorem 7.1.6), since L α is a potential, there exists a function g : P M satisfying α ( p , q ) = g ( q ) g ( p ) , for p q in P . Consider p , q in P , p q , and suppose that H : v 0 v 1 v k is a semipath joining p to q. We will demonstrate this by induction on k Υ H α ( p , q ) = g ( q ) g ( p ) . Let k = 1 . If p < q , then Υ H α ( p , q ) = α ( p , q ) = g ( q ) g ( p ) . If q < p , then Υ H α ( p , q ) = α ( q , p ) = ( g ( p ) g ( q ) ) = g ( q ) g ( p ) . Let k > 1 , and assume result holds for k 1 . Let H = H 1 H 2 be the semipath joining p to q, where H 1 joins v 0 to v k 1 , and H 2 joins v k 1 to v k . Then,
Υ H α ( p , q ) = Υ H 1 α ( v 0 , v k 1 ) + Υ H 2 α ( v k 1 , v k ) = g ( v k 1 ) g ( v 0 ) + g ( v k ) g ( v k 1 ) = g ( v k ) g ( v 0 ) = g ( q ) g ( p ) .
Therefore, for every semipath H connecting p to q, Υ H α ( p , q ) = g ( q ) g ( p ) . Now, assume that for any distinct p , q P and for any semipaths H 1 and H 2 connecting p to q, the equality Υ H 1 α ( p , q ) = Υ H 2 α ( p , q ) holds. Let g : P M be defined as follows: Choose a maximal element z P and set g ( z ) = 0 . For each other element p P , define g ( p ) = Υ H p α ( z , P ) , where H z , p is a semipath from z to p. By assumption, the function g is well-defined, meaning it does not depend on the choice of H p . We will use Lemma 1 to show that α ( p , q ) = g ( q ) g ( p ) for any p q P . First, observe that for all p P , we have α ( p , p ) = 0 , which immediately yields g ( p ) g ( p ) = 0 . Now, for p < q , let H : w 0 w 1 w l be a path from p to q. Given the maximality of z, it follows that z p . In the case where q = z , we obtain
g ( z ) g ( p ) = Υ H p α ( z , p ) = Υ H p 1 α ( p , z ) = Υ H α ( p , z ) = α ( p , z ) .
Assume that q z , and let H p : u 0 u 1 u k represent a semipath connecting z to p. Let n be the smallest index for which u n = w m , with m { 0 , 1 , , l } . Note that n 0 , as this would imply z = u 0 = w m < w l = q , which contradicts the assumption that H is a path. Now assume 0 < n < k . Then m 0 by distinctness of the vertices u 0 , , u k . If 0 < m < l , consider the semipaths H 1 : w 0 w m , H 2 : w m w l , and H : u 0 u n . Then H H 2 connects z to q, and H H 1 1 connects z to p. By Lemma 1,
g ( z ) g ( p ) = Υ H H 2 α ( z , q ) Υ H H 1 1 α ( z , p ) = Υ H 1 H 2 α ( p , q ) = Υ H α ( p , q ) = α ( p , q ) .
If m = l , then H 1 = H suffices. For n = k , m l since p q . If 0 < m < l , then w 0 = u n = w m , which leads to a contradiction since the vertices w 0 , , w l are pairwise distinct. Therefore, we must have m = 0 . In this case, H 2 = H and H = H p , so the preceding argument holds without the need for H 1 . Thus, we conclude that α ( p , q ) = g ( q ) g ( p ) for any p q P . According to [2] (Proposition 7.1.6), it follows that L α is inner. □
Corollary 1.
Let P be a tree (as a partially ordered set), and let M be an R-bimodule. Then every additive derivation D : I ( P , M ) I ( P , M ) is inner.
Proof. 
Given that for every distinct pair p and q P , there exists exactly one semipath connecting p to q, we can conclude that the proof of the statement is straightforward and follows directly from Theorem 1. □
Corollary 2.
Let P be a partially ordered set whose Hasse diagram is a tree, and let M be an R-bimodule. Then every derivation D : I ( P , M ) I ( P , M ) is inner.
Proof. 
This follows from [2] (Theorem 7.1.4) and Corollary 4. □
Example 1.
Consider the partially ordered set P 1 from Section 2, a tree. Since every additive derivation of I ( P 1 , M ) is inner, it follows from the previous corollary that all derivations are inner.
Example 2.
Consider the partially ordered set P 2 from Section 2, with α = e b d I ( P 2 , M ) , which is additive. Let the semipaths H : a b d and ζ : a c d connect a to d. Since Υ H α ( a , d ) = 1 and Υ ζ α ( a , d ) = 0 , it follows from Theorem 1 that L α is not an inner additive derivation.
Definition 5.
Let G = ( V , A ) be a directed graph. A cycle is a closed walk C : v 0 v 1 v k with k 3 , v 0 = v k , and distinct vertices for 0 i k 1 .
Remark 1.
(a) For a directed graph G = ( V , A ) , if C : v 0 v 1 v k constitutes a cycle based at vertex v 0 , then necessarily k 4 . This follows from the property that the corresponding Hasse diagram excludes triangular configurations.
(b) A poset P possesses a tree structure precisely when its associated graph contains no cycles.
Corollary 3.
Let M be an R-bimodule and α I ( P , M ) an additive element. The additive derivation L α induced by α is an inner derivation if and only if, for every vertex p P and every cycle C based at p, the cycle evaluation map satisfies Υ C α ( p , p ) = 0 .
Proof. 
Consider a cycle C : v 0 v 1 v k at vertex p, assuming L α is an inner derivation. Decompose this cycle into two segments C = ζ 1 ζ 2 , where ζ 1 : v 0 v 1 v k 1 and ζ 2 : v k 1 v k . In this decomposition, both the inverse path ζ 1 1 and the path ζ 2 connect the vertex v k 1 to x. By Theorem 1, it follows that Υ ζ 1 1 α ( v k 1 , p ) = Υ ζ 2 α ( v k 1 , p ) . Consequently, according to Lemma 1, we have
Υ C α ( p , p ) = Υ ζ 1 ζ 2 α ( p , p ) = Υ ζ 1 α ( x , v k 1 ) + Υ ζ 2 α ( v k 1 , p ) = Υ ζ 1 α ( x , v k 1 ) + Υ ζ 1 1 α ( v k 1 , p ) = 0 .
Conversely, consider two distinct vertices p and q in P , and let H 1 : v 0 v 1 v k and H 2 : w 0 w 1 w l be two distinct semipaths from p to q. We first analyze the scenario where these semipaths share no vertices other than their endpoints p and q. Assume that the closed walk H 1 H 2 1 : v 0 v 1 v k w l 1 w 0 wherein the vertices v 0 , v 1 , v 2 , , v k , w 1 , w 2 , , w l 1 are all distinct. If H 1 H 2 1 does not constitute a cycle based at p, then by Definition 5 and Remark 1, it follows that k + 1 3 . On the other hand, P has no triangles, thus k + 1 < 3 and so H 1 H 2 1 : p q p . Thus, H 1 = H 2 : p q and, in this case, Υ H 1 α ( p , q ) = Υ H 2 α ( p , q ) . However, if H 1 H 2 1 is a cycle, then by hypothesis, Υ H 1 H 2 1 α ( p , p ) = 0 . Consequently, Υ H 1 α ( p , q ) = Υ H 2 α ( p , q ) , and it then follows from Lemma 1.
It is necessary to examine the case when H 1 H 2 has vertices other than the extremities of H 1 . Assume that v i 0 , v i 1 , , v i n denote pairwise distinct vertices of H 1 , where n 1 , v i 0 = v 0 , however it is not requried that i 1 < i 2 < < i n 1 < i n .
By abusing notation, we will indicate the sum Υ H 1 α ( v i , v i j + 1 ) when we have H 1 : v i j = v r v r + 1 v s = v i j + 1 as a semipath of H 1 by Υ H 1 α ( v i , v i j + 1 ) . Even if i j + 1 < i j , specifically when H 1 : v i j + 1 = v r v r 1 v s = v i j , we will denote Υ H 1 α ( v i , v i j + 1 ) by Υ H 1 α ( v i , v i j + 1 ) , focussing on the opposites in this case.
Claim j = 0 n 1 Υ H 1 α ( v i j , v i j + 1 ) = Υ H 1 α ( v i 0 , v i n ) . For n = 1 , it’s obvious. For n = 2 , we assume i 1 < i 2 and proceed by induction on n, so we have
Υ H 1 α ( v i 0 , v i 1 ) + Υ H 1 α ( v i 1 , v i 2 ) = Υ H 1 α ( v i 0 , v i 2 ) ,
according to Lemma 1(b). Now, if i 2 < i 1 , then
Υ H 1 α ( v i 0 , v i 1 ) + Υ H 1 α ( v i 1 , v i 2 ) = Υ H 1 α ( v i 0 , v i 2 ) + Υ H 1 α ( v i 2 , v i 1 ) + Υ H 1 α ( v i 1 , v i 2 ) = Υ H 1 α ( v i 0 , v i 2 ) ,
because Υ H 1 α ( v i 1 , v i 2 ) = Υ H 1 α ( v i 2 , v i 1 ) .
Now, for n > 2 , the inductive hypothesis assumes the equality for n 1 . We have
j = 0 n 1 Υ H 1 α ( v i j , v i j + 1 ) = j = 0 n 2 Υ H 1 α ( v i j , v i j + 1 ) + Υ H α ( v i n 1 , v i n ) .
By induction hypothesis, j = 0 n 2 Υ H 1 α ( v i j , v i j + 1 ) = Υ H 1 α ( v i 0 , v i n 1 ) and, by applying the result established for the base case n = 2 ,
j = 0 n 1 Υ H 1 α ( v i j , v i j + 1 ) = Υ H 1 α ( v i 0 , v i n 1 ) + Υ H 1 α ( v i n 1 , v i n ) = Υ H 1 α ( v i 0 , v i n ) .
Let V ( H 1 ) V ( H 2 ) = { v i o = w j 0 , v i 1 = w j 1 , , v i t = w j t } , with v i 0 = v 0 , v i t = v k and i 0 < i 1 < < i t (note that not necessarily j 1 < j 2 < < j t 1 ). Then
Υ H 1 α ( v 0 , v k ) = r = 0 t 1 Υ H 1 α ( v i r , v i r + 1 ) = r = 0 t 1 Υ H 2 α ( w j r , w j r + 1 ) = Υ H 2 α ( w 0 , w l ) ,
The second equality is justified by the property that the corresponding subsemipaths of H 1 and H 2 connecting v i r = w j r to v i r + 1 = w j r + 1 intersect only at their endpoints, while the first and final equalities are direct consequences of the aforementioned claim. □
One can apply Corollary 3 to demonstrate that proving an additive derivation is inner is more straightforward than using Theorem 1, particularly in the case of small partially ordered sets. This is exemplified by the partially ordered set P 3 , shown below. Specifically, P 3 consists of six elements that are not vertices of any cycle.
                                            Axioms 14 00876 i004
Additionally, Corollary 3 need not be checked for every cycle of the partially ordered set, as will be shown subsequently. Let C : v 0 v 1 v k be a cycle represent in v 0 . Define i such that 1 i k 1 and assume the semipaths H 1 : v 0 v 1 v i and H 2 : v i v i + 1 v k . Consequently, H 2 1 H 1 1 are likewise cycles in v 0 , but H 2 H 1 and H 1 1 H 2 1 are cycles in v i . All four cycles C = H 1 H 2 , H 2 1 H 1 1 , H 2 H 1 and H 1 1 H 2 1 , have identical edges with C . According to Lemma 1 (b) and (c), we have
Υ H 1 H 2 α ( v 0 , v 0 ) = Υ H 2 H 1 α ( v i , v i ) = Υ H 1 1 H 2 1 α ( v i , v i ) = Υ H 2 1 H 1 1 α ( v 0 , v 0 )
Let ξ represent the collection of all cycles in the structure P . A binary relation ∼ is defined on ξ according to the following: for C 1 , C 2 ξ ,
C 1 C 2 if and only if , A ( C 1 ) = A ( C 2 ) .
where A ( C ) represents a certain characteristic of the cycle C . The characteristic of a cycle C , denoted A ( C ) , is the sum of the weights of all edges in the cycle:
A ( C ) = e C w ( e )
It is evident that ∼ constitutes an equivalence relation. The equivalence class of a cycle C ξ will be denoted by C ¯ . Now, suppose C is a cycle based at p and C is a cycle based at q, with the property that C ¯ = C ¯ . As a consequence of Equation (1), we derive the following relation:
Υ C α ( p , p ) = 0 if and only if Υ C α ( q , q ) = 0 .
Theorem 2.
Let P be a locally finite partially ordered set, M be an R-bimodule, and α I ( P , M ) an additive element. Let { C 1 , C 2 , , C l } represent a transversal of ξ for the equivalence relation defined in Lemma 1, where each C i is a cycle corresponding to p i for i = 1 , 2 , , l . Then, the additive derivation L α is inner if and only if
Υ C i α ( p i , p i ) = 0 for all i = 1 , 2 , , l .
Proof. 
This is an immediately consequence of Theorem 1 and Corollary 3. □
In order to make an additive derivation inner, we now attempt to weaken the requirements stated in Theorems 1 and 2.
Lemma 2.
Let M be an R-bimodule and α I ( P , M ) an additive element. Let H : v 0 v 1 v k be a semipath such that every vertices is comparable with v 0 . Then
(a) v 0 < v k (resp. v k < v 0 ) v 0 < v i (resp. v i < v 0 ), for all i = 1 , 2 , , k 1 .
(b) The function Υ H α ( v 0 , v k ) is given by:
Υ H α ( v 0 , v k ) = α ( v 0 , v k ) if v 0 < v k , α ( v k , v 0 ) if v k < v 0 .
Proof. 
(a) This result corresponds precisely to part (a) of [12] (Lemma 11).
(b) Let v 0 < v k . By induction on k, we show that v 0 is the minimum of { v 0 , v 1 , , v k } , which is given by condition (a). For k = 1 , Υ H α ( v 0 , v k ) = η α ( v 0 , v 1 ) = α ( v 0 , v 1 ) . Let k > 1 and assume that the result is true for k 1 . If we write H = H 1 H 2 , where H 1 : v 0 v 1 v k 1 , H 2 : v k 1 v k , then
Υ H α ( v 0 , v k ) = Υ H 1 α ( v 0 , v k 1 ) + Υ H 2 α ( v k 1 , v k ) = α ( v 0 , v k 1 ) + Υ H 2 α ( v k 1 , v k ) .
If v k covers v k 1 , then η α ( v k 1 , v k ) = α ( v k 1 , v k ) . Thus,
Υ H α ( v 0 , v k ) = α ( v 0 , v k 1 ) + α ( v k 1 , v k ) = α ( v 0 , v k ) .
However, if v k 1 covers v k , then η α ( v k 1 , v k ) = α ( v k , v k 1 ) ; consequently,
Υ H α ( v 0 , v k ) = α ( v 0 , v k 1 ) α ( v k , v k 1 ) = α ( v 0 , v k ) ,
since α ( v 0 , v k 1 ) = α ( v 0 , v k ) + α ( v k , v k 1 ) . The case when v k < v 0 is analogous. □
Definition 6.
Consider a cycle C within the structure P . Let v V ( C ) and p P V ( C ) be comparable, with q < v or v < q . In both cases, a path (or counter-path) connects q to v.. Suppose we have a counter-path u 0 u 1 u t with u 0 = q and u t = v . This counter-path may intersect C at a vertex preceding v; that is, there might exist an index j with 0 < j < t such that u j V ( C ) . Define b : = min { i { 1 , 2 , , t } : u i V ( C ) } . The resulting sequence u 0 u 1 u b 1 u b forms a counter-path joining q to a vertex on C , satisfying the condition that either v < u i holds for all i = 0 , , b 1 with v u b , or u i < v holds for all i = 0 , , b 1 with u b v . Such a counter-path is called a v-tail from q to v. (It is important to note that this v-tail may not necessarily reach v itself.) We adopt the convention that the tail originates at q and terminates at u b . To illustrate, let C : v 1 v 2 v 3 v 4 v 1 . In the accompanying Hasse diagram, the v 2 -tail from q to v 2 is given by the counter-path q v 1 .
                                            Axioms 14 00876 i005
(See ([12], page 732) for a definition of v-tail.)
Lemma 3.
Let M be an R-bimodule and α I ( P , M ) an additive element. Consider a vertex p P and a cycle C contaning p. If there exists an element q P that is comparable to every vertex in C , then Υ C α ( p , p ) = 0 .
Proof. 
Let p in P , and suppose C : v 0 v 1 v k forms a cycle based at p as per the hypothesis. Assume q V ( C ) . Since p and q are comparable, let T : u 0 u 1 u b be an p-tail connecting q to p, and suppose u b = v i for some index i.
Now, consider an index i satisfying 0 < i < k , and analyze the two semipaths H 1 : v i v i + 1 v k and H 2 : v i v i 1 v 0 that both connect v i to p. It follows that the concatenated paths T H 1 and T H 2 represent two distinct semipaths from q to p. Furthermore, every vertex along these composite semipaths is comparable with the element q.
By applying the result of the previous lemma in conjunction with Lemma 1(b), we obtain the following:
Υ T α ( u 0 , u b ) + Υ H 1 α ( v i , v k ) = Υ T α ( u 0 , u b ) + Υ H 2 α ( v i , v 0 ) .
Canceling Υ T α ( u 0 , u b ) from both sides, we obtain
Υ H 1 α ( v i , v k ) Υ H 2 α ( v i , v 0 ) = 0 .
Since Υ H 2 α ( v i , v 0 ) = Υ H 2 1 α ( v 0 , v i ) , we have
Υ C α ( p , p ) = Υ H 2 1 H 1 α ( v 0 , v k ) = Υ H 2 α ( v i , v 0 ) + Υ H 1 α ( v i , v k ) = 0 .
In the special case where i = 0 or i = k , we examine the semipaths H 1 : v 0 v 1 v k 1 and H 2 : v k v k 1 . In this case, T H 1 and T H 2 are distinct semipaths from q to v k 1 such that every vertex on them is comparable to q. Likewise, we obtain Υ C α ( p , p ) = 0 . If q V ( C ) (say q = v i ), the previous arguments hold without T .
Therefore, in all cases, we conclude that Υ C α ( p , p ) = 0 . □
Corollary 4.
Let M be an R-bimodule and P a partially ordered set such that for every cycle C contained in P , there exists an element q P that is comparable to each vertex of C . Then the incidence module I ( P , M ) possesses the property that all of its derivations are inner.
Proof. 
Let α I ( P , M ) be additive. Consider any vertex p in P and an arbitrary cycle C based at p. By Lemma 3, it follows immediately that Υ C α ( p , p ) = 0 . This condition, by virtue of Corollary 3, implies that the associated additive derivation L α is inner. Since α was chosen arbitrarily, and invoking the general characterization provided in [2] (Theorem 7.1.4), we conclude that all derivations of I ( P , M ) are inner. □
Example 3.
Suppose that the partially ordered set P 4 below. According to Corollary 4, all derivations of I ( P 4 , M ) are inner.
                                            Axioms 14 00876 i006
Example 4.
Suppose that the partially ordered set P 5 is as shown below. Although no single element exists within P 5 that is comparable to every vertex comprising the cycle C 1 : v 0 v 1 v 9 v 0 , the incidence module I ( P 5 , M ) nevertheless possesses the property that all its derivations are inner. In fact, let α be an additive element of I ( P 5 , M ) , and assume that the transversal { C 1 , C 2 , C 3 } of ξ with respect to the equivalence relation defined in (2), where the representative cycles are given by C 2 : v 0 v 1 v 4 v 9 v 0 and C 3 : v 4 v 5 v 9 v 4 .
                                            Axioms 14 00876 i007
According to Lemma 3, Υ C 2 α ( v 0 , v 0 ) = Υ C 3 α ( v 4 , v 4 ) = 0 . It follows that
Υ C 1 α ( v 0 , v 0 ) = i = 0 8 η α ( v i , v i + 1 ) + η α ( v 9 , v 0 ) = i = 0 8 η α ( v i , v i + 1 ) + η α ( v 9 , v 0 ) + α ( v 4 , v 9 ) α ( v 4 , v 9 ) = i = 0 8 η α ( v i , v i + 1 ) + η α ( v 9 , v 0 ) + η α ( v 4 , v 9 ) + η α ( v 9 , v 4 ) = i = 0 3 η α ( v i , v i + 1 ) + η α ( v 4 , v 9 ) + η α ( v 9 , v 0 ) + i = 4 8 η α ( v i , v i + 1 ) + η α ( v 9 , v 4 ) = Υ C 2 α ( v 0 , v 0 ) + Υ C 3 α ( v 4 , v 4 ) = 0 .
Thus, by Theorem 2, the derivation L α is inner.
Definition 7.
A subset Q of a partially ordered set P is an antichain if no two distinct elements of Q are comparable. That is, for any p , q in Q where p q , we have neither p q nor q p . An antichain Q is an all-comparable subset if every element of P is comparable to some element of Q . In other words, for each p P , there exists q Q such that p q or q p . For finite P , all-comparable subsets exist. Examples include P ’s maximal and minimal elements. By Proposition 1 shows that if an all-comparable subset Q consists of a single element (i.e., Q = { q } ), then all additive derivations on I ( P , M ) are inner.
Theorem 3.
Let M be an R-bimodule and α be an additive element of the incidence module I ( P , M ) . Assume there exists an all-comparable subset Q P such that, for any distinct elements q 1 , q 2 Q and for any ξ 1 and ξ 2 semipaths joining q 1 to q 2 , we have Υ ξ 1 α ( q 1 , q 2 ) = Υ ξ 2 α ( q 1 , q 2 ) . Therefore, L α is an inner additive derivation.
Proof. 
Let C : v 0 v 1 v k denote a cycle in P . By Corollary 4, it suffices to prove that Γ C α ( p , p ) = 0 . The preceding lemma implies that there exists an element of C are comparable with the same q Q . Therefore, no q Q is comparable to every elements of C . Consequently, there exists successive vertices v i , v i + 1 V ( C ) and elements q 1 , q 2 Q such that v i is comparable to q 1 and v i + 1 is comparable to q 2 and not comparable to q 1 .
Now, suppose that q 1 , q 2 V ( C ) , and consider T 1 a v i -tail joining q 1 to v i and T 2 a v i + 1 -tail joining q 2 to v i + 1 . There are now two situations to take into account: when V ( T 1 ) V ( T 2 ) and when V ( T 1 ) V ( T 2 ) = . We will first show that Case 1 leads to a contradiction, and is therefore impossible.
Case 1: When V ( T 1 ) V ( T 2 ) , we assert that either v i < q 1 and q 2 < v i + 1 or v i + 1 < q 2 and q 1 < v i .
Indeed, assume that v i < q 1 and v i + 1 < q 2 , and consider u V ( T 1 ) V ( T 2 ) . Thus, v i u q 1 and v i + 1 u q 2 , which implies that v i + 1 u q 1 . This contradicts the assumption that v i + 1 is not comparable with q 1 .
Analogously, it can be shown that neither q 1 < v i nor q 2 < v i + 1 occurs. We will assume, without loss of generality, that v i < q 1 and q 2 < v i + 1 . If u V ( T 1 ) V ( T 2 ) , then v 1 u q 1 and q 2 u v i + 1 . Hence, we have q 2 u q 1 . However, this is impossible because q 1 and q 2 are distinct elements of the antichain Q , and are therefore incomparable.
Case 2: When V ( T 1 ) V ( T 2 ) = . We now examine the case where V ( T 1 ) V ( T 2 ) = . Assume the tail T 1 ends at v j V ( C ) and T 2 at v m V ( C ) . If 0 < j < m < k , define the paths H 1 : v j v j 1 v 0 , H 2 : v k v k 1 v m , and H 3 : v j v j + 1 v m . Consequently, T 1 H 1 H 2 T 2 1 and T 1 H 3 T 2 1 constitute two semipaths joining q 1 to q 2 . According to the hypothesis,
Υ T 1 H 1 H 2 T 2 1 α ( q 1 , q 2 ) = Υ T 1 H 3 T 2 1 α ( q 1 , q 2 ) .
From Lemma 1, it follows that
Υ H 1 H 2 α ( v j , v m ) = Υ H 3 α ( v j , v m ) .
Hence,
Υ C α ( p , p ) = Υ C α ( v 0 , v k ) = Υ H 1 1 H 3 H 2 1 α ( v 0 , v k ) = 0 .
In the special cases where 0 = j < m < k , the argument omits H 1 ; for 0 < j < m = k , it omits H 2 . The case 0 = j < m = k is impossible, as V ( T 1 ) V ( T 2 ) = .
Finally, by considering semipaths without the tails T 1 or T 2 , the reasoning holds if q 1 V ( C ) or q 2 V ( C ) .
We have thus shown that Γ C α ( p , p ) = 0 in all cases. By Corollary 3, it follows that the additive derivation L α is inner, which completes the proof. □
Example 5.
The incidence module of the partially ordered set P 6 below does not satisfy the condition that all additive derivations are inner. However, by applying our previous result, we can construct an additive derivation that is inner, as demonstrated below.
                                            Axioms 14 00876 i008
In this example, Q = { q 1 , q 2 } is the all comparable subset of P 6 that satisfies Theorem 3. Although there are seven semipaths joining q 1 to q 2 , the direct weights sum for each of these seven semipaths is the same.

3.2. P Locally Finite

In this subsection, we address the situation in which P denotes an arbitrary locally finite poset, meaning that every interval [ p , q ] in P is finite. Consider the decomposition P = j J P j of P into connected components, with each P j being a maximal connected subset. It is easy to show that the map δ : I ( P , M ) j J I ( P j , M ) , defined by δ ( f ) j = f | P j × P j for every j J , is an isomorphism of modules. Intuitively, δ restricts a function f I ( P , M ) to each connected component P j . Since the connected components { P j } j J form a partition of P , this map δ is well-defined and making it an isomorphism of module.
Lemma 4.
Let P = j J P j be the decomposition of P into its connected components, and let α I ( P , M ) , where M is an R-bimodule. Then, α is potential (additive) if and only if α | P j × P j is a potential (additive) element of I ( P j , M ) for all j J .
Proof. 
Suppose α is potential. Then, there exists a function g : P M such that α ( p , q ) = g ( q ) g ( p ) for all p q P . For each j J , let g j = g | P j be the restriction of g to P j . Since P j is connected, for all p q P j , we have
α | P j × P j ( p , q ) = α ( p , q ) = g ( q ) g ( p ) = g j ( q ) g j ( p ) .
Thus, For each j J , α | P j × P j is a potential element of I ( P j , M ) .
Conversely, suppose that α | P j × P j is a potential element of I ( P j , M ) for every j in J. Thus, for each j J , there exists a function f j : P j M such that
α | P j × P j ( p , q ) = f j ( q ) f j ( p ) , for all p q in P j .
Define f : P M by f ( p ) = f j ( p ) if p P j . This is well-defined since { P j } j J forms a disjoint partition of P . Therefore, if p , q in P satisfy p q , then both p and q belong to the same connected component P j of P for some j J . Hence,
α ( p , q ) = α | P j × P j ( p , q ) = f j ( q ) f j ( p ) = f ( q ) f ( p ) .
Thus, α is a potential element of I ( P , M ) .
It follows directly that α is additive if and only if α | P j × P j is additive for every j J . To see this, note that if p q z in P , then p, q, and z must all lie in the same connected component P j . Hence, the additivity of α on each P j implies the additivity of α on P . □
Combining the preceding lemma with ([2], Proposition 7.1.6), we obtain the following result.
Theorem 4.
Let P = j J P j be the decomposition of P into connected components, and let M be an R-bimodule. The additive derivation L α of I ( P , M ) is inner if and only if, for each j J , L α | P j × P j is inner.
Corollary 5.
Let P = j J P j be the decomposition of P into connected components, and M an R-bimodule. If each P j has an element comparable to all others in P j , then every derivation of I ( P , M ) is inner.
Proof. 
This follows from Theorem 4 and Proposition 1. □
Combining the preceding lemma with [2] (Proposition 7.1.6) yields the following result.
Example 6.
The poset P below has only inner derivations on I ( P , M ) , by Theorem 4, Corollary 2, and Example 4.
                              Axioms 14 00876 i009
Example 7.
Let P = j J P j be the decomposition of the locally finite poset P into its connected components as shown below.
                                       Axioms 14 00876 i010
As a result of Theorem 4 and Corollary 4, it follows that all derivations of I ( P , M ) are inner.

Author Contributions

Conceptualization, N.U. and H.Y.; methodology, N.U.; validation, N.U., H.Y. and D.A.; formal analysis, I.S.C.; investigation, N.U.; resources, H.Y.; writing—original draft preparation, N.U.; writing—review and editing, I.S.C.; visualization, H.Y. and D.A.; supervision, H.Y.; project administration, I.S.C.; funding acquisition, D.A. All authors have read and agreed to the published version of the manuscript.

Funding

The APC was funded by Deanship of Graduate Studies and Scientific Research at Qassim University for providing financial support (QU-APC-2025).

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Yang, Y.; Wei, F. Nonlinear Lie-Type derivations of finitary incidence algebras and related topics. arXiv 2021, arXiv:2105.10685. [Google Scholar] [CrossRef]
  2. Spiegel, E.; Ó Donnel, C.J. Incidence Algebra; Monographs and Textbooks, Pure and Applied Mathematics; Marcel Dekker: New York, NY, USA, 1997; Volume 206. [Google Scholar]
  3. Baclawski, K. Automorphisms and derivations of incidence algebras. Proc. Am. Math. Soc. 1972, 36, 351–356. [Google Scholar] [CrossRef][Green Version]
  4. Khripchenko, N.S. Derivations of finitary incidence rings. Commun. Algebra 2012, 40, 2503–2522. [Google Scholar] [CrossRef]
  5. Stanley, R. Structure of incidence algebras and their automorphism groups. Bull. Am. Math. Soc. 1970, 76, 1236–1239. [Google Scholar] [CrossRef][Green Version]
  6. Xiao, Z. Jordan derivations of incidence algebras. Rocky Mt. J. Math. 2015, 45, 1357–1368. [Google Scholar] [CrossRef][Green Version]
  7. Herstein, I.N. Lie and Jordan structures in simple, associative rings. Bull. Am. Math. Soc. 1961, 67, 517–531. [Google Scholar] [CrossRef]
  8. Wang, D.; Xiao, Z. Lie triple derivations of incidence algebras. Commun. Algebra 2019, 47, 1841–1852. [Google Scholar] [CrossRef]
  9. Zhang, X.; Khrypchenko, M. Lie derivations of incidence algebras. Linear Algebra Its Appl. 2017, 513, 69–83. [Google Scholar] [CrossRef][Green Version]
  10. Bollobás, B. Modern Graph Theory; Graduate Texts in Mathematics; Springer: New York, NY, USA, 1998; Volume 184, pp. 181–214. [Google Scholar]
  11. Bang-Jensen, J.; Gutin, G. Digraphs: Theory, Algorithms and Applications, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 2009; p. 12. [Google Scholar]
  12. Brusamarello, R.; Fornaroli, É.Z.; Santulo, E.A., Jr. Multiplicative automorphisms of incidence algebras. Commun. Algebra 2015, 43, 726–736. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Ullah, N.; Yao, H.; Alhwikem, D.; Chuhan, I.S. Additive Derivations of Incidence Modules. Axioms 2025, 14, 876. https://doi.org/10.3390/axioms14120876

AMA Style

Ullah N, Yao H, Alhwikem D, Chuhan IS. Additive Derivations of Incidence Modules. Axioms. 2025; 14(12):876. https://doi.org/10.3390/axioms14120876

Chicago/Turabian Style

Ullah, Naseer, Hailou Yao, Dalal Alhwikem, and Imran Shabir Chuhan. 2025. "Additive Derivations of Incidence Modules" Axioms 14, no. 12: 876. https://doi.org/10.3390/axioms14120876

APA Style

Ullah, N., Yao, H., Alhwikem, D., & Chuhan, I. S. (2025). Additive Derivations of Incidence Modules. Axioms, 14(12), 876. https://doi.org/10.3390/axioms14120876

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop