ON ENDOMORPHISM MONOIDS OF PARTIAL ORDERS AND CENTRAL RELATIONS 1
|
|
- Carmella Tucker
- 5 years ago
- Views:
Transcription
1 Novi Sad J. Math. Vol. 38, No. 1, 2008, ON ENDOMORPHISM MONOIDS OF PRTIL ORDERS ND CENTRL RELTIONS 1 Dragan Mašulović 2 bstract. In this paper we characterize pairs of Rosenberg s (ρ, σ) with the property that the endomorphism monoid of one of the s is properly contained in the endomorphism monoid of the other. We focus on the situations where one of the s is a partial order, or a central. MS Mathematics Subject Classification (2000): 0835, 0606 Key words and phrases: maximal clones, endomorphism monoids, Rosenberg s, partial orders, central s 1. Introduction In this paper we continue the work from [4, 5, 6, 7] on the description of all pairs (ρ, σ) of Rosenberg s satisfying End{ρ} End{σ}. Here, we focus on the situations where one of the s is a partial order, or a central. Results presented here, together with the results of [4, 5, 6, 7] cover all but two cases (see Table 1), bringing us, therefore, closer to the complete characterization. This line of research was motivated by the paper [1], where the completeness for some special structures (concrete near-rings) was investigated using techniques from clone theory. It appeared that unary parts (traces) of the maximal clones that contain the operation correspond to the maximal near-rings containing the identity map. Moreover, if for every two distinct unary parts M (1) i and M (1) j of such maximal clones we have M (1) i M (1) j, then every unary part is a maximal near ring. It is natural to ask what goes on in the general case, i.e. what the ship between any two traces of maximal clones on a finite set is. s it was expected, the width of this poset is doubly exponential, but it was rather surprising to find out that its height is equal to the size of the underlying set. Moreover, it turns out that the structure of this poset is quite rich. 2. Preliminaries O (n) Throughout the paper we assume that is a finite set and 3. Let denote the set of all n-ary operations on (so that O(1) = ) and let 1 Supported by the Grant Lattice methods and applications No /2007 of the Secretariat for Science and Technological Development of the utonomous Province Vojvodina 2 Department of Mathematics and Informatics, University of Novi Sad, Serbia, Trg Dositeja Obradovića 4, Novi Sad, masul@im.ns.ac.yu
2 112 D. Mašulović O = n 1 O(n) denote the set of all finitary operations on. For F O let F (n) = F O (n) be the set of all n-ary operations in F. set C O of finitary operations is a clone of operations on if it contains all projection maps πi n : n : (x 1,..., x n ) x i and is closed with respect to composition of functions in the following sense: whenever g C (n) and f 1,..., f n C (m) for some positive integers m and n then g(f 1,..., f n ) C (m), where the composition h = g(f 1,..., f n ) is defined by h(x 1,..., x m ) = g(f 1 (x 1,..., x m ),..., f n (x 1,..., x m )). For a clone C, the unary part C (1) of C, will be referred to as the trace of C. Let R (n) denote the set of all n-ary s on (including the empty ) and let R = n 1 R(n) ρ is a nonempty in R (n) denote the set of all finitary s on. If we say that its arity is n and write ar(ρ) = n. The arity of the empty is undefined. We say that an n-ary operation f preserves an h-ary ρ if the following holds: a 11 a 21 a h1 a 12 a 22 a h2 a 1n a 2n..,..,...,.. ρ implies a hn For a set Q of s and for a set F of operations let f(a 11, a 12,..., a 1n ) f(a 21, a 22,..., a 2n ).. ρ. f(a h1, a h2,..., a hn ) Pol Q = {f O : f preserves every ρ Q} Inv F = {ρ R : every f F preserves ρ}. Let Pol (n) Q = (Pol Q) O (n). For an h-ary θ h and a unary operation f it is convenient to write f(θ) = {(f(x 1 ),..., f(x h )) : (x 1,..., x h ) θ}. Then clearly f preserves θ if and only if f(θ) θ. It follows that Pol (1) Q is the endomorphism monoid of the al structure (, Q). Therefore instead of Pol (1) Q we simply write End Q. We shall omit the subscript in Pol Q, End Q and Inv F and write simply Pol Q, End Q and Inv F. If, however, F O B and Q R B for some B we shall keep the subscript and write Pol B Q, End B Q and Inv B F to indicate that we restrict our attention to operations and s on B. For a ρ of arity k, let ρ irr denote the irreflexive part of ρ, that is, the set of all (x 1,..., x k ) ρ such that x i x j for all i j. ρ is irreflexive if ρ = ρ irr. Let B. We say that f O (1) ρ R (k) irreflexively preserves an irreflexive B if whenever (b 1,..., b k ) ρ and (f(b 1 ),..., f(b k )) (B k ) irr then (f(b 1 ),..., f(b k )) ρ. We say that an irreflexive ρ is an irreflexive
3 On endomorphism monoids of partial orders and central s 113 invariant of F O (1) on B if every operation in F irreflexively preserves ρ. The set of all irreflexive invariants of F on B will be denoted by Irr B F. If the underlying set is finite and has at least three elements, then the lattice of clones has cardinality 2 ℵ 0. However, one can show that the lattice of clones on a finite set has a finite number of coatoms, called maximal clones, and that every clone distinct from O is contained in one of the maximal clones. One of the most influential results in clone theory is the explicite characterization of the maximal clones, obtained by I. G. Rosenberg as the culmination of the work of many mathematicians. It is usually stated in terms of the following six classes of finitary s on (the so-called Rosenberg s). (R1) Bounded partial orders. These are partial orders on with a least and a greatest element. (R2) Nontrivial equivalence s. These are equivalence s on distinct from := {(x, x) : x } and 2. (R3) Permutational s. These are s of the form {(x, π(x)) : x }, where π is a fixpoint-free permutation of with all cycles of the same length p, where p is a prime. (R4) ffine s. For a binary operation on let λ := {(x, y, u, v) 4 : u v = x y}. ρ is called affine if there is an elementary abelian p-group (,,, 0) on such that ρ = λ. Suppose now that is an elementary abelian p-group. Then it is wellknown that f Pol{λ } if and only if f(x 1 y 1,..., x n y n ) = f(x 1,..., x n ) f(y 1,..., y n ) f(0,..., 0) for all x i, y i. In case f is unary, this condition becomes f(x y) = f(x) f(y) f(0). (R5) Central s. ll unary s are central s. For central s ρ of arity h 2 the definition is as follows: ρ is said to be totally symmetric if (x 1,..., x h ) ρ implies (x π(1),..., x π(h) ) ρ for all permutations π, and it is said to be totally reflexive if (x 1,..., x h ) ρ whenever there are i j such that x i = x j. n element c is central if (c, x 2,..., x h ) ρ for all x 2,..., x h. Finally, ρ h is called central if it is totally reflexive, totally symmetric and has a central element. (R6) h-regular s. Let Θ = {θ 1,..., θ m } be a family of equivalence s on. We say that Θ is an h-regular family if every θ i has precisely h blocks, and additionally, if B i is an arbitrary block of θ i for i {1,..., m}, then m i=1 B i.
4 114 D. Mašulović n h-ary ρ h is h-regular if h 3 and there is an h-regular family Θ such that (x 1,..., x h ) ρ if and only if for all θ Θ there are distinct i, j with x i θx j. Note that regular s are totally reflexive and totally symmetric. Theorem 2.1. (Rosenberg [8]) clone M of operations on a finite set is maximal if and only if there is a ρ from one of the classes (R1) (R6) such that M = Pol{ρ}. Every central ρ can be written as C ρ R ρ T ρ, where C ρ is the central part of ρ which consists of all the tuples of distinct elements containing at least one central element, R ρ is the reflexive part of ρ which consists of all the tuples (x 1,..., x k ) such that there are i j with x i = x j, and T ρ is the tail of ρ and consists of all the tuples (x 1,..., x k ) such that x 1,..., x k are distinct non-central elements. The center of ρ will be denoted by Z(ρ). This is the set of all central elements of ρ. For a ρ by dom(ρ) we denote the domain of ρ, that is, the set D such that ρ D ar(ρ). For most s in this paper the domain is obvious. However, for the tail T ρ of a central ρ we set dom(t ρ ) = \ Z(ρ). There is another way to look at regular s. Given a finite set, 3, and an h-regular family Θ = {θ 1,..., θ m } on, let R Θ = {(x 1,..., x h ) : ( θ Θ)( i j)x i θx j } denote the corresponding h-regular. We define the elementary (h, m)- Ψ h,m on {1,..., h} m in the following way: Ψ h,m = {( a 1 1.,..., a 1 m a h 1. a h m ) : ( i {1,..., m})( j k)a j i = ak i Note that the elementary (h, m)- is the h-regular on {1,..., h} m defined by the h-regular family Θ = {θ1,..., θm}, where {( b 1 b θi = ) },. 1. : b 1 i = b 2 i. b 1 m b 2 m Then, there exists a surjective mapping λ : {1,..., h} m such that R Θ = {(x 1,..., x h ) : (λ(x 1 ),..., λ(x h )) Ψ h,m }. Conversely, for every surjective mapping λ : {1,..., h} m the is an h-regular. {(x 1,..., x h ) : (λ(x 1 ),..., λ(x h )) Ψ h,m } }.
5 On endomorphism monoids of partial orders and central s 115 The complete characterization of all mappings that preserve regular s can be found in [3]. We present this result without proof. Denote by x (i) the i-th coordinate of the tuple x {1,..., h} m. Let f be an n-ary function on the set. We define the function f i : n {1,..., h} in the following way: f i (x 1,..., x n ) := λ i (f(x 1,..., x n )), where λ i (x) = λ(x) (i) = π i λ(x). Proposition 2.2. ([3]) n n-ary function f on a set preserves an h-regular R Θ if and only if for each i either f i has at most h1 distinct values or there exist a permutation s on {1,..., h}, a j {1,..., n} and a v {1,..., m} such that f i (x 1,..., x n ) = s(λ v (x j )). The results we have obtained up to now, including the results obtained in this paper, are summarized in Table 1. The entries in this table are to be interpreted in the following way: we write if End ρ End σ for every pair (ρ, σ) of s of the indicated type; we write if there is a complete characterization of the situation End ρ End σ; we write? if there is no definite answer, but the reference below the question mark contains some partial results. 3. Bounded partial orders Let (, ) be a partially ordered set. Recall that S is a retract of if there is an idempotent monotonous map f : such that f() = S. We shall say that S is a pseudoretract of if there is a (not necessarily idempotent) monotonous map f : such that f() = S. Thus, pseudoretracts of are nothing but substructures of that are at the same time homomorphic images of. If ρ S k and θ k are arbitrary s, we say that (S, ρ) is a pseudoretract of (, θ) if there is a monotonous map f : such that f() = S and f(θ) = ρ. We start with the characterization of the ship between bounded partial orders and regular s. In we obtained the following partial result: Proposition 3.1. ( Proposition 4.25) Let be a bounded partial order. If R Θ is an h-regular defined by Θ = {θ 1,..., θ m } where m 2, then End( ) End R Θ. Therefore, if End( ) End R Θ then Θ = {θ}. We shall now complete the characterization. Let θ be an equivalence on and let S be a subset of. We write S/θ to denote S/(θ S 2 ), the set of equivalence classes of the restriction of θ to S.
6 116 D. Mašulović ρ σ Bounded partial order Equivalence Permutational ffine Unary central k ary central, k 2 h regular Bounded partial order Prop. 3.4 Prop. 3.2 Equivalence [4] Permutational ffine Unary central k ary central, k 2 Prop. 4.6 Prop h regular?? [4] Table 1: Summary of some partial results for End ρ End σ
7 On endomorphism monoids of partial orders and central s 117 Proposition 3.2. Let (, ) be a partially ordered set, let Θ be an h-regular family, h 3, and R Θ the regular generated by the regular family Θ. Then End( ) End R Θ if and only if Θ = {θ} and for every pseudoretract S of, if S/θ = h and (S, ρ) is a pseudoretract of (, θ) then ρ = θ S. Proof. ( ) Let End( ) End R Θ. Then by Proposition 3.1 we have Θ = {θ} for some equivalence θ. Let (S, ρ) be a pseudoretract of (, θ) and let S/θ = h. Then there is a monotonous map f : such that f() = S and f(θ) = ρ. Let B 1,..., B h be the blocks of θ. Since f End( ) End R Θ and f()/θ = S/θ = h it follows from Proposition 2.2 that there exists a permutation α : {1,..., h} {1,..., h} such that f(b i ) B α(i) for all i. So, f End θ and hence ρ = f(θ) θ S. Let us show that f(θ) = θ S. Take any (u, v) θ S. Then u, v B α(j) for some j. Since f(b i ) B α(i) for all i, from u, v S = f() it follows that there exist p, q B j such that (f(p), f(q)) = (u, v). Therefore, ρ = f(θ) = θ S. ( ) ssume that Θ = {θ} and that for every pseudoretract S of, if S/θ = h and (S, ρ) is a pseudoretract of (, θ) then ρ = θ S. Take any f End( ). If f()/θ < h then f obviously preserves R Θ, so assume that f()/θ = h. Let S = f() and ρ = f(θ). Then (S, ρ) is a pseudoretract of (, θ) whence ρ = θ S. So, f preserves θ and consequently f End R Θ since Θ = {θ}. s for the ship between endomorphism monoids of bounded parital orders and central s, in and we obtained the following: Proposition 3.3. (Proposition 4.10, Proposition 4.19 ) Let (, ) be a partially ordered set. If ρ is a unary central then End( ) End ρ. If ρ is a binary central then End( ) End ρ if and only if is not a chain and ρ = ( ) ( ) 1. We shall now consider central s of arity h 3. For = D let Cen h (D) = {(x 1,..., x h ) ( h ) irr : there exists an i such that x i D}. Proposition 3.4. Let be a bounded partial order and σ a central of arity h 3. Then End( ) End σ if and only if T σ Irr \Z(σ) End( ), and for every pseudoretract S of, if S \ Z(σ) h and (S, D) is a pseudoretract of (, Z(σ)) then Cen h S\Z(σ)(D) T σ. Proof. ( ) Let B = \Z(σ). Suppose that T σ / Irr B End( ). Then there exist f End( ) and (b 1,..., b h ) T σ such that (f(b 1 ),..., f(b h )) (B h ) irr but (f(b 1 ),..., f(b h )) / T σ. Let us show that in this case f does not preserve σ. It is obvious that (b 1,..., b h ) T σ σ. On the other hand, (f(b 1 ),..., f(b h )) / σ since the tuple consists of distinct noncentral elements but it does not belong to T σ. Therefore, f End( ) \ End σ.
8 118 D. Mašulović Suppose now that there is a pseudoretract (S, D) of (, Z(σ)) such that S \ Z(σ) h but Cen h S\Z(σ)(D) T σ. Let f be a monotonous map such that f() = S and f(z(σ)) = D, and take any (b 1,..., b h ) Cen h S\Z(σ)(D) \ T σ. Note that (b 1,..., b h ) / σ since the tuple consists of distinct noncentral elements but it does not belong to T σ. lso, there is an i such that b i D, say b 1 D. Since f() = S and f(z(σ)) = D there exist c Z(σ) and a 2,..., a h such that f(c) = b 1 and f(a i ) = b i for all i 2. Now, (c, a 2,..., a h ) σ but (f(c), f(a 2 ),..., f(a h )) = (b 1, b 2,..., b h ) / σ, so f End( ) \ End σ. ( ) Suppose that End( ) End σ and take any f End( ) \ End σ. Then there is a (a 1,..., a h ) σ such that (b 1,..., b h ) / σ, where b i = f(a i ) for all i. Therefore, all the b i s are distinct noncentral elements and consequently all the a i s are distinct. If (a 1,..., a h ) T σ then T σ / Irr \Z(σ) End( ) since f End( ), all the b i s are distinct noncentral elements but (b 1,..., b h ) / T σ. ssume now that (a 1,..., a h ) C σ. Let S = f() and D = f(z(σ)). Then clearly (S, D) is a pseudoretract of (, Z(σ)), but (b 1,..., b h ) Cen h S\Z(σ)(D) \ T σ. If σ is a central with T σ = we have the following simpler version of the above result: Proposition 3.5. Let σ be a central of arity h 3 such that T σ =. Then End( ) End σ if and only if for every pseudoretract S of, if S \ Z(σ) h and (S, D) is a pseudoretract of (, Z(σ)) then D Z(σ). Proof. ( ) Let End( ) End σ, let S be a pseudoretract of such that S \ Z(σ) h and let (S, D) be a pseudoretract of (, Z(σ)). Then there is a monotonous map f such that f() = S and f(z(σ)) = D. Since f End( ) End σ and f() \ Z(σ) h it follows that f(z(σ)) Z(σ). Therefore, D Z(σ). ( ) Take any f End( ), let S = f() and D = f(z(σ)). Then (S, D) is a pseudoretract of (, Z(σ)). If f() \ Z(σ) < h then it is easy to see that f preserves σ. If, however, f() \ Z(σ) h then according to the assumption D Z(σ) since (S, D) is a pseudoretract of (, Z(σ)). Therefore, f(z(σ)) Z(σ) and consequently f preserves σ. 4. Central s In we solved the following special case of the problem of comparing endomorphism monoids of central s: Proposition 4.1. Let ρ and σ be distinct central s. (a) If σ is a unary central then End ρ End σ [7, Lemma 3.2]. (b) Suppose that ar(σ) 2 and T ρ =. Then End ρ End σ if and only if ar(ρ) < ar(σ), Z(ρ) = Z(σ) and T σ = [7, Proposition 4.1].
9 On endomorphism monoids of partial orders and central s 119 This proposition handles the cases where at least one of the central s is unary, or T ρ =. In this section we consider the remaining case where ar(ρ) 2, ar(σ) 2 and T ρ. The main problem in the analysis of central s comes from the fact that the tail of a central can be arbitrary (actually, any totally symmetric irreflexive ). Hence, if ρ and σ are central s and End ρ End σ then T σ should be a sort of an invariant of T ρ, but this does not mean that T σ Inv End T ρ. The paper [6] raises an intriguing point in the analysis of the structure of endomorphism monoids of central s. We are now going to make the approach of [6] explicite and describe the tools in a fashion of Fraïssé-type analysis of first-order structures that will enable us to precisely formulate the feeling that T σ is a sort of an invariant of T ρ. Let ρ be a k-ary and let h > k. We write (a 1,..., a h ) ρ (b 1,..., b h ) to denote that all a 1,..., a h are distinct, all b 1,..., b h are distinct, {a 1,..., a h, b 1,..., b h } dom(ρ), and whenever i 1,..., i k {1,..., h} are k distinct indices such that (a i1,..., a ik ) ρ, then (b i1,..., b ik ) ρ. We say that σ is a Fraïssé filter over ρ if ar(σ) > ar(ρ), and if (a 1,..., a h ) σ and (a 1,..., a h ) (b 1,..., b h ) σ. ρ (b 1,..., b h ) dom(σ) h then Recall that a structure is homogeneous if every isomorphism between two finite substructures extends to an automorphism of the structure. Recently, P. Cameron and J. Nešetřil introduced a notion of homomorphism-homogeneity of structures as a straightforward generalization of homogeneity [2]. Let (, ρ) be a al structure. local homomorphism of (, ρ) is a homomorphism f : (S, ρ S ) (T, ρ T ), where S, T. We say that the structure (, ρ) is homomorphism-homogeneous if every local homorphism extends to an endomorphism, that is, if for every homorphism f : (S, ρ S ) (T, ρ T ), where S, T, there is an endomorphism g End(, ρ) such that f = g S. We say that a ρ is homomorphism-homogeneous if (, ρ) is homomorphism-homogeneous. Lemma 4.2. Let ρ be a homomorphism-homogeneous of arity k 2 and let σ be a totally reflexive of arity h > k with dom(ρ) = dom(σ). The following are equivalent (1) End ρ End σ, (2) σ is a Fraïssé filter over ρ, (3) σ irr Irr End ρ. Proof. (1) (2): Suppose End ρ End σ. Take any (a 1,..., a h ) σ and ρ suppose (a 1,..., a h ) (b 1,..., b h ). Let S = {a 1,..., a h }, T = {b 1,..., b h } and f : S T : a i b i. Then f is a local homomorphism of (, ρ), and by
10 120 D. Mašulović homomorphism-homogeneity of ρ it extends to an endomorphism g End ρ. So, g End σ, and consequently (g(a 1 ),..., g(a h )) σ. But g(a i ) = f(a i ) = b i, for all i. Therefore, (b 1,..., b h ) σ. (2) (3): Let σ be a Fraïssé filter over ρ and let us show that every g End ρ irreflexively preserves σ irr. Take any g End ρ and any (a 1,..., a h ) σ irr such that the g(a i ) s are all distinct. Since g End ρ it follows that ρ (g(a 1 ),..., g(a h )), whence (g(a 1 ),..., g(a h )) σ irr since σ is (a 1,..., a h ) a Fraïssé filter over ρ. (3) (1): ssume that σ irr Irr End ρ, take any g End ρ and let us show that g End σ. Take any (a 1,..., a h ) σ and let b i = g(a i ). If there are i j such that b i = b j then (b 1,..., b h ) σ since σ is totally reflexive. Otherwise, all the b i s are distinct. Since σ irr Irr End ρ and g End ρ we obtain (b 1,..., b h ) σ irr σ. Therefore, g End σ. Lemma 4.3. Every central is homomorphism-homogeneous. Proof. Let ρ be a central and f : (S, ρ S ) (T, ρ T ), where S, T, a local homomorphism of (, ρ). Choose an arbitrary central element c of ρ and define an extension g : of f by { f(x), x S, g(x) = c, otherwise. Then it is easy to see that g preserves ρ. Take any (a 1,..., a k ) ρ. If f(a i ) = f(a j ) for some i j then trivially (f(a 1 ),..., f(a k )) ρ. If all the f(a i ) s are distinct, then all the a i s are also distinct. If there is a j such that a j / S, then f(a j ) = c and (f(a 1 ),..., f(a k )) ρ. Finally, if {a 1,..., a k } S then from the fact that f is a local homomorphism of (, ρ) it follows that (f(a 1 ),..., f(a k )) ρ. Corollary 4.4. Let ρ be a central of arity k 2 and let σ be a totally reflexive of arity h. Then End ρ End σ if and only if h > k and σ is a Fraïssé filter over ρ. Proof. In view of the previous two lemmas it suffices to show that h > k. But from [4, Proposition 5.3] we know that if ρ and σ are totally reflexive and totally symmetric distinct s such that σ contains at least one tuple (b 1,..., b h ) of distinct elements and σ h, where h = ar(σ), then End ρ End σ implies ar(ρ) < ar(σ). lthough rather general, the above statement can be used to derive certain information about central s. Corollary 4.5. Let ρ and σ be central s, k = ar(ρ) 2, h = ar(σ) 2. If End ρ End σ then h > k and Z(ρ) Z(σ).
11 On endomorphism monoids of partial orders and central s 121 Proof. We already know that End ρ End σ implies h > k, [4, Proposition 5.3]. Take any c Z(ρ) and a 2,..., a h. If {c, a 2,..., a h } < h then (c, a 2,..., a h ) σ since σ is totally reflexive. If {a 2,..., a h } Z(ρ) then (c, a 2,..., a h ) σ since the tuple contains a central element of σ. So, assume that {c, a 2,..., a h } = h and {a 2,..., a h } Z(ρ) =. Take any d Z(σ). Then all d, a 2,..., a h are distinct and (d, a 2,..., a h ) σ. Moreover, (d, a 2,..., a h ) ρ (c, a 2,..., a h ) since c is a central element of ρ. Now, from End ρ End σ we get by Corollary 4.4 that σ is a Fraïssé filter over ρ. This together with (d, a 2,..., a h ) σ and (d, a 2,..., a h ) ρ (c, a 2,..., a h ) yields (c, a 2,..., a h ) σ. Let θ be a k-ary and let h > k. We say that d dom(θ) is an h-central element for θ if there exists a B dom(θ) such that B = h 1, d / B and {d} (B k1 ) irr θ. We also say that B is a set of witnesses for d. Proposition 4.6. Let ρ and σ be central s, k = ar(ρ) 2, h = ar(σ) 2, and T ρ. Then End ρ End σ if and only if Z(ρ) Z(σ), h > k, if d dom(t σ ) is an h-central element of T ρ witnessed by {b 2,..., b h } dom(t σ ) then (d, b 2,..., b h ) T σ, and (C σ T σ ) dom(tρ ) is a Fraïssé filter over T ρ. Proof. ( ) Suppose End ρ End σ. Then Z(ρ) Z(σ) and h > k according to Corollary 4.5. Let d dom(t σ ) be an h-central element of T ρ witnessed by {b 2,..., b h } dom(t σ ). Take any c Z(ρ) Z(σ) and consider d, x = c f(x) = x, x {b 2,..., b h } c, otherwise. Then f End ρ. Therefore, f End σ which together with (c, b 2,..., b h ) σ yields (d, b 2,..., b h ) σ. Since d, b 2,..., b h are distinct noncentral elements, we obtain (d, b 2,..., b h ) T σ. Take any (a 1,..., a h ) (C σ T σ ) dom(tρ ) and let (a 1,..., a h ) T ρ (b 1,..., b h ). Take any c Z(ρ) Z(σ) and consider { b i, x = a i, i {1,..., h} f(x) = c, otherwise. Then f End ρ. Therefore, f End σ which together with (a 1,..., a h ) σ yields (b 1,..., b h ) σ. But {b 1,..., b h } dom(t ρ ) so (b 1,..., b h ) (C σ T σ ) dom(tρ).
12 122 D. Mašulović ( ) Suppose End ρ End σ and let h > k and Z(ρ) Z(σ). Take any f End ρ \ End σ and a tuple (a 1,..., a h ) σ such that (f(a 1 ),..., f(a h )) / σ. Let b i = f(a i ), i = 1,..., h. Then {b 1,..., b h } Z(σ) =, all the b i s are distinct and consequently all the a i s are distinct. If there is an i such that a i Z(ρ), then from f End ρ it follows that b i is an h-central element of T ρ witnessed by {b 1,..., b h } \ {b i }. Since {b 1,..., b h } \ Z(σ) we get a contradiction with the third requirement. If {a 1,..., a h } Z(ρ) =, then from f End ρ it follows that (a 1,..., a h ) T ρ (b 1,..., b h ). Since (a 1,..., a h ) belongs to (C σ T σ ) dom(tρ ) and (b 1,..., b h ) does not, we have that (C σ T σ ) dom(tρ) is not a Fraïssé filter over T ρ which contradicts the fourth requirement. Corollary 4.7. Let ρ and σ be central s, k = ar(ρ) 2, h = ar(σ) 2, and T ρ. dditionally, assume Z(ρ) = Z(σ) and let B = dom(t ρ ) = dom(t σ ) = \ Z(ρ). Then End ρ End σ if and only if h > k, if d B is an h-central element of T ρ witnessed by {b 2,..., b h } B then (d, b 2,..., b h ) T σ, and T σ is a Fraïssé filter over T ρ. In case T σ = and Z(ρ) = Z(σ) we obtain an even simpler characterization: Proposition 4.8. Let ρ and σ be central s, k = ar(ρ) 2, h = ar(σ) 2, and let T σ = and Z(ρ) = Z(σ). Then End ρ End σ if and only if h > k and T ρ has no h-central elements. Proof. ( ) ssume that End ρ End σ and let h > k. Take any f End ρ \ End σ and a tuple (a 1,..., a h ) σ such that (f(a 1 ),..., f(a h )) / σ. Let b i = f(a i ), i = 1,..., h. Then {b 1,..., b h } Z(σ) =, all the b i s are distinct and consequently all the a i s are distinct. Since T σ =, from the fact that all the a i s are distinct it follows that at least one of the a i s is in Z(σ), say, a 1 Z(σ). But then from f End ρ it follows that b 1 is an h-central element of T ρ witnessed by {b 2,..., b h } ( ) Suppose that h > k and that T ρ has an h-central element d witnessed by {b 2,..., b h }. Then {d, b 2,..., b h } \ Z(σ) whence follows that (d, b 2,..., b h ) / σ since T σ =. Take any c Z(σ) and consider d, x = c f(x) = x, x {b 2,..., b h } c, otherwise. Then f End ρ since d is an h-central element of T ρ witnessed by {b 2,..., b h }, and f / End σ since (c, b 2,..., b h ) belongs to σ and (d, b 2,..., b h ) does not. We shall say that a central ρ is End-maximal if End ρ End σ for every central σ ρ.
13 On endomorphism monoids of partial orders and central s 123 Proposition 4.9. central ρ on is End-maximal if and only if = ar(ρ) Z(ρ). Proof. ( ) Let ρ be a central which is not End-maximal. Then there is a central σ such that End ρ End σ. This further implies ar(ρ) < ar(σ) and Z(ρ) Z(σ). Since σ has at least ar(σ) noncentral elements, we have that ar(σ) Z(σ), so ar(ρ) Z(ρ) < ar(σ) Z(σ). ( ) Let ρ be a central of arity k such that k Z(ρ) < and let ρ = R ρ C ρ T ρ be the decomposition of ρ into its reflexive part, central part and the tail. Let h = Z(ρ) and define R h, C h and T h as follows: R h = {(x 1,..., x h ) h : x i = x j for some i j}, C h = {(x 1,..., x h ) ( h ) irr : x i Z(ρ) for some i}, T h = {(x 1,..., x h ) ( h ) irr : there is an i such that (x i, x j2,..., x jk ) T ρ whenever j 2,..., j k {1,..., h} \ {i} are k 1 distinct indices}. Let us show that σ = C h R h T h is a central such that End ρ End σ. The σ is clearly totally reflexive and totally symmetric, and has at least all of Z(ρ) as its central elements. To show that σ is a central, we have to show that σ h. Let \Z(ρ) = {b 1,..., b h }. Since each b i is a noncentral element, for every i there exist d 2,..., d k such that (b i, d 2,..., d k ) / ρ. But then {d 2,..., d k } \ Z(ρ), so d 2 = b j2,..., d k = b jk for some k 1 distinct indices j 2,..., j k {1,..., h} \ {i}. Thus, for every i there exist k 1 indices j 2,..., j k {1,..., h} \ {i} such that (b i, b j2,..., b jk ) / T ρ. Therefore, (b 1,..., b h ) / T h and hence (b 1,..., b h ) / σ. Clearly, ar(σ) > ar(ρ) and Z(σ) = Z(ρ). Let us show that End ρ End σ. Take any f End ρ, (a 1,..., a h ) σ and let d i = f(a i ), i {1,..., h}. If there is an i such that d i Z(σ) or there are i j such that d i = d j, then (d 1,..., d h ) σ. So, assume now that d 1,..., d h are distinct noncentral elements. Then the a i s are also all distinct. If there is an i such that a i Z(ρ) then for every k 1 distinct indices j 2,..., j k {1,..., h} \ {i} we have (a i, a j2,..., a jk ) ρ. Since f End ρ, we get (d i, d j2,..., d jk ) ρ. Moreover, (d i, d j2,..., d jk ) T ρ since the d i s are distinct noncentral elements. Therefore, (d 1,..., d h ) T h σ. If the a i s are distinct noncentral elements, then (a 1,..., a h ) T h whence follows that there is an i such that (a i, a j2,..., a jk ) T ρ whenever j 2,..., j k {1,..., h} \ {i} are k 1 distinct indices. Since f End ρ, we get (d i, d j2,..., d jk ) ρ. Moreover, (d i, d j2,..., d jk ) T ρ since the d i s are distinct noncentral elements. Therefore, (d 1,..., d h ) T h σ. There exist pairs (ρ, R Θ ) such that ρ is a central of arity k 2, R Θ is an h-regular and End ρ End R Θ. First of all, if Θ = { } where = {(x, x) : x } then End R Θ = and clearly End ρ End R Θ. In case Θ { }, we have shown in [7, Propositions 4.6 and 4.7] that End ρ End R Θ
14 124 D. Mašulović implies k < h, Θ = {θ}, θ has a single nontrivial block B and Z(ρ) B. Moreover, if T ρ =, we were able to provide a complete characterization [7, Proposition 4.8]: if T ρ = and Θ { } then End ρ End R Θ if and only if k < h, Θ = {θ}, θ has a single nontrivial block B and Z(ρ) = B. Here we shall deal with the remaining case of T ρ and thus finish the characterization. Proposition Let ρ be a central of arity k 2 such that T ρ and let R Θ be an h-regular, where Θ { }. Then End ρ End R Θ if and only if: (1) k < h; (2) Θ = {θ}, where /θ = { B, {b 2 },..., {b h } } and B 2, i.e. B is a single nontrivial block of θ; (3) Z(ρ) B; (4) if b i is an (h 1)-central element of T ρ for some i {2,..., h}, then {b 2,..., b h } \ {b i } cannot be a set of witnesses; and T ρ (5) for all a 2,..., a h dom(t ρ ), if (a 2,..., a h ) (b 2,..., b h ) then (a 2,..., a h ) is a permutation of (b 2,..., b h ). Proof. ( ) Suppose End ρ End R Θ. Then we know from [7, Propositions 4.6 and 4.7] that k < h, Θ = {θ}, θ has a single nontrivial block B and Z(ρ) B. Suppose now that (4) does not hold. Then there is an i {2,..., h} such that b i is an (h1)-central element of T ρ with the set of witnesses {b 2,..., b h }\{b i }. For the sake of simplicity, let b 2 be an (h 1)-central element of T ρ with the set of witnesses {b 3,..., b h }. Take any c Z(ρ), b 1 B \ {c} and consider c, x = b 1 b 2, x = c f(x) = x, x {b 3,..., b h } c, otherwise. Then f End ρ \ End R Θ which contradicts End ρ End R Θ. Finally, assume that (5) does not hold. Then there exist a 2,..., a h dom(t ρ ) such that (a 2,..., a h ) T ρ (b 2,..., b h ) and (a 2,..., a h ) is not a permutation of (b 2,..., b h ). Then {a 2,..., a h } B since all the a i s are distinct. If {a 2,..., a h } B 2 take an arbitrary a 1 \ {a 2,..., a h }. If, however, {a 2,..., a h } B = 1 take an arbitrary a 1 B\{a 2,..., a h }. Take any c Z(ρ) and consider c, x = a 1 f(x) = b i, x = a i, i {2,..., h} c, otherwise. Then f End ρ \ End R Θ which contradicts End ρ End R Θ. ( ) Suppose End ρ End R Θ, but (1), (2) and (3) are true. Take any f End ρ \ End R Θ and any (a 1,..., a h ) R Θ such that (f(a 1 ),..., f(a h )) / R Θ. Then there is a b 1 B such that (f(a 1 ),..., f(a h )) is a permutation of
15 On endomorphism monoids of partial orders and central s 125 (b 1,..., b h ). Since s we are working with are totally symmetric, without loss of generality we can assume that b i = f(a i ), i {1,..., h}. If there is an i 2 such that a i Z(ρ) then b i is an (h 1)-central element for T ρ witnessed by {b 2,..., b h } \ {b i }. If, however, {a 2,..., a h } Z(ρ) = then from (a 1,..., a h ) R Θ it follows that {a 2,..., a h } B, while f End ρ implies (a 2,..., a h ) T ρ (b 2,..., b h ). References [1] ichinger, E., Mašulović, D., Pöschel, R., Wilson, J. S., Completeness for concrete near-rings. Journal of lgebra 279 (2004), [2] Cameron, P. J., Nešetřil, J., Homomorphism-homogeneous al structures. Combinatorics. Probability and Computing 15 (2006), [3] Lau, D., Bestimmung der Ordnung maximaler Klassen von Funktionen der k- wertigen Logik. Z. Math. Logik u. Grundl. Math. 24 (1978), [4] Pech, M., Mašulović, D., On the height of the poset of endomorphism monoids of regular s. (accetped for publication in Multiple-Valued Logic) Pech, M., Mašulović, D., On traces of maximal clones. Novi Sad J. Math. Vol. 35 No. 1 (2005), [6] Ponjavić, M., On the structure of the poset of endomorphism monoids of central s. Contributions to General lgebra 16 (2005), Ponjavić, M., Mašulović, D., On chains and antichains in the partially ordered set of traces of maximal clones. Contributions to General lgebra 15 (2004), [8] Rosenberg, I. G., Über die funktionale Vollständigkeit in den mehrwertigen Logiken. Rozpr. ČSV Řada Mat. Přir. Věd. Praha 80 4 (1970), Received by the editors November 12, 2007
A strongly rigid binary relation
A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.
More informationFINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1
Novi Sad J. Math. Vol. 40, No. 3, 2010, 83 87 Proc. 3rd Novi Sad Algebraic Conf. (eds. I. Dolinka, P. Marković) FINITE IRREFLEXIVE HOMOMORPHISM-HOMOGENEOUS BINARY RELATIONAL SYSTEMS 1 Dragan Mašulović
More informationA monoidal interval of clones of selfdual functions
Journal of Automata, Languages and Combinatorics u v w, x y c Otto-von-Guericke-Universität Magdeburg A monoidal interval of clones of selfdual functions Andrei Krokhin Department of Computer Science,
More informationCONTRIBUTIONS TO GENERAL ALGEBRA xx
CONTRIBUTIONS TO GENERAL ALGEBRA xx Proceedings of the Klagenfurt Conference Verlag Johannes Heyn????, Klagenfurt ENDOMORPHISMS OF QUASIORDERS AND THEIR QUASIORDER LATTICE REINHARD PÖSCHEL AND SÁNDOR RADELECZKI
More informationDescending chains and antichains of the unary, linear, and monotone subfunction relations
Descending chains and antichains of the unary, linear, and monotone subfunction relations Erkko Lehtonen November 21, 2005 Abstract The C-subfunction relations on the set of functions on a finite base
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationInternational Journal of Mathematical Archive-5(2), 2014, Available online through ISSN
International Journal of Mathematical Archive-5(2), 204, 65-74 Available online through www.ijma.info ISSN 2229 5046 COMPLETENESS FOR CONCRETE NEAR-FIELD SPACES OVER REGULAR δ-near-rings (CC-NF-R-δ-NR)
More informationBounded width problems and algebras
Algebra univers. 56 (2007) 439 466 0002-5240/07/030439 28, published online February 21, 2007 DOI 10.1007/s00012-007-2012-6 c Birkhäuser Verlag, Basel, 2007 Algebra Universalis Bounded width problems and
More informationClones (3&4) Martin Goldstern. TACL Olomouc, June Discrete Mathematics and Geometry, TU Wien
Martin Goldstern Discrete Mathematics and Geometry, TU Wien TACL Olomouc, June 2017 Galois connections Let A, B be sets, R A B. For any S A and any T B let S u := {b B a S : arb} T l := {a A b T : arb}.
More informationPosets, homomorphisms and homogeneity
Posets, homomorphisms and homogeneity Peter J. Cameron and D. Lockett School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract Jarik Nešetřil suggested
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationJónsson posets and unary Jónsson algebras
Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal
More informationANNIHILATOR IDEALS IN ALMOST SEMILATTICE
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 339-352 DOI: 10.7251/BIMVI1702339R Former BULLETIN
More informationCLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS
CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS ANDREI BULATOV, PETER JEAVONS, AND ANDREI KROKHIN Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationA GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY
A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this
More informationNotes on ordinals and cardinals
Notes on ordinals and cardinals Reed Solomon 1 Background Terminology We will use the following notation for the common number systems: N = {0, 1, 2,...} = the natural numbers Z = {..., 2, 1, 0, 1, 2,...}
More informationINSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES. Katětov functors. Wiesław Kubiś Dragan Mašulović
INSTITUTE OF MATHEMATICS THE CZECH ACADEMY OF SCIENCES Katětov functors Wiesław Kubiś Dragan Mašulović Preprint No. 2-2016 PRAHA 2016 Katětov functors Wies law Kubiś Dragan Mašulović Jan Kochanowski University
More informationClones containing all almost unary functions
Clones containing all almost unary functions Michael Pinsker Abstract. Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out
More informationIsomorphisms between pattern classes
Journal of Combinatorics olume 0, Number 0, 1 8, 0000 Isomorphisms between pattern classes M. H. Albert, M. D. Atkinson and Anders Claesson Isomorphisms φ : A B between pattern classes are considered.
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More informationCOLLAPSING PERMUTATION GROUPS
COLLAPSING PERMUTATION GROUPS KEITH A. KEARNES AND ÁGNES SZENDREI Abstract. It is shown in [3] that any nonregular quasiprimitive permutation group is collapsing. In this paper we describe a wider class
More informationClass Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21
Class Notes on Poset Theory Johan G Belinfante Revised 1995 May 21 Introduction These notes were originally prepared in July 1972 as a handout for a class in modern algebra taught at the Carnegie-Mellon
More informationSome more notions of homomorphism-homogeneity
Some more notions of homomorphism-homogeneity Deborah Lockett 1 and John K Truss 2, University of Leeds 3. Abstract We extend the notion of homomorphism-homogeneity to a wider class of kinds of maps than
More informationADDITIVE DECOMPOSITION SCHEMES FOR POLYNOMIAL FUNCTIONS OVER FIELDS
Novi Sad J. Math. Vol. 44, No. 2, 2014, 89-105 ADDITIVE DECOMPOSITION SCHEMES FOR POLYNOMIAL FUNCTIONS OVER FIELDS Miguel Couceiro 1, Erkko Lehtonen 2 and Tamás Waldhauser 3 Abstract. The authors previous
More informationSUBFUNCTION RELATIONS DEFINED BY BURLE S CLONES
SUBFUNCTION RELATIONS DEFINED BY BURLE S CLONES ERKKO LEHTONEN Abstract. Certain quasi-orders of k-valued logic functions defined by the clones that contain all unary operations on the k-element set are
More informationGENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXV, 2(1996), pp. 247 279 247 GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS J. HEDLÍKOVÁ and S. PULMANNOVÁ Abstract. A difference on a poset (P, ) is a partial binary
More informationContents. Index... 15
Contents Filter Bases and Nets................................................................................ 5 Filter Bases and Ultrafilters: A Brief Overview.........................................................
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationV-PERSPECTIVES, DIFFERENCES, PSEUDO-NATURAL NUMBER SYSTEMS AND PARTIAL ORDERS. A. Mani Education School, Calcutta, India
GLASNIK MATEMATIČKI Vol. 37(57)(2002), 245 257 V-PERSPECTIVES, DIFFERENCES, PSEUDO-NATURAL NUMBER SYSTEMS AND PARTIAL ORDERS A. Mani Education School, Calcutta, India Abstract. In this paper, we generalise
More informationThe Essentially Equational Theory of Horn Classes
The Essentially Equational Theory of Horn Classes Hans E. Porst Dedicated to Professor Dr. Dieter Pumplün on the occasion of his retirement Abstract It is well known that the model categories of universal
More informationCounting quantifiers, subset surjective functions, and counting CSPs
Counting quantifiers, subset surjective functions, and counting CSPs Andrei A. Bulatov Amir Hedayaty 1 Abstract We introduce a new type of closure operator on the set of relations, max-implementation,
More informationPart II. Logic and Set Theory. Year
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 60 Paper 4, Section II 16G State and prove the ǫ-recursion Theorem. [You may assume the Principle of ǫ- Induction.]
More informationSOME PROPERTIES ON THE POWERS OF n-ary RELATIONAL SYSTEMS 1
Novi Sad J. Math. Vol. 43, No. 2, 2013, 191-199 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
More informationBoolean Algebras, Boolean Rings and Stone s Representation Theorem
Boolean Algebras, Boolean Rings and Stone s Representation Theorem Hongtaek Jung December 27, 2017 Abstract This is a part of a supplementary note for a Logic and Set Theory course. The main goal is to
More informationarxiv: v1 [math.ra] 21 Sep 2015
Galois theory for semiclones MIKE BEHRISCH arxiv:150906355v1 [mathr] 21 Sep 2015 bstract We present a Galois theory connecting finitary operations with pairs of finitary relations one of which is contained
More informationInfinite constructions in set theory
VI : Infinite constructions in set theory In elementary accounts of set theory, examples of finite collections of objects receive a great deal of attention for several reasons. For example, they provide
More informationarxiv:math/ v1 [math.gm] 21 Jan 2005
arxiv:math/0501341v1 [math.gm] 21 Jan 2005 SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, I. THE MAIN REPRESENTATION THEOREM MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P,
More informationOn the interval of strong partial clones of Boolean functions containing Pol((0,0),(0,1),(1,0))
On the interval of strong partial clones of Boolean functions containing Pol((0,0),(0,1),(1,0)) Miguel Couceiro, Lucien Haddad, Karsten Schölzel, Tamas Waldhauser To cite this version: Miguel Couceiro,
More informationFoundations of Mathematics
Foundations of Mathematics L. Pedro Poitevin 1. Preliminaries 1.1. Sets We will naively think of a set as a collection of mathematical objects, called its elements or members. To indicate that an object
More informationDisjoint n-amalgamation
October 13, 2015 Varieties of background theme: the role of infinitary logic Goals 1 study n- toward 1 existence/ of atomic models in uncountable cardinals. 2 0-1-laws 2 History, aec, and Neo-stability
More informationLogical Theories of Trees
Logical Theories of Trees by Ruaan Kellerman under the supervision of Prof. V. F. Goranko Prof. M. Möller School of Mathematics University of the Witwatersrand Johannesburg South Africa A thesis submitted
More informationA CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY
A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY KEITH A. KEARNES Abstract. We show that a locally finite variety satisfies a nontrivial congruence identity
More informationConnectedness. Proposition 2.2. The following are equivalent for a topological space (X, T ).
Connectedness 1 Motivation Connectedness is the sort of topological property that students love. Its definition is intuitive and easy to understand, and it is a powerful tool in proofs of well-known results.
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationThe Lattice of All Clones Definable by Binary Relations on a Three-Element Set
1 The Lattice of All Clones Definable by Binary Relations on a Three-Element Set Stanislav V. Moiseev The 94th Workshop on General Algebra (AAA94) Novi Sad, Serbia, June 15
More informationLecture 17: Invertible Topological Quantum Field Theories
Lecture 17: Invertible Topological Quantum Field Theories In this lecture we introduce the notion of an invertible TQFT. These arise in both topological and non-topological quantum field theory as anomaly
More informationSome Homomorphic Properties of Multigroups
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Number 1(83), 2017, Pages 67 76 ISSN 1024 7696 Some Homomorphic Properties of Multigroups P. A. Ejegwa, A. M. Ibrahim Abstract. Multigroup
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationTHE WONDERLAND OF REFLECTIONS
THE WONDERLAND OF REFLECTIONS LIBOR BARTO, JAKUB OPRŠAL, AND MICHAEL PINSKER Abstract. A fundamental fact for the algebraic theory of constraint satisfaction problems (CSPs) over a fixed template is that
More informationSubdirectly Irreducible Modes
Subdirectly Irreducible Modes Keith A. Kearnes Abstract We prove that subdirectly irreducible modes come in three very different types. From the description of the three types we derive the results that
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationSOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 1. I. Foundational material
SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 1 Fall 2014 I. Foundational material I.1 : Basic set theory Problems from Munkres, 9, p. 64 2. (a (c For each of the first three parts, choose a 1 1 correspondence
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationFaithful embedding on finite orders classes
Faithful embedding on finite orders classes Alain Guillet Jimmy Leblet Jean-Xavier Rampon Abstract We investigate, in the particular case of finite orders classes, the notion of faithful embedding among
More informationarxiv: v1 [cs.pl] 19 May 2016
arxiv:1605.05858v1 [cs.pl] 19 May 2016 Domain Theory: An Introduction Robert Cartwright Rice University Rebecca Parsons ThoughtWorks, Inc. Moez AbdelGawad SRTA-City Hunan University This monograph is an
More informationOn a quasi-ordering on Boolean functions
Theoretical Computer Science 396 (2008) 71 87 www.elsevier.com/locate/tcs On a quasi-ordering on Boolean functions Miguel Couceiro a,b,, Maurice Pouzet c a Department of Mathematics and Statistics, University
More informationAMS regional meeting Bloomington, IN April 1, 2017
Joint work with: W. Boney, S. Friedman, C. Laskowski, M. Koerwien, S. Shelah, I. Souldatos University of Illinois at Chicago AMS regional meeting Bloomington, IN April 1, 2017 Cantor s Middle Attic Uncountable
More informationFINITELY RELATED CLONES AND ALGEBRAS WITH CUBE-TERMS
FINITELY RELATED CLONES AND ALGEBRAS WITH CUBE-TERMS PETAR MARKOVIĆ, MIKLÓS MARÓTI, AND RALPH MCKENZIE Abstract. E. Aichinger, R. McKenzie, P. Mayr [1] have proved that every finite algebra with a cube-term
More informationFinite Simple Abelian Algebras are Strictly Simple
Finite Simple Abelian Algebras are Strictly Simple Matthew A. Valeriote Abstract A finite universal algebra is called strictly simple if it is simple and has no nontrivial subalgebras. An algebra is said
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationγ γ γ γ(α) ). Then γ (a) γ (a ) ( γ 1
The Correspondence Theorem, which we next prove, shows that the congruence lattice of every homomorphic image of a Σ-algebra is isomorphically embeddable as a special kind of sublattice of the congruence
More informationVAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents
VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0 BENJAMIN LEDEAUX Abstract. This expository paper introduces model theory with a focus on countable models of complete theories. Vaught
More informationClC (X ) : X ω X } C. (11)
With each closed-set system we associate a closure operation. Definition 1.20. Let A, C be a closed-set system. Define Cl C : : P(A) P(A) as follows. For every X A, Cl C (X) = { C C : X C }. Cl C (X) is
More informationTHE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS
THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. This paper is devoted to the semilattice ordered V-algebras of the form (A, Ω, +), where
More informationCantor-Bendixson, socle, and atomicity H. Simmons
Cantor-Bendixson, socle, and atomicity H. Simmons The University, Manchester, England Harold.Simmons @ manchester.ac.uk This document is the second in the series [1] [7], concerned with the use of lattices
More informationAlgebraic Geometry: Limits and Colimits
Algebraic Geometry: Limits and Coits Limits Definition.. Let I be a small category, C be any category, and F : I C be a functor. If for each object i I and morphism m ij Mor I (i, j) there is an associated
More informationTHE JOIN OF TWO MINIMAL CLONES AND THE MEET OF TWO MAXIMAL CLONES. Gábor Czédli, Radomír Halaš, Keith A. Kearnes, Péter P. Pálfy, and Ágnes Szendrei
THE JOIN OF TWO MINIMAL CLONES AND THE MEET OF TWO MAXIMAL CLONES Gábor Czédli, Radomír Halaš, Keith A. Kearnes, Péter P. Pálfy, and Ágnes Szendrei Dedicated to László Szabó on his 50th birthday Abstract.
More information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationHomomorphism-homogeneous relational structures
Homomorphism-homogeneous relational structures Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, UK p.j.cameron@qmul.ac.uk and Jaroslav Nešetřil
More informationRepresentation theory and quantum mechanics tutorial Spin and the hydrogen atom
Representation theory and quantum mechanics tutorial Spin and the hydrogen atom Justin Campbell August 3, 2017 1 Representations of SU 2 and SO 3 (R) 1.1 The following observation is long overdue. Proposition
More informationIDEMPOTENT n-permutable VARIETIES
IDEMPOTENT n-permutable VARIETIES M. VALERIOTE AND R. WILLARD Abstract. One of the important classes of varieties identified in tame congruence theory is the class of varieties which are n-permutable for
More informationTHE ENDOMORPHISM SEMIRING OF A SEMILATTICE
THE ENDOMORPHISM SEMIRING OF A SEMILATTICE J. JEŽEK, T. KEPKA AND M. MARÓTI Abstract. We prove that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and describe
More informationADDITIVE GROUPS OF SELF-INJECTIVE RINGS
SOOCHOW JOURNAL OF MATHEMATICS Volume 33, No. 4, pp. 641-645, October 2007 ADDITIVE GROUPS OF SELF-INJECTIVE RINGS BY SHALOM FEIGELSTOCK Abstract. The additive groups of left self-injective rings, and
More informationThe complexity of constraint satisfaction: an algebraic approach
The complexity of constraint satisfaction: an algebraic approach Andrei KROKHIN Department of Computer Science University of Durham Durham, DH1 3LE UK Andrei BULATOV School of Computer Science Simon Fraser
More informationComplexity of conservative Constraint Satisfaction Problems
Complexity of conservative Constraint Satisfaction Problems ANDREI A. BULATOV Simon Fraser University In a constraint satisfaction problem (CSP) the aim is to find an assignment of values to a given set
More informationExtension of continuous functions in digital spaces with the Khalimsky topology
Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationEQUIVALENCE RELATIONS AND OPERATORS ON ORDERED ALGEBRAIC STRUCTURES. UNIVERSITÀ DEGLI STUDI DELL'INSUBRIA Via Ravasi 2, Varese, Italy
UNIVERSITÀ DEGLI STUDI DELL'INSUBRIA Via Ravasi 2, 21100 Varese, Italy Dipartimento di Scienze Teoriche e Applicate Di.S.T.A. Dipartimento di Scienza e Alta Tecnologia Di.S.A.T. PH.D. DEGREE PROGRAM IN
More informationDECIDABILITY OF DEFINABILITY
DECIDABILITY OF DEFINABILITY MANUEL BODIRSKY, MICHAEL PINSKER, AND TODOR TSANKOV Abstract. For a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational
More informationA GRAPHICAL REPRESENTATION OF RINGS VIA AUTOMORPHISM GROUPS
A GRAPHICAL REPRESENTATION OF RINGS VIA AUTOMORPHISM GROUPS N. MOHAN KUMAR AND PRAMOD K. SHARMA Abstract. Let R be a commutative ring with identity. We define a graph Γ Aut R (R) on R, with vertices elements
More informationThe seed order. Gabriel Goldberg. October 11, 2018
The seed order Gabriel Goldberg October 11, 2018 arxiv:1810.04284v1 [math.lo] 9 Oct 2018 Abstract e study various orders on countably complete ultrafilters on ordinals that coincide and are wellorders
More informationRESIDUAL SMALLNESS AND WEAK CENTRALITY
RESIDUAL SMALLNESS AND WEAK CENTRALITY KEITH A. KEARNES AND EMIL W. KISS Abstract. We develop a method of creating skew congruences on subpowers of finite algebras using groups of twin polynomials, and
More informationEndomorphism rings generated using small numbers of elements arxiv:math/ v2 [math.ra] 10 Jun 2006
Endomorphism rings generated using small numbers of elements arxiv:math/0508637v2 [mathra] 10 Jun 2006 Zachary Mesyan February 2, 2008 Abstract Let R be a ring, M a nonzero left R-module, and Ω an infinite
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationTensor Product of modules. MA499 Project II
Tensor Product of modules A Project Report Submitted for the Course MA499 Project II by Subhash Atal (Roll No. 07012321) to the DEPARTMENT OF MATHEMATICS INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI GUWAHATI
More informationPolynomials as Generators of Minimal Clones
Polynomials as Generators of Minimal Clones Hajime Machida Michael Pinser Abstract A minimal clone is an atom of the lattice of clones. A minimal function is a function which generates a minimal clone.
More informationLattices, closure operators, and Galois connections.
125 Chapter 5. Lattices, closure operators, and Galois connections. 5.1. Semilattices and lattices. Many of the partially ordered sets P we have seen have a further valuable property: that for any two
More informationGalois correspondence for counting quantifiers
Galois correspondence for counting quantifiers ANDREI A. BULATOV 1, AMIR HEDAYATY 1 Simon Fraser University We introduce a new type of closure operator on the set of relations, max-implementation, and
More informationCategory Theory. Categories. Definition.
Category Theory Category theory is a general mathematical theory of structures, systems of structures and relationships between systems of structures. It provides a unifying and economic mathematical modeling
More informationGRAPHS ADMITTING k-nu OPERATIONS. PART 1: THE REFLEXIVE CASE
GRAPHS ADMITTING k-nu OPERATIONS. PART 1: THE REFLEXIVE CASE TOMÁS FEDER, PAVOL HELL, BENOÎT LAROSE, CYNTHIA LOTEN, MARK SIGGERS, AND CLAUDE TARDIF Abstract. We describe a generating set for the variety
More informationOn Polynomials in Mal cev Algebras
University of Novi Sad Faculty of Sciences Department of Mathematics and Informatics Nebojša Mudrinski On Polynomials in Mal cev Algebras Doctoral dissertation Novi Sad, 2009 Contents Foreword 3 Chapter
More informationGroups of Prime Power Order with Derived Subgroup of Prime Order
Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*
More information