SOME PROPERTIES ON THE POWERS OF n-ary RELATIONAL SYSTEMS 1

Transcription

1 Novi Sad J. Math. Vol. 43, No. 2, 2013, SOME PROPERTIES ON THE POWERS OF n-ary RELATIONAL SYSTEMS 1 Nitima Chaisansuk 2 and Sorasak Leeratanavalee 3 Abstract. In the paper, we study the properties of n-ary relational systems with respect to a decomposition of the corresponding index set. It is a common generalization of certain properties of binary and ternary relational systems. For each of the properties, we give sufficient condition under which this property is preserved by powers of relational systems. AMS Mathematics Subject Classification (2010): 08A02, 08A05 ey words and phrases: b-decomposition, t-decomposition, relational systems, power, diagonal, reflexive 1. Introduction In [1], G. Birkhoff introduced the operation of a cardinal power of partially ordered sets and showed the validity of the first exponential law for the operation, i.e., the law (A B ) C = A B C. In [9], J. Šlapal extended the concept of direct (i.e., cardinal) power from partially ordered sets onto n-ary relational systems (cf. also [7]). In [6], M. Novotný and J. Šlapal, introduced and studied a power of n-ary relational systems in which they generalized the direct power investigated in [7, 9]. In [2], we studied the powers of n-ary relational systems, improved and completed the results from [6, 7, 9]. In [8], J. Šlapal extended the fundamental concepts concerning binary and ternary relations to general relations. Therefore, some results are analogous to the well-known ones of the theory of binary relations, but many results are new. In this paper, we study some properties of relations which were defined in [8] and discuss these properties on n-ary relational systems. We solve the problem of finding sufficient conditions under which some properties of relational systems (from [8]) are preserved by powers (from [6]) of these systems. 2. Preliminaries Some relevant definitions that are considered to be necessary will be given in further sections. Throughout this paper, n denotes a positive integer. Let 1 This research was supported by the Royal Golden Jubilee Ph.D. Program of the Thailand Research Fund., the Graduate School, Chiang Mai University. The corresponding author was supported by Chiang Mai University, Chiang Mai, Thailand. 2 Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand, nitimachaisansuk@gmail.com 3 Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand, scislrtt@chiangmai.ac.th

2 192 Nitima Chaisansuk, Sorasak Leeratanavalee A and H be nonempty sets and let A H be a set of all mappings from H into A. A sequence in A is any mapping from H into A. The notation for sequences is suitably defined as (a h h H). In case of H = {1,..., n}, the notation (a 1,..., a n ) is used instead of (a h h H). The set of all mappings from {1,..., n} into A is commonly identified with the cartesian power A n = A... A. By a relation R in the general sense, it means a set }{{} n terms of mappings R A H. The pair (A, R) is called a relational system of type H. The sets A and H are the carrier set and the index set of R, respectively. In case of H = {1,..., n}, R A H is called an n-ary relation on A and (A, R) is said to be an n-ary relational system. If H = {1, 2}, R A H, then (A, R) is called a binary relational system-see e.g. [4, 3, 5]. Let A = (A, R), B = (B, S) be a pair of n-ary relational systems. A mapping f : B A is said to be a homomorphism of B into A if (x 1,..., x n ) S, yields (f(x 1 ),..., f(x n )) R. We denote by Hom(B, A) the set of all homomorphisms of B into A. If f : B A is a bijection and both f : B A and f 1 : A B are homomorphisms, then f is called an isomorphism of B onto A. If there exists an isomorphism of B onto A we say that B and A are isomorphic, in symbols B = A. An n-ary relational system A = (A, R) is said to be (i) reflexive provided that (x 1,..., x n ) R whenever x 1 =... = x n. (ii) diagonal provided that, whenever (x ij ) is an n n-matrix over A, from (x 1j,..., x nj ) R for each j = 1,..., n and (x i1,..., x in ) R for each i = 1,..., n it follows that (x 11,..., x nn ) R. Let A = (A, R) and B = (B, S) be n-ary relational systems. According to [6], we define the power A B by A B = (Hom(B, A), r), where for any f 1,..., f n Hom(B, A), (f 1,..., f n ) r if and only if (x 1,..., x n ) S implies (f 1 (x 1 ),..., f n (x n )) R whenever x 1,..., x n B. Theorem 2.1. [2] Let A, B, C be n-ary relational systems. If C is reflexive, then (A B ) C = A B C, where B C is the cartesian product of B and C. According to [8], we define the concepts of general relations as following. Let H be a set with card H 2 (card H 3). Then a sequence of three (four) sets = { i } 3(4) i=1 is called a b-decomposition (t-decomposition) of the set H if (i) 3(4) i=1 i = H, (ii) i j = for all i, j {1, 2, 3} (i, j {1, 2, 3, 4}, i j), (iii) 0 < card 1 = card 2 (0 < card 1 = card 2 = card 3 ). Let A, H be sets and let = { i } 3(4) i=1 be a b-decomposition (t-decomposition) of H. If R, S A H, then we define the relations

3 Some properties on the powers of n-ary relational systems 193 (i) E A H, called the diagonal with regard to if: (ii) R 1 f E f( 1 ) = f( 2 ), AH, called the inversion of R with regard to if: f R 1 g R : f( 1) = g( 2 ), f( 2 ) = g( 1 ), f( i ) = g( i ) for i = 3 (for i = 3, 4), (iii) (RS) A H, called the composition of R and S with regard to if: f (RS) g R, h S : f( 1 ) = g( 1 ), f( 2 ) = h( 2 ), f( i ) = g( i ) = h( i ) for i = 3 (for i = 3, 4) and g( 2 ) = h( 1 ). Further, we put R 1 = R and Rn+1 = (R n R) for every n N. R n is called the n-th power of R with regard to. Let R A H be a relation with card H 2 (card H 3) and let = { i } 3(4) i=1 be a b-decomposition (t-decomposition) of the set H. Then R is called (i) reflexive (areflexive) with regard to if E R (R E = ), (ii) symmetric (asymmetric, antisymmetric) with regard to if R 1 R (R =, R R 1 E ), R 1 (iii) transitive (intransitive) with regard to if R 2 R (R Rn =, for every n N), (iv) regular with regard to if f R, g A H, f( i ) = g( i ) for i = 1, 2, 3 (for i = 1, 2, 3, 4) g R. Remark 2.2. Let A, B, C be n-ary relational systems with card H = n, n 2 (n 3) and let = { i } 3(4) i=1 be a b-decomposition (t-decomposition) of the set H. (i) If A is reflexive with regard to, then A is reflexive. (ii) If C is reflexive with regard to, then (A B ) C = A B C. Let R A H be a relation with card H 3 and let = { i } 4 i=1 be a t-decomposition of the set H. Then we define the relation 1 R A H by f 1 R g R : f( 1 ) = g( 2 ), f( 2 ) = g( 3 ), f( 3 ) = g( 1 ), f( 4 ) = g( 4 ). Further, we put n+1 R = 1 ( n R ) for every n N. n R is called the n-th cyclic transposition of R with regard to. Let R A H be a relation with card H 3 and let = { i } 4 i=1 be a t-decomposition of the set H. Then R is called (i) cyclic (acyclic, anticyclic) with regard to if 1 R R (R 1 R =, f R 1 R f( 1 ) = f( 2 ) = f( 3 )),

4 194 Nitima Chaisansuk, Sorasak Leeratanavalee (ii) strongly symmetric (strongly asymmetric, strongly antisymmetric) with regard to if for any permutation (any odd permutation) φ of the set {1, 2, 3} and any mapping f A H for which there exists a mapping g R such that f( i ) = g( φ(i) ) for i = 1, 2, 3 and f( 4 ) = g( 4 ), we have f R (f R, f R f( 1 ) = f( 2 ) = f( 3 )). 3. Main results In general, if A, B are n-ary relational systems and A has some properties of n-ary relational system with respect to a decomposition, then the power A B need not necessarily preserve such properties - see the following example: Example 3.1. Let A = {a, b} and B = {x, y}. Consider the b-decomposition = {{1, 2}, {3, 4}, } of the index set H = {1, 2, 3, 4}. Assume f i : B A for i = 1, 2, 3 are maps given by f 1 (x) = a, f 1 (y) = a, f 2 (x) = b, f 2 (y) = b and f 3 (x) = a, f 3 (y) = b. Let B i = (B, S i ) and A i = (A, R i ) for i = 1, 2, 3 be 4-ary B relational systems of type H, and A i i = (Hom(B i, A i ), r i ). (i) If R 1 = {(a, a, a, a), (a, b, a, b), (a, b, b, a), (b, a, a, b), (b, a, b, a), (b, b, b, b)}, then A 1 is reflexive with regard to. Let S 1 = {(x, y, y, x)}. Then f i Hom(B 1, A 1 ) for i = 1, 2, 3. It may be easily seen that (f 1, f 3, f 1, f 3 ) E B but it is not an element of r 1, so that A 1 1 is not reflexive with regard to. (ii) If R 2 = {(a, a, a, a), (a, a, a, b), (a, a, b, a), (a, b, a, a), (b, a, a, a), (b, b, b, b)}, then A 2 is symmetric with regard to. Let S 2 = {(x, y, x, x)}. So, f i Hom(B 2, A 2 ) for i = 1, 2, 3. Since (f 3, f 1, f 2, f 3 ) r 2, there exists a mapping (f 2, f 3, f 1, f 3 ) (r 2 ) 1 but (f B 2, f 3, f 1, f 3 ) r 2. Therefore, A 2 2 is not symmetric with regard to. (iii) If R 3 = {(a, a, a, a), (a, a, b, b), (a, b, b, a), (a, a, b, a), (a, a, a, b), (b, b, b, b)}, then A 3 is transitive with regard to. Let S 3 = {(x, x, y, x)}. Thus f i Hom(B 3, A 3 ) for i = 1, 2, 3. Since (f 1, f 2, f 3, f 1 ), (f 3, f 1, f 3, f 2 ) r 3, there exists a mapping (f 1, f 2, f 3, f 2 ) (r 3 ) 2 but it is not a member of the relation r 3. B Hence A 3 3 is not transitive with regard to. We will give the sufficient conditions for A and B which transfer properties with regard to a b-decomposition (t-decomposition) of A to the power of relational systems A B. Lemma 3.2. Let A = (A, R), B = (B, S) be n-ary relational systems of type H with card H = n, n 2 (n 3) and let = { i } 3(4) i=1 be a b-decomposition (t-decomposition) of the set H. Let A B = (Hom(B, A), r), (f 1,..., f n ) (Hom(B, A)) H and x B. Then the following statements hold. (i) If (f 1,..., f n ) E, then (f 1 (x),..., f n (x)) E. (ii) If B is reflexive and (f 1,..., f n ) r 1, then (f 1(x),..., f n (x)) R 1. (iii) If B is reflexive and (f 1,..., f n ) r k, then (f 1(x),..., f n (x)) R k where k N, k 1. (iv) If B is reflexive, φ = (f 1,..., f n ) r and ψ = (g 1,..., g n ) (Hom(B, A)) H such that φ( i ) = ψ( i ), then f x ( i ) = g x ( i ), where

5 Some properties on the powers of n-ary relational systems 195 f x = (f 1 (x),..., f n (x)) and g x = (g 1 (x),..., g n (x)) for i = 1, 2, 3 (for i = 1, 2, 3, 4). Proof. Case 1: is a b-decomposition of the set H. Assume 1 = 2 = l, 3 = m. Let φ, ψ, χ (Hom(B, A)) H and φ = (f 1,..., f n ), ψ = (g 1,..., g n ), χ = (h 1,..., h n ). Suppose f x = (f 1 (x),..., f n (x)), g x = (g 1 (x),..., g n (x)), h x = (h 1 (x),..., h n (x)) for each x B. (i) If φ E, then φ( 1 ) = φ( 2 ). Thus, there exists a permutation α of {1,..., l} such that (3.1) f i = f l+α(i) for each i = 1,..., l. By (3.1), we have f i (x) = f l+α(i) (x) for each x B, so we get f x ( 1 ) = f x ( 2 ). Therefore f x E. (ii) If φ r 1, then there exists a mapping ψ r such that φ( 1) = ψ( 2 ), φ( 2 ) = ψ( 1 ) and φ( 3 ) = ψ( 3 ). So, there exist permutations α and β of {1,..., l} such that (3.2) f i = g l+α(i) and g i = f l+β(i) for each i = 1,..., l, and there exists a permutation γ of {1,..., m} such that (3.3) f 2l+j = g 2l+γ(j) for each j = 1,..., m. Since ψ r and B is reflexive, g x R. By (3.2) and (3.3), we have f x ( 1 ) = g x ( 2 ), f x ( 2 ) = g x ( 1 ) and f x ( 3 ) = g x ( 3 ). Thus f x R 1. (iii) By the definition of A B, the statement holds for k = 1. Suppose the statement holds for k = p, p N, p 1. Let φ r p+1. Then, there exist the mappings ψ r p, χ r such that φ( 1) = ψ( 1 ), φ( 2 ) = χ( 2 ), ψ( 2 ) = χ( 1 ) and φ( 3 ) = ψ( 3 ) = χ( 3 ). Thus, there exist the permutations α, β and γ of {1,..., l} such that (3.4) f i = g α(i), f l+i = h l+β(i) and h i = g l+γ(i) for each i = 1,..., l, and there exist the permutations η, µ of {1,..., m} such that (3.5) f 2l+j = g 2l+η(j) = h 2l+µ(j) for each j = 1,..., m. By the assumption for k = p, B is reflexive and ψ r p, we have g x R p. Since B is reflexive and χ r, h x R. From (3.4) and (3.5), we get f x ( 1 ) = g x ( 1 ), f x ( 2 ) = h x ( 2 ), g x ( 2 ) = h x ( 1 ) and f x ( 3 ) = g x ( 3 ) = h x ( 3 ). This implies that f x R p+1. Hence (f 1(x),..., f n (x)) R k for each x B if (f 1,..., f n ) r k, where k N, k 1. (iv) Let φ r such that φ( i ) = ψ( i ) for i = 1, 2, 3. Then there exist the permutations α and β of {1,..., l} such that (3.6) f i = g α(i) and f l+i = g l+β(i) for each i = 1,..., l, and there exists a permutation γ of {1,..., m} such that (3.7) f 2l+j = g 2l+γ(j) for each j = 1,..., m.

6 196 Nitima Chaisansuk, Sorasak Leeratanavalee From (3.6) and (3.7), we get f x ( i ) = g x ( i ) for i = 1, 2, 3. Case 2: is a t-decomposition of the set H. We can prove the statements by using the same argument as in Case 1. Theorem 3.3. Let A = (A, R), B = (B, S) be n-ary relational systems of type H with card H = n, n 2 (n 3) and let = { i } 3(4) i=1 be a b-decomposition (t-decomposition) of H. Then the following statements hold. (i) If A is both diagonal and reflexive with regard to, then A B is reflexive with regard to. (ii) If B is reflexive and A is areflexive with regard to, then A B is areflexive with regard to. Proof. Suppose A B = (Hom(B, A), r) and φ = (f 1,..., f n ) Hom(B, A) H. (i) Let φ E and (x 1,..., x n ) S. By Lemma 3.2(i), we have (f 1 (x i ),..., f n (x i )) E for each i = 1,..., n. Since A is reflexive with regard to, we have also (3.8) (f 1 (x i ),..., f n (x i )) R for each i = 1,..., n. As f i is a homomorphism, we have (3.9) (f i (x 1 ),..., f i (x n )) R for each i = 1,..., n. From (3.8), (3.9) and the diagonality of A, we get (f 1 (x 1 ),..., f n (x n )) R, and so φ r. Hence A B is reflexive with regard to. (ii) Assume φ r E. By Lemma 3.2(i) and the reflexivity of B, we get (f 1 (x),..., f n (x)) R E for each x B, which contradicts to the assumption that A is areflexive with regard to. Hence A B is areflexive with regard to. Theorem 3.4. Let A = (A, R), B = (B, S) be n-ary relational systems of type H with card H = n, n 2 (n 3) and let = { i } 3(4) i=1 be a b-decomposition (t-decomposition) of H. If B is reflexive, then the following statements hold. (i) If A is both diagonal and symmetric (transitive, regular) with regard to, then A B is symmetric (transitive, regular) with regard to. (ii) If A is asymmetric (intransitive) with regard to, then A B is asymmetric (atransitive) with regard to. (iii) If A is antisymmetric with regard to, then A B is antisymmetric with regard to. Proof. Since B is reflexive, A is diagonal and symmetric (transitive, regular) with regard to. By using Lemma 3.2(ii) (Lemma 3.2(iii), 3.2(vi)), we can prove in the same manner as Theorem 3.3(i) that A B is symmetric (transitive, regular) with regard to. The proof of (ii) is similar to that of Theorem

7 Some properties on the powers of n-ary relational systems (ii) by using Lemma 3.2(ii) for asymmetric property (Lemma 3.2(iii) for intransitive property). (iii) Assume 1 = 2 = l, 3 = m ( 1 = 2 = 3 = l, 4 = m). Let φ = (f 1,..., f n ) (Hom(B, A)) H and φ r r 1. Because the reflexivity of B and Theorem 3.2(ii), we have (f 1 (x),..., f n (x)) R R 1 for each x B. Since A is antisymmetric with regard to, (3.10) (f 1 (x),..., f n (x)) E for each x B. We will show that φ E. Suppose φ E. Then φ( 1 ) φ( 2 ), and for any permutation η of {1,..., l} there exists i {1,..., l} such that f i f l+η(i). Therefore, f i (x) f l+η(i) (x) for some x B, which contradicts to (3.10). Thus φ E. Hence A B is antisymmetric with regard to. Lemma 3.5. Let A = (A, R), B = (B, S) be n-ary relational systems of type H with card H = n, n 3 and let = { i } 4 i=1 be a t-decomposition of the set H. Let A B = (Hom(B, A), r). If B is reflexive and (f 1,..., f n ) 1 r, then (f 1 (x),..., f n (x)) 1 R for each x B. Proof. Assume 1 = 2 = 3 = l, 4 = m. Let φ 1 r. Then there exists a mapping ψ r such that φ( 1 ) = ψ( 2 ), φ( 2 ) = ψ( 3 ), φ( 3 ) = ψ( 1 ) and φ( 4 ) = ψ( 4 ). Let φ = (f 1,..., f n ), ψ = (g 1,..., g n ) (Hom(B, A)) H. Then there exist the permutations α, γ and β of {1,..., l} such that (3.11) f i = g l+α(i), f l+i = g 2l+γ(i) and f 2l+i = g β(i) for each i = 1,..., l, and there exists a permutation η of {1,..., m} such that (3.12) f 3l+j = g 3l+η(j) for each j = 1,..., m. Let f x = (f 1 (x),..., f n (x)), g x = (g 1 (x),..., g n (x)) for each x B. Since ψ r and B is reflexive, g x R. By (3.11) and (3.12), we get f x ( 1 ) = g x ( 2 ), f x ( 2 ) = g x ( 3 ), f x ( 3 ) = g x ( 1 ) and f x ( 4 ) = g x ( 4 ). So f x 1 R. Theorem 3.6. Let A = (A, R), B = (B, S) be n-ary relational systems of type H with card H = n, n 3 and let = { i } 4 i=1 be a t-decomposition of the set H. If B is reflexive, then the following statements hold. (i) If A is both diagonal and cyclic with regard to, then A B is cyclic with regard to. (ii) If A is acyclic with regard to, then A B is acyclic with regard to. (iii) If A is anticyclic with regard to, then A B is anticyclic with regard to.

8 198 Nitima Chaisansuk, Sorasak Leeratanavalee Proof. Since B is reflexive, A is diagonal and cyclic with regard to, and by using Lemma 3.5, we can prove, similarly to Theorem 3.3(i), that A B is cyclic with regard to. The proof of (ii) is the same as of Theorem 3.3(ii), by using Lemma 3.5, we conclude (ii). (iii) Assume 1 = 2 = 3 = l, 4 = m. Let φ = (f 1,..., f n ) (Hom(B, A)) H and φ r 1 r. Because the reflexivity of B and Lemma 3.5(i), we have (f 1 (x),..., f n (x)) R 1 R for each x B. Since A is anticyclic with regard to, we get for each x B, there exist the permutations µ x, ν x of {1,..., l} such that (3.13) f i (x) = f l+µx(i)(x) = f 2l+νx(i)(x) for i = 1,..., l. We will show that φ( 1 ) = φ( 2 ) = φ( 3 ). Suppose φ( 1 ) φ( 2 ) or φ( 1 ) φ( 3 ) or φ( 2 ) φ( 3 ). If φ( 1 ) φ( 2 ), then for any permutation λ of {1,..., l} there exists i {1,..., l} such that f i f l+λ(i). Therefore, f i (x) f l+λ(i) (x) for some x B. This contradicts with (3.13). We can prove the cases φ( 1 ) φ( 3 ) and φ( 2 ) φ( 3 ) in the same manner. So φ( 1 ) = φ( 2 ) = φ( 3 ). Hence A B is anticyclic with regard to. Lemma 3.7. Let A = (A, R), B = (B, S) be n-ary relational systems with card H = n, n 3 and let = { i } 4 i=1 be a t-decomposition of the set H. Let A B = (Hom(B, A), r) and α be a permutation of the set {1, 2, 3} and a mapping φ (Hom(B, A)) H for which there exists a mapping ψ r such that φ( i ) = ψ( α(i) ) for i = 1, 2, 3 and φ( 4 ) = ψ( 4 ). If B is reflexive, φ = (f 1,..., f n ) and ψ = (g 1,..., g n ), then f x ( i ) = g x ( α(i) ) for i = 1, 2, 3 and f x ( 4 ) = g x ( 4 ), where f x = (f 1 (x),..., f n (x)) and g x = (g 1 (x),..., g n (x)) for each x B. Proof. Assume 1 = 2 = 3 = l, 4 = m. Let α be a permutation of the set {1, 2, 3} and a mapping φ (Hom(B, A)) H for which there exists a mapping ψ r such that φ( i ) = ψ( α(i) ) for i = 1, 2, 3 and φ( 4 ) = ψ( 4 ). Suppose φ = (f 1,..., f n ) and ψ = (g 1,..., g n ). Then, there exists a permutation β j of {1,..., l} for j = 1, 2, 3 such that (3.14) f (j 1)l+i = g (α(j) 1)l+βj (i) for each i = 1,..., l, and there exists a permutation η of {1,..., m} such that (3.15) f 3l+k = g 3l+η(k) for each k = 1,..., m. Let x B, f x = (f 1 (x),..., f n (x)) and g x = (g 1 (x),..., g n (x)). Since ψ r and B is reflexive, (g 1 (x),..., g n (x)) R. By (3.14) and (3.15), we have f x ( i ) = g x ( α(i) ) for i = 1, 2, 3 and f x ( 4 ) = g x ( 4 ). Theorem 3.8. Let A = (A, R), B = (B, S) be n-ary relational systems with card H = n, n 3 and let = { i } 4 i=1 be a t-decomposition of the set H. If B is reflexive then the following statements hold. (i) If A is both diagonal and strongly symmetric with regard to, then A B is strongly symmetric with regard to.

9 Some properties on the powers of n-ary relational systems 199 (ii) If A is strongly asymmetric with regard to, then A B is strongly asymmetric with regard to. (iii) If A is strongly antisymmetric with regard to, then A B antisymmetric with regard to. is strongly Proof. Since B is reflexive, A is diagonal and strongly symmetric with regard to by using Lemma 3.7. Similarly to Theorem 3.3(i) we can prove that A B is strongly symmetric with regard to. (ii) Assume 1 = 2 = 3 = l, 4 = m and A B = (Hom(B, A), r). Let α be an odd permutation of the set {1, 2, 3} and a mapping φ (Hom(B, A)) H for which there exists a mapping ψ r such that φ( i ) = ψ( α(i) ) for i = 1, 2, 3 and φ( 4 ) = ψ( 4 ). Let φ = (f 1,..., f n ) and ψ = (g 1,..., g n ). We will show that φ r. Suppose φ r and f y = (f 1 (y),..., f n (y)), g y = (g 1 (y),..., g n (y)) for each y R. Since B is reflexive and ψ r, g y R. From Lemma 3.7, we have f y ( i ) = g y ( α(i) ) for i = 1, 2, 3 and f y ( 4 ) = g y ( 4 ). As φ r and B is reflexive, f y R. This is a contradiction because A is strongly asymmetric with regard to. Hence A B is strongly asymmetric with regard to. We can prove similarly to Theorem 3.6(iii) because B is reflexive, A is strongly antisymmetric with regard to by using Lemma 3.7, we can get A B is strongly antisymmetric with regard to. References [1] Birkhoff, G., Generalized arithmetic. Duke Math. J. 9 (1942), [2] Chaisansuk, N., Leeratanavalee, S., On powers of relational and algebraic systems. Acta Math. Hungar. 139 (3)(2013), [3] Chajda, J., Homomorphisms of directed posets. Asian-Eur. J. Math. 1 (2008), [4] Chajda, J., Länger, H., Groupoids assigned to relational system. Math Bohem. 138 (1) (2013), [5] Chajda, J., Länger, H.,Quotient and homomorphism of relational systems. Acta Univ. Palack. Olom. Math. 49 (2010), [6] Novotný, M., Šlapal, J., On Powers of Relational Structures, Publ. Math. Debrecen 61 (3-4)(2002), [7] Šlapal, J., Direct arithmetic of relational systems. Publ. Math. Debrecen 38 (1991), [8] Šlapal, J., On Relations. Czech. Math. J. 39 (114)(1989), [9] Šlapal, J., On the direct power of relational systems. Math. Slovaca. 39 (1989), Received by the editors June 4, 2013