The automorphism group of the zero-divisor digraph of matrices over an antiring
David Dolžan
Faculty of Mathematics and Physics, University of Ljubljana, Jadranska 21, 1000 Ljubljana, Slovenia
IMFM, Jadranska 19, 1000 Ljubljana, Slovenia
[email protected]
and
Gabriel Verret
Department of Mathematics, University of Auckland, Private Bag 92019, Auckland 1142, New Zealand
[email protected]
Abstract.
We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors.
Key words and phrases:
Automorphism group of a graph, Zero-divisor graph, Semiring
2010 Mathematics Subject Classification:
05C60, 16Y60, 05C25
1. Introduction
In recent years, the zero-divisor graphs of various algebraic structures have received a lot of attention, since they are a useful tool for revealing the algebraic properties through their graph-theoretical properties. In 1988, Beck [5] first introduced the concept of the zero-divisor graph of a commutative ring. In 1999, Anderson and Livingston [1] made a slightly different definition of the zero-divisor graph in order to be able to investigate the zero-divisor structure of commutative rings. In 2002, Redmond [16] extended this definition to also include non-commutative rings. Different authors then further extended this concept to semigroups [8], nearrings [6] and semirings [2].
Automorphisms of graphs play an important role both in graph theory and in algebra, and finding the automorphism group of certain graphs is often very difficult. Recently, a lot of effort has been made to determine the automorphism group of various zero-divisor graphs. In [1], Anderson and Livingston proved that Aut(Γ(Zn)) is a direct product of symmetric groups for n≥4 a non-prime integer. In the non-commutative case, the case of matrix rings and semirings is especially interesting. Thus, it was shown in [10] that, when p is a prime, Aut(Γ(M2(Zp)))≅Sym(p+1). More generally, it was proved in [14], that Aut(Γ(M2(Fq)))≅Sym(q+1). In [19], the authors determined the automorphism group of the zero-divisor graph of all rank one upper triangular matrices over a finite field, and in [17] they determined the automorphism group of the zero-divisor graph of the matrix ring of all upper triangular matrices over a finite field. Recently, the automorphism group of the zero-divisor graph of the complete matrix ring of matrices over a finite field have been found independently in [18] and [21].
In this paper, we study the zero-divisor graph of matrices over commutative semirings. The theory of semirings has many applications in optimization theory, automatic control, models of discrete event networks and graph theory (see e.g. [4, 7, 12, 20]) and the zero-divisor graphs of semirings were recently studied in [3, 9, 15]. For an extensive theory of semirings, we refer the reader to [11]. There are many natural examples of commutative semirings, for example, the set of nonnegative integers (or reals) with the usual operations of addition and multiplication. Other examples include distributive lattices, tropical semirings, dioïds, fuzzy algebras, inclines and bottleneck algebras.
The theory of matrices over semirings differs quite substantially from the one over rings, so the methods we use are necessarily distinct from those used in the ring setting. The main result of this paper is the determination of the automorphism group of the zero-divisor digraph of a semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors (see Theorem 3.12).
2. Definitions and preliminaries
2.1. Digraphs
A digraph Γ consists of a set V(Γ) of vertices, together with a binary relation → on V(Γ). An automorphism of Γ is a permutation of V(Γ) that preserves the relation →. The automorphisms of Γ form its automorphism group Aut(Γ).
Let Γ be a digraph and let v∈V(Γ). We write N−(v)={u∈V(Γ):u→v} and N+(v)={u∈V(Γ):v→u}. If, for u,v∈V(Γ), we have N−(u)=N−(v) and N+(u)=N+(v), then we say u and v are twin vertices. The relation ∼ on V(Γ), defined by u∼v if and only if u and v are twin vertices, is clearly an equivalence relation preserved by Aut(Γ). We will denote by Γ the factor digraph Γ/∼. For v∈V(Γ), we shall denote by v the image of v in Γ and, for σ∈Aut(Γ), by σ the induced automorphism of Γ. An automorphism σ∈Aut(Γ) is called regular if σ is trivial.
2.2. Semirings
A semiring is a set S equipped with binary operations + and ⋅ such that (S,+) is a commutative monoid with identity element 0, and (S,⋅) is a semigroup. Moreover, the operations + and ⋅ are connected by distributivity and 0 annihilates S.
A semiring S is commutative if ab=ba for all a,b∈S, and antinegative if, for all a,b∈S, a+b=0 implies that a=0 or b=0. Antinegative semirings are also called zerosum-free semirings or antirings. The smallest
nontrivial example of an antiring is the Boolean antiring B={0,1} with addition and multiplication defined so that
1+1=1⋅1=1.
Let S be a semiring. For x∈S, we define the left and right annihilators in S by AnnL(x)={y∈S:yx=0} and AnnR(x)={y∈S:xy=0}. If S is commutative, we simply write Ann(x) for AnnL(x)=AnnR(x). We denote by Z(S) the set of zero-divisors of S, that is Z(S)={x∈S:∃y∈S∖{0} such that xy=0 or yx=0}. The zero-divisor digraph Γ(S) of S is the digraph with vertex-set S and u→v if and only if uv=0.
It is easy to see that if n≥1 and S is a semiring, then the set Mn(S) of n×n matrices forms a semiring with respect to matrix addition and multiplication. If S is antinegative, then so is Mn(S). If S has an identity 1, let Eij∈Mn(S) with entry 1 in position (i,j), and [math] elsewhere.
3. The automorphisms of the zero-divisor digraph
The following fact will be used repeatedly.
Lemma 3.1**.**
Let S be a semiring. If A,B∈S and σ∈Aut(Γ(S)), then
[TABLE]
Proof.
We have
[TABLE]
The proof of the second part is analogous.
∎
Lemma 3.2**.**
Let S be an antiring and let Γ=Γ(S). If A,B∈S and σ∈Aut(Γ), then σ(A+B) and σ(A)+σ(B) are twin vertices and, in particular, σ(A+B)=σ(A)+σ(B).
Proof.
Using antinegativity, we have
[TABLE]
We have proved that AnnL(σ(A+B))=AnnL(σ(A)+σ(B)). An analogous proof yields AnnR(σ(A+B))=AnnR(σ(A)+σ(B)).
This implies that σ(A+B) and σ(A)+σ(B) are twin vertices.
∎
Definition 3.3**.**
Let S be a commutative semiring, let n∈N and let A∈Mn(S) with (i,j) entry aij. For every i,j∈{1,…,n}, we define Ci(A)=⋂k=1nAnn(aki) and Rj(A)=⋂k=1nAnn(ajk). Let AR(A):=(C1(A),…,Cn(A))∈Sn and AL(A):=(R1(A),…,Rn(A))∈Sn.
The next theorem characterizes the twin vertices of Γ(Mn(S)).
Theorem 3.4**.**
Let S be a commutative antiring, let n∈N and let A,B∈Mn(S). Then A and B are twin vertices of Γ(Mn(S)) if and only if AL(A)=AL(B) and AR(A)=AR(B).
Proof.
Let aij and bij be the (i,j) entry of A and B, respectively. Suppose first that A and B are twin vertices of Γ(Mn(S)) and assume that AR(A)=AR(B). This implies that, for some i∈{1,…,n}, we have Ci(A)=Ci(B). Swapping the role of A and B if necessary, there exists s∈S such that s∈Ci(A) and s∈/Ci(B). Therefore, there exists k∈{1,…,n} such that s∈/Ann(bki). Now, let C=sEik∈Mn(S) and observe that AC=0 but BC=0, so N+(A)=N+(B), which is a contradiction with the fact that A and B are twin vertices. We have thus proved that AR(A)=AR(B). A similar argument yields that AL(A)=AL(B).
Conversely, assume now that AL(A)=AL(B) and AR(A)=AR(B). Suppose there exists X∈Mn(S) such that AX=0. Therefore, for all i,j∈{1,…,n} we have ∑k=1naikxkj=0. Since S is an antiring, this further implies that aikxkj=0 for all i,j,k∈{1,…,n}. So, xkj∈Ann(aik) and therefore xkj∈Ck(A)=Ck(B) for all k∈{1,…,n}. Thus, for all i,j,k∈{1,…,n}, we have xkj∈Ann(bik). This yields
bikxkj=0 for all i,j,k∈{1,…,n}, so BX=0. Thus, we have proved that N+(A)⊆N+(B). By swapping the roles of A in B we also get
N+(B)⊆N+(A), so N+(A)=N+(B). A similar argument yields that N−(A)=N−(B), thus A and B are twin vertices.
∎
Definition 3.5**.**
Let S be a commutative semiring and let α∈S∖Z(S). We say that α=e1+e2+⋯+es such that ei=0 for all i and eiej=0 for all i=j is a decomposition of α of length s. The length ℓ(α) of α is the supremum of the length of a decomposition of α. We say that α is of maximal length if ℓ(α)≥ℓ(β) for all β∈S∖Z(S).
A semiring is decomposable if it contains an element of length at least 2, otherwise it is indecomposable.
The next lemma shows that in the case S is decomposable, we can study the automorphisms of the zero-divisor digraph of the matrix ring componentwise.
Lemma 3.6**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Let n∈N and σ∈Aut(Γ(Mn(S))). Then there exists ω∈Sym(s) such that, for every r∈{1,…,s}, we have σ(erMn(S))=eω(r)Mn(S).
Proof.
Let r∈{1,…,s}, let i,j∈{1,…,n} and let B=σ(erEij). So, σ(erEij)
=∑k=1sekB.
By Lemma 3.2, we have erEij=∑k=1sσ−1(ekB). Since S is antinegative, for every k∈{1,…,s}, there exists fk∈S such that σ−1(ekB)=fkEij and ∑k=1sfk=erz for some z∈S∖Z(S).
Let k,k′∈{1,…,s}. We have AnnL(fkEij),AnnL(fk′Eij)⊆AnnL(fkfk′Eij) hence AnnL(ekB),AnnL(ek′B)⊆AnnL(σ(fkfk′Eij)). If k=k′, then Mn(αS)⊆AnnL(ekB)+AnnL(ek′B), which is possible only if fkfk′=0. We have shown that fkfk′=0 for every k,k′∈{1,…,s} with k=k′.
Since α is not a zero-divisor, we have Γ(S)=Γ(αS) and, by Theorem 3.4, also Γ(Mn(S))=Γ(Mn(αS)). For t∈{1,…,s}, t=r, we have ∑k=1sfket=eretz=0. By antinegativity, this implies that fket=0 for every k∈{1,…,s}. It follows that
[TABLE]
is a decomposition of αz. Since z∈/Z(S), eiz=0 and, since ℓ(zα)≤ℓ(α)=s, it follows that all but exactly one of the fk’s are [math]. This implies that all but one of the ekB’s are [math] and there exists k∈{1,…,s} such that σ(erEij)=ekB. This shows the existence of a permutation ω∈Sym(s) such that σ(erEij)=eω(r)B.
Let t∈{1,…,n}. Since α∈/Z(S), we have αer=0 thus er2=0, erEijerEjt=0 and (eω(r)B)σ(erEjt)=0. Since Γ(Mn(S))=Γ(Mn(αS)), this implies σ(erEjt)∈eω(r)Mn(S).
As this holds for all j,t∈{1,…,n}, we have σ(erMn(S))⊆eω(r)Mn(S). However, a twin vertex to a vertex from from erMn(S) is itself in erMn(S), therefore also σ(erMn(S))⊆eω(r)Mn(S). Since σ is a bijection, σ(erMn(S))=eω(r)Mn(S).
∎
Lemma 3.7**.**
Let S be a commutative antiring and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Then, for every i∈{1,…,s}, the subsemiring eiS is indecomposable.
Proof.
Suppose that eiS is decomposable for some i∈{1,…,s}, say i=1 without loss of generality. By definition, there exists e1w∈e1S∖Z(e1S) such that e1w=f1+f2, where f1,f2∈e1S∖{0} and f1f2=0. For all j=1, we have eje1w=0 and thus ejf1=ejf2=0 by antinegativity. Let β=e1w+e2+⋯+es.
Suppose that βx=0 for some x∈S. By antinegativity, we have (e1w)(e1x)=0 and e2x=⋯=esx=0. Since e1w is not a zero-divisor in e1S this implies that e1x=0 and therefore also αx=0. However, α is not a zero-divisor, so we can conclude that x=0.
This shows that β=f1+f2+e2+⋯+es is not a zero-divisor in S, which is a contradiction with the maximal length of α.
∎
We first focus on the automorphisms restricted to the matrices over indecomposable subsemirings.
Proposition 3.8**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Let u,v∈{1,…,s}, S1=euS and S2=evS. Let n∈N and σ∈Aut(Γ(Mn(S))) such that σ(Mn(S1))=Mn(S2). If i,j∈{1,…,n}, then there exist y∈S2∖Z(S2) and k,ℓ∈{1,…,n} such that σ(euEij)=yEkℓ.
Proof.
Write σ(euEij)=∑k,ℓβkℓEkℓ. Let Akℓ=σ−1(βkℓEkℓ). By Lemma 3.2, σ(euEij) and σ(∑k,ℓAkℓ) are twin vertices, therefore euEij and ∑k,ℓAkℓ are twin vertices as well. Now, twin vertices of euEij must be of the form zEij, so ∑k,ℓAkℓ=zEij for some z∈S1.
Since S is antinegative, we can conclude that, for all k,ℓ∈{1,…,n}, there exist
αkℓ∈S1 such that Akℓ=αkℓEij and ∑k,ℓαkℓ=z.
Let k,k′,ℓ,ℓ′∈{1,…,n} with (k,ℓ)=(k′,ℓ′). Now, we either have k=k′ or ℓ=ℓ′. Suppose first that k=k′. Since S is commutative, we have AnnL(Akℓ)=AnnL(αkℓEij)⊆AnnL(αkℓαk′ℓ′Eij). By Lemma 3.1, this implies AnnL(βkℓEkℓ)⊆AnnL(σ(αkℓαk′ℓ′Eij)). Similarly, we have AnnL(βk′ℓ′Ek′ℓ′)⊆AnnL(σ(αkℓαk′ℓ′Eij)). Since k=k′, Mn(S)=AnnL(βkℓEkℓ)+AnnL(βk′ℓ′Ek′ℓ′)⊆AnnL(σ(αkℓαk′ℓ′Eij)), which implies σ(αkℓαk′ℓ′Eij)=0 and thus αkℓαk′ℓ′=0. If ℓ=ℓ′, we arrive at the same conclusion by using right annihilators, namely that distinct αkℓ’s annihilate each other. Since S1 is indecomposable by Lemma 3.7, the sum ∑k,ℓαkℓ=z has at most one non-zero summand. It follows that there is at most one non-zero Akℓ and at most one non-zero βkℓEkℓ. This concludes the proof of the first part, with y=βkℓ.
It remains to show that y∈/Z(S2). Suppose, on the contrary, that y∈Z(S2). By the first part of the result, there exist y′∈S1 and i′,j′∈{1,…,n} such that σ−1(evEkℓ)=y′Ei′j′. Since y∈Z(S2), we have AnnL(evEkℓ)⊂AnnL(yEkℓ) and AnnR(evEkℓ)⊂AnnR(yEkℓ). By Lemma 3.1, it follows that AnnL(y′Ei′j′)⊂AnnL(euEij) and of course also AnnR(y′Ei′j′)⊂AnnR(euEij). This is only possible if i=i′ and j=j′ which implies AnnL(y′Eij)⊂AnnL(euEij), a contradiction.
∎
Lemma 3.9**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Let u,v∈{1,…,s}, S1=euS and S2=evS. Let n∈N and σ∈Aut(Γ(Mn(S))) such that σ(Mn(S1))=Mn(S2). If x∈Z(S1) and i,j∈{1,…,n}, then there exist z∈Z(S2) and k,ℓ∈{1,…,n} such that σ(xEij)=zEkℓ.
Proof.
By Proposition 3.8, we know that σ(euEij)=yEkℓ for some y∈/Z(S2) and k,ℓ∈{1,…,n}. Since x∈Z(S1), we have AnnL(Eij)⊂AnnL(xEij) and AnnR(Eij)⊂AnnR(xEij). By Lemma 3.1, it follows that AnnL(yEkℓ)⊂AnnL(σ(xEij)) and also AnnR(yEkℓ)⊂AnnR(σ(xEij)). This implies that all entries of σ(xEij) are zeros except entry (k,ℓ), so σ(xEij)=zEkℓ for some z∈S2. Because AnnL(yEkℓ)=AnnL(σ(xEij))=AnnL(zEkℓ) and AnnR(yEkℓ)=AnnR(σ(xEij))=AnnR(zEkℓ), we must have z∈Z(S2).
∎
Lemma 3.10**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Let u,v∈{1,…,s}, S1=euS and S2=evS. Let n∈N and σ∈Aut(Γ(Mn(S))) such that σ(Mn(S1))=Mn(S2). Then there exists π∈Sym(n) such that
σ(euEij)=evEπ(i)π(j) for all i,j∈{1,…,n}.
Proof.
Let i,j,j′∈{1,…,n} with j=j′. By Proposition 3.8, there exist k,k′,ℓ,ℓ′∈{1,…,n} such that σ(euEij)=evEkℓ and σ(euEij′)=evEk′ℓ′. For all r,s∈{1,…,n} with s=i, we have euErs(euEij+euEij′)=0. By Lemma 3.2, this implies that σ(euErs)(euEkℓ+euEk′ℓ′)=0 and thus (∑r,s=iσ(euErs))(euEkℓ+euEk′ℓ′)=0. By Proposition 3.8, σ(euErs)=evEr′s′ for some r′,s′∈{1,…,n}. Since σ is a permutation, ∑r,s=iσ(euErs) is a matrix with exactly n entries equal to [math]. It follows that k=k′.
By the paragraph above, there exists π∈Sym(n) such that σ(euEab)=evEπ(a)c, for some c. A similar argument yields that there exists a permutation such that σ(euEab)=evEcπ′(b), for some c. However, for every j,k∈{1,…,n} with j=k, we have EjjEkk=0 and thus Eπ(j)π′(j)Eπ(k)π′(k)=0. This implies that π(k)=π′(j) for every k=j, so π(j)=π′(j).
Therefore π′=π.
∎
For π∈Sym(n) and A∈Mn(S), let θπ(A) be the matrix obtained from A by applying the permutation π to its rows and columns. Note that θπ induces a permutation of Mn(S).
Corollary 3.11**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Let u,v∈{1,…,s}, S1=euS and S2=evS. Let n∈N and σ∈Aut(Γ(Mn(S))) such that σ(Mn(S1))=Mn(S2). Then there exist π∈Sym(n) and τ an isomorphism from Γ(S1) to Γ(S2) such that, if we extend τ to a mapping Mn(S1)→Mn(S2) and restrict σ to Mn(S1), then σ=θπ∘τ.
Proof.
By Lemma 3.10, there exists π∈Sym(n) such that σ(euEij)=θπ(evEij) for all i,j∈{1,…,n}. Let ρ=θπ−1∘σ and note that ρ∈Aut(Γ(Mn(S))) and we have ρ(euEij)=evEij for all i,j∈{1,…,n}.
Let x∈Z(S1) and i,j,j′∈{1,…,n}. Clearly, ρ(Mn(S1))=Mn(S2) so, by Lemma 3.9, there exist z,z′∈Z(S2) such that ρ(xEij)=zEij and ρ(xEij′)=z′Eij′.
We show that Ann(z)⊆Ann(z′). Let a∈S2 such that az=0. Note that (aEii)(zEij)=0. Since a∈Z(S2), Lemma 3.9 implies that there exists b∈Z(S1) such that aEii=ρ(bEii), hence ρ(bEii)ρ(xEij)=0 and therefore also (bEii)(xEij)=0 which implies bx=0. It follows that (bEii)(xEij′)=0, ρ(bEii)ρ(xEij′)=0 and (aEii)(z′Eij′)=0 which yields az′=0.
We have shown that Ann(z)⊆Ann(z′). A symmetrical argument yields Ann(z′)⊆Ann(z) hence Ann(z)=Ann(z′) which implies that ρ(xEij′)=z′Eij′=zEij′. A similar argument shows that ρ(xEi′j)=zEi′j for all i′∈{1,…,n}. This implies that ρ(xEkℓ)=zEkℓ for all k,ℓ∈{1,…,n}.
Let τ denote the mapping S1→S2 that satisfies ρ(xE11)=τ(x)E11. Since ρ is a bijection from Mn(S1) to Mn(S2), τ is a bijection from S1 to S2. If x,y∈S1, then xy=0 if and only if (xE11)(yE11)=0 if and only if τ(x)τ(y)=0, therefore τ is an isomorphism from Γ(S1) to Γ(S2). Now, extend τ to an entry-wise mapping Mn(S1)→Mn(S2). It is easy to check that τ induces an isomorphism from Γ(Mn(S1)) to Γ(Mn(S2)) and that, restricted to V(Γ(Mn(S1))), we have ρ=τ. As σ=θπ∘ρ, this concludes the proof.
∎
We can now join these findings into the following theorem.
Theorem 3.12**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Let n∈N and σ∈Aut(Γ(Mn(S))). Then there exist ω∈Sym(s) and, for every i∈{1,…,s}, there exist πi∈Sym(n) and an isomorphism τi:Γ(eiS)→Γ(eω(i)S) such that, if we extend τi to a mapping Mn(eiS)→Mn(eω(i)S), then
[TABLE]
Conversely, if ω∈Sym(s) has the property that, for every i∈{1,…,s}, we have Γ(eiS)≅Γ(eω(i)S), τi is an isomorphism from Γ(eiS) to Γ(eω(i)S) and πi∈Sym(n), then σ defined with σ(A)=∑i=1s(θπi∘τi)(eiA) is an automorphism of Γ(Mn(S)).
Proof.
By Lemma 3.6, there exists ω∈Sym(s) such that, for every i∈{1,…,s}, we have σ(eiMn(S))=eω(i)Mn(S).
By Corollary 3.11, there exist πi∈Sym(n) and τi an isomorphism from Γ(eiS) to Γ(eω(i)S) such that, if we extend τi to a mapping Mn(eiS)→Mn(eω(i)S) and restrict σ to Mn(eiS), then σ=θπi∘τi.
Now, let A∈Mn(S). By Theorem 3.4, A=αA=e1A+e2A+⋯+esA and the result follows by Lemma 3.2.
∎
The following is a well-known easy exercise.
Observation 3.13**.**
Let Γ be a digraph and let Γt be the vertex-labelled digraph obtained from Γ by labelling every v∈Γ with the size of the ∼-equivalence class of v. Let Aut(Γt) be the labelling-preserving group of automorphisms of Γt and let K be the group of regular automorphisms of Γ. If the sizes of the ∼-equivalence classes in Γ are c1,…,cn, then K≅∏i=1nSym(ci) and Aut(Γ)≅K⋊Aut(Γt).
Corollary 3.14**.**
Let S be a commutative antiring with identity
and let α∈S∖Z(S) be of maximal length s with decomposition α=e1+e2+⋯+es. Say that ei is equivalent to ej if Γ(eiS)≅Γ(ejS). This defines a partition of {e1,…,es}. Up to relabelling, we may assume that {e1,…,ep} forms a complete set of representative of the equivalence classes. For i∈{1,…,p}, let xi be the size of the equivalence class of ei. Let n∈N and let K be the group of regular automorphisms of Γ(Mn(S)). Then
[TABLE]
Remark 3.15**.**
By Observation 3.13, K≅∏i=1nSym(ci), where the ci’s are the sizes of the ∼-equivalence classes in Γ(Mn(S)). Finding these sizes is in general quite difficult. For example, consider the following very basic situation: let J∈Mn(B) be the all-1’s matrix. By Theorem 3.4, twins of J in Γ(Mn(B)) are precisely the n×n {0,1}-matrices with no row or column of [math]’s. There is no known closed formula for the number of such matrices (see [13]).
Remark 3.16**.**
Throughout the paper, we restricted ourselves to studying semirings with the property that no non-zero-divisor element can be written as a sum of infinitely many mutually orthogonal zero-divisors. Obviously, any semiring with a finite set of zero-divisors satisfies this condition.
Acknowledgements
The first author acknowledges the financial support from the Slovenian Research Agency (research core funding no. P1-0222).