Classes of Universal Graphs Definable by Universal Graph Algebra Quasi-Identities

Size: px
Start display at page:

Download "Classes of Universal Graphs Definable by Universal Graph Algebra Quasi-Identities"

Transcription

1 International Mathematical Forum, Vol. 8, 2013, no. 16, HIKARI Ltd, Classes of Universal Graphs Definable by Universal Graph Algebra Quasi-Identities P. Jampachon and T. Poomsa-ard Department of Mathematics, Faculty of Science Khon Kaen University, Khon Kaen 40000, Thailand Copyright c 2013 P. Jampachon and T. Poomsa-ard. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract Universal graph algebras establish a connection between universal graphs (i.e. n i ary relations) and universal algebras. A universal graph theoretic characterization of universal graph quasi-varieties, i.e. classes of universal graphs definable by universal graph quasi-identities, is given. The results give rise to a structure theorem of Birkhoff-type: A class of finite undirected universal graphs is a universal graph quasivarieties if and only if it is closed with respect to isomorphisms, induced subgraphs, finite disjoint unions and homogeneous subproducts. Some examples are also considered. Mathematics Subject Classification: 05C25, 08B15 Keywords: universal graphs, universal graph algebras, universal graph varieties, universal graph quasi-varieties, terms, homogeneous subproducts, directed products 1 Introduction Graph algebras have been invented in [5] to obtain examples of nonfinitely based finite algebras. To recall this concept, let G =(V,E) be a (directed) graph with the vertex set V and the edge set E V V. Define the graph

2 790 P. Jampachon and T. Poomsa-ard algebra A(G) corresponding to G to have the underlying set V { }, where is a symbol outside V, and two basic operations, a nullary operation pointing to and binary one denoted by juxtaposition, given for u, v V { } by { u, if (u, v) E, uv =, otherwise. Universal graph algebras have been defined in [3] to obtain some basic properties of universal graph algebras. To recall this concept, let G =(V,E) be a multi graph with the vertex set V and the edge set E, an edge in E is an ordered pair of vertices (not necessarily distinct) of V and let τ =(n i ) i I,n i 2 be a sequence of natural number. A function f i : V n i V is called an n i -ary operation defined on V, and is said to have arity n i. For convenient we label all edges of E to be distinct. Let E fi V n i, where (v 1,v 2,..., v ni ) E fi if and only if (v 1,v 2 ), (v 2,v 3 ),..., (v ni 1,v ni ) E and the labels of them are all different, further if e fi =(v 1,v 2,..., v ni ) E fi and e fj =(u 1,u 2,..., u nj ) E fj, then the intersection of the label set of (v 1,v 2 ), (v 2,v 3 ),..., (v ni 1,v ni ) and the label set of (u 1,u 2 ), (u 2,u 3 ),..., (u nj 1,u nj ) is an empty set. In this case G =(V,(E fi ) i I ) is called an universal graph of type τ =(n i ) i I, n i 2. Define the universal graph algebra A(G) of type τ = (0, (n i ) i I ), n i 2 corresponding to the universal graph G with the underlying set V { }, where is a symbol outside V, and basic operations, nullary operation pointing to and n i -ary operations f i,i I, given for elements of (V { }) n i, n i 2by { v1, if (v f i (v 1,v 2,..., v ni )= 1,v 2,..., v ni ) E fi,, otherwise. In [4] graph quasi-varieties had been investigated for finite undirected graphs in order to get graph theoretic results (structure theorems) from universal algebra via graph algebras. In the present paper these investigations are extended to finite undirected universal graphs. We ask for an universal graph theoretic characterization of universal graph quasi-varieties, i.e. the classes of universal graphs with can be defined by quasi-identities for their corresponding universal graph algebras. The answer is a theorem of Birkhoff-type, which uses graph theoretic closure operations. A class of finite undirected universal graphs is quasi-equational (i.e., an universal graph quasi-variety) if and only if it is closed with respect to isomorphisms, induced subgraphs, finite disjoint unions and homogeneous subproducts. 2 Preliminaries We recall the following terminology and notations. Let G =(V,(E fi ) i I )be an universal graph of type τ =(n i ) i I, n i 2. G is called undirected, if for

3 Classes of universal graphs 791 each E fi,i I is a symmetric relation. An edge e fi =(v 1,v 2,..., v ni ) E fi is called a loop if v 1 = v ni. Let V (G) be the set of all vertices v V (G) which is an initial point or a terminal point of an edge in E(G), E (G) be the set of all order pairs (u, v) V (G) V (G) where u, v are initial and terminal points of an edge in E(G), respectively. A universal graph G is called a subgraph of G if V (G ) V (G) and E fi (G ) E fi (G), i I. A universal graph G is called an induced subgraph of G if V (G ) V (G) and E fi (G )=E fi (G) (V (G )) n i, i I. Given universal graph G i,i I, the direct product G = i I G i is the universal graph G with V (G) = i I V (G i) and E fi (G) ={(a 1,a 2,..., a ni ) (V (G)) n i (a 1 (j),a 2 (j),..., a ni (j)) E fi (G j ),j I}, i I. Here, for a V (G), let a(j) denote the j-component: a =(a(j)) j I. Assume the sets V (G i ), i I to be pairwise disjoint (otherwise make the sets V (G i ) disjoint i.e. use V (G i ) {i}), then the disjoint union G = i I G i is simply the union of the universal graphs G i, i.e. V (G) = i I V (G i ), E fj (G) = i I E fj (G i ), j I. Products or unions are called finite if I is finite. A mapping h : V (G) V (G )isahomomorphism from a universal graph G into a graph G if for all a, b V (G), (a 1,a 2,..., a ni ) E fi (G), i I, a = a 1, b = a ni implies (h(a 1 ),h(a 2 ),..., h(a ni )) E fi (G ). The homomorphism h is called strong if (a 1,a 2,..., a ni ) / E fi (G) implies (h(a 1 ),h(a 2 ),..., h(a ni )) / E fi (G ). An isomorphism (universal graph isomorphism) is a bijective strong homomorphism. H(G, G ) denotes the set of all homomorphism from G into G. For class R of universal graphs, let IR, SR, P R, P f R, UR, U f R denote the classes of all isomorphic copies, induced subgraphs, direct products, finite direct products, disjoint unions, and finite disjoint unions of members of R, respectively. Let G d, G df and G uf be the class of directed universal graphs, the class of finite directed universal graphs and the class of finite undirected universal graphs, respectively. We omit the index f (= finite), if also infinite universal graphs are to be considered. For all universal graphs G under consideration, let G =(V,(E fi ) i I ) as defined in section 1 (introduction). The algebra A(G) =(V (G) { }, (f i ) i I, ) is called the universal graph algebra of G. For universal graphs G 1 and G 2, h : G 1 G 2 is a strong homomorphism if and only if h : A(G 1 ) A(G 2 ) (extended by h( ) = ) is a homomorphism of the corresponding universal graph algebras. Let W τ (X), τ = (0, (n i ) i I ), n i 2, be the set of all terms over the alphabet X = {x 1,x 2,x 3,...} defined inductively as follows: (i) every variable x i,i=1, 2, 3,..., and are terms, (ii) if t 1,t 2,..., t ni are terms, then f i (t 1,t 2,..., t ni ) is a term, where f i is an n i -ary operation. W τ (X) is the set of all terms which can be obtained from (i) and (ii) in finitely many steps. The leftmost variable of a term t is denoted by L(t) and the rightmost variable of a term t is denoted by R(t). The terms in which the symbol

4 792 P. Jampachon and T. Poomsa-ard occurs are called a trivial terms. These terms evaluate to in every universal graph algebras. To every non-trivial term t of type τ =(0, (n i ) i I ), n i 2 we assign an universal graph G(t) =(V (t), (E fi (t)) i I ), where the vertex set V (t) is the set of all variables occurring in t and each E fi (t), i I is defined inductively by E fi (t) =φ, i I if t is a variable and E fi (f i (t 1,t 2,..., t ni )) = E fi (t 1 ) E fi (t 2 )... E fi (t ni ) {(L(t 1 ),L(t 2 ),..., L(t ni ))}, when t = f i (t 1,t 2,..., t ni ) is a compound term and L(t 1 ),L(t 2 ),..., L(t ni ) are the leftmost variables of t 1,t 2,..., t ni respectively. Formally, we assign the empty graph φ, to every trivial term t. For convenience we will introduce some more notations about universal graph in the following way: Let G =(V,(E fi ) i I ) be an universal graph. For any u, v V (G), we say that there exists a dipath from u to v in G if there exists a sequence of order pairs (a 1,b 1 ), (a 2,b 2 ),..., (a n,b n )ine (G) such that u = a 1, b 1 = a 2,...,b n 1 = a n and b n = v. For any u V (G), the set of u and all v V (G) such that there exists a dipath from u to v in G, is denoted by A G (u). If A G (u) =V (G), then we say that G is a rooted universal graph with root u. We see that L(t) is a root of the universal graph G(t) and the pair (G(t),L(t)) is the rooted universal graph corresponding to t. Given t W τ (X), G G d and a mapping (assignment) h : V (t) V (G) { }, let h(t) denote the value of t in A(G) when every variable x V (t) is substituted by h(x). Let s, t W τ (X). A universal graph G satisfies the equation s t (or s t holds in G), denoted by G = s t, ifh(s) =h(t) holds in A(G) (G = h(s) h(t)) for every assignment h : V (s) V (t) V (G) { }. For a set Σ of equations and an assignment h : V (Σ) V { }) (V (Σ) denotes the set of variables occurring in Σ) we write G = h(σ) if for all s t Σ, G = h(s) h(t) and we write G = ΣifG = s t for all s t Σ. Let t W τ be a term. We write t(x i1,x i2,..., x in )ifx i1,x i2,..., x in are the variables which occur in t. Given a term t(x 0,x 1,..., x n ), an universal graph G and a mapping h : V (t) V (G) { }, we define h(t) = t(h(x 0 ),h(x 1 ),..., h(x n )) (the right hand side has to be computed in A(G)). Sometimes we call h an evaluation of the variables. In [3], proved the following propositions: Proposition 2.1. Let G =(V,(E fi ) i I ) be an universal graph of type τ = (n i ) i I, n i 2 and let h : X V { } be an evaluation of the variables. Consider the canonical extension of h to the set of all terms. Then there holds: if t is a trivial term, or if h takes the value on X, then h(t) =. Otherwise, if h : G(t) G is a homomorphism of graphs, then h(t) =h(l(t)), and if h is not a homomorphism of graphs, then h(t) =.

5 Classes of universal graphs 793 Proposition 2.2. Let s and t be non-trivial terms from W τ (X) with variables V (s) =V (t) ={x 0,x 1,..., x n } and L(s) =L(t). Then an universal graph G = (V,(E fi ) i I ) satisfies s t if and only if the universal graph algebra A(G) has the following property: A mapping h : V (s) V { } is a homomorphism from G(s) into G iff it is a homomorphism from G(t) into G. Proposition 2.3. Let s, t W τ (X), τ =(0, (n i ) i I ), n i 2 be terms. Then the non-trivial equation s t is an identity in the class of all universal graph algebras iff either both terms s and t are trivial or none of them is trivial, G(s) =G(t) and L(s) =L(t). A quasi-identity q is a finite set Σ = {s 1 t 1,..., s n t n } of equations together with an equation s t: we use the notation Σ s t or s 1 t 1... s n t n s t. A graph G satisfies the quasi-identities q, denoted by G = q, if for every assignment h : V (q) V (G) { } (V (q) denotes the set of variables occurring in q) the following implication holds: h(s 1 ) h(t 1 )... h(s n ) h(t n ) h(s) h(t). This will be denoted by G = h(σ) h(s) h(t) (or G = h(q)). Note that every equation s t can be considered as a quasi-identity because G = s t G = s t. For R G d and a set Q of quasi-identities (or equations) we write R = Q if G = q for all q Qand G R. 3 Characterization of universal graph quasivarieties Definition 3.1. For a set Q of quasi-identities and a class R of universal graphs, let Mod(Q) ={G G d G = Q} and Qid(R) ={q q is a quasiidentity and R = q}. We let Qvar(R) =Mod(Qid(R)) and for a given class G of universal graphs, Qvar G (R) =G Qvar(R). A class of this form is called a quasi-equational or a universal graph quasi-variety in G. In particular, Qvar G (R) is the universal graph quasi-variety generated by R in G. Remark 3.1. In general, universal graph quasi-varieties are not quasi-varieties in the usual universal-algebraic sense, e.g. the direct product of universal graph algebras is not a universal graph algebra. Clearly, Qvar G (R) consists of universal graphs from G whose universal graph algebras belong to the quasi-variety ISPP u R (cf. [1] p. 219, Thm. 2.25, R = {A(G) G R}). However, the most algebras in ISPP u R are not universal graph algebras. Therefore it is reasonable to ask for an internal characterization of Qvar G (R) using operations on binary relations (= uiversal graphs) only to avoid ultraproducts and infinite universal graphs.

6 794 P. Jampachon and T. Poomsa-ard Definition 3.2. A universal graph G is called a homogeneous subproduct of a family (G i ) i I of universal graphs, if (i) G is an induced subgraph of i I G i, (ii) For all a, b V (G) either (a(i),b(i)) E (G i ) forall i I or (a(i),b(i)) / E (G i ) forall i I. For a set R of universal graphs, let P h R (P hf R, resp.) denote the set of all homogeneous subproducts of families (finite families, resp.) of members of R. Proposition 3.1. Let R be the class of universal graphs and G be a universal graph with V (G) 2. Then G IP h R if and only if for all a, b V (G) with a b there exists an R Rand a strong homomorphism φ : G R such that φ(a) φ(b). Moreover, if G is finite, then G IP h R implies G IP hf R. In case V (G) =1,G IP h R if and only if there is a strong homomorphism φ : G R. Proof. ( ) IfG i I R i is a homogeneous subproduct, then every projection p i : G R i : a a(i) is a homomorphism which is strong by (ii). Distinct a, b V (G) must differ in at least one component i I, i.e. p i (a) p i (b). ( ) Let I = {(a, b) a b, a, b V (G)} and assume that there is a strong homomorphism φ (a,b) : G R (a,b) Rwith φ (a,b) (a) φ (a,b) (b) for all (a, b) I. Let B be the induced subgraph of i I R i with V (B) = {(φ i (c)) i I c V (G)}. Then B is a homogeneous subproduct. Since φ i is a strong homomorphism, there exists i I, (φ i (c),φ i (c )) E (R i ). So (c, c ) E (G), we get (φ i (c),φ i (c )) E (R i ) for all i I. Moreover, G is isomorphic to B because c (φ i (c)) i I is an isomorphism by construction, i.e. G IP h R.IfGis finite, this construction also gives a finite set I. Lemma 3.1. Let s and t be non-trivial terms and let B i I G i be a homogeneous subproduct of (G i ) i I. Then for an assignment h : V (s) V (t) V (B) { }, we have B = h(s) h(t) if and only if G i = h i (s) h i (t), where h i is the composition of h with the i-th projection p i (h i (x) =p i (h(x)) = (h(x))(i), and h i (x) = if h(x) = ). Proof. ( ) Suppose that B = h(s) h(t). If h(s) = with h(x) =, then h(t) =. Suppose that h(t) = with h(y) =. We have h i (x) = and h i (y) =. Hence h i (s) = = h i (t). Suppose that h(t) = and the restriction of h on V (t) is not a homomorphism. Hence there exists (u, v) E (t) such that (h(u),h(v)) / E (B). Since B is a homogeneous subproduct, we have (h(u)(i),h(v)(i)) / E (G i ). Therefore h i (t) =. We get h i (s) = = h i (t). Similarly, we can proof that if h(s) = and the restriction of h on V (s) is not a homomorphism, then h i (s) = = h i (t). Next, we suppose that h(s). Then we have h(t). Let h(s) =h(x)

7 Classes of universal graphs 795 and h(t) = h(y). Hence h(x) = h(y), i.e. (h(x))(i) =(h(y))(i) for all i I. Therefore h i (s) =h i (x) =p i (h(x)) = p i (h(y)) = h i (y) =h i (t). ( ) Suppose that h i (s) = h i (t). If h i (s) = with h i (x) =, then h i (t) =. Suppose that h i (t) = with h i (y) =. Since G(s) is connected, there is z V (s) such that (x, z) E (s) or(z, x) E (s). Since h(x) =, we have (h(x),h(z)) / E (B) and (h(z),h(x)) / E (B). Hence h(s) =. Similarly, we have h(t) =. Suppose that h i (t) = and the restriction of h i on V (t) is not a homomorphism. Then there exists (u, v) E (t) such that (h i (u),h i (v)) / E (B). Since B is a homogeneous subproduct, we have (h i (u)(i),h i (v)(i)) / E (G i ) and (h(u),h(v)) / E (B). Therefore h(t) =. We get h(s) = = h(t). In the same manner, we can proof that if h i (s) = such that the restriction of h i on V (s) is not a homomorphism, then h(s) = = h(t). Suppose that h i (s). We have h i (t). Let h i (s) =h i (x) and h i (t) = h i (y). Hence h i (x) = h i (y) i.e. (h(x))(i) = (h(y))(i),i I. Therefore h(x) = h(y). We get h(s) = h(x) = h(y) = h(t). Lemma 3.2. Let s and t be non-trivial terms, G be a disjoint union of G 1 and G 2, h : V (s) V (t) V (G) { } be an assignment and let h i : V (s) V (t) V (G) { } be defined by h i (x) = h(x) if h(x) V (G i ) and h i (x) = otherwise (i {1, 2}). Then h(s) =h(t) if and only if h 1 (s) =h 1 (t) and h 2 (s) =h 2 (t). Proof. First we show that h(s) =, ifh(v (s)) V (G 1 ) and h(v (s)) V (G 2 ). Suppose that x, y V (s), h(x) V (G 1 ), h(x) / V (G 2 ), h(y) V (G 2 ) and h(y) / V (G 1 ). Since G(s) is a connected universal graph. Hence, there is an edge e E(G(s)) which x and y occur. But since G 1 and G 2 are disjoint, there is no edge e h(v (s)) which h(x) and h(y) occur. Therefore h is not a homomorphism. We get h(s) =. In the similar way we have h(t) = if h(v (t)) V (G 1 ) and h(v (t)) V (G 2 ). Moreover, from construction we see that h i (s) =h(s) ifh(v (s)) V (G i ) { }, h i (s) = if h(v (s)) V (G i ) and h i (t) =h(t) ifh(v (t)) V (G i ) { }, h i (t) = if h(v (t)) V (G i ). Now we will use these properties to show that h(s) = h(t) if and only if h 1 (s) =h 1 (t) and h 2 (s) =h 2 (t). Clearly, if h(s) =h(t), then h 1 (s) =h 1 (t) and h 2 (s) =h 2 (t). Suppose that h 1 (s) =h 1 (t) and h 2 (s) =h 2 (t) and let h : V (s) V (t) V (G) { } be an assignment. Since h 1 (s) =h 1 (t), we have h(v (s)) V (G 1 ) { } if and only if h(v (t)) V (G 1 ) { } and since h 2 (s) = h 2 (t), we have h(v (s)) V (G 2 ) { } if and only if h(v (t)) V (G 2 ) { }. If h(v (s)) V (G 1 ) { }, then we have h(v (t)) V (G 1 ) { }. Hence h(s) =h 1 (s) =h 1 (t) =h(t). If h(v (s)) V (G 1 ), then h(v (t)) V (G 1 ) and if h(v (t)) V (G 2 ), then h(v (s)) V (G 2 ). Hence h(v (s)) V (G 1 ), h(v (t)) V (G 2 )orh(v(t)) V (G 2 ). If h(v (s)) V (G 1 ) and h(v (t)) V (G 2 ), then we get h(v (s)) V (G 1 ), h(v (s)) V (G 2 ), h(v (t)) V (G 1 )

8 796 P. Jampachon and T. Poomsa-ard and h(v (t)) V (G 2 ). Therefore h(s) = = h(t). If h(v (t)) V (G 2 ), then h(v (s)) V (G 2 ). Hence h(s) =h 2 (s) =h 2 (t) =h(t). Lemma 3.3. For a class R of universal graphs we have IU f P h R Qvar(R). Proof. 1) Let B i I G i be a homogeneous subproduct, G i R,i I and let q = (Σ s t) QidR. We show that B = q. Let h : V (q) V (B) { } be some assignment such that B = h(σ). We have to show h(s) =h(t). Let h i be a composition of h and p i be the i-th projection. By Lemma 3.1, we obtain G i = h i (Σ). Thus G i = h i (s) h i (t) for all i I because G i = q. Again by Lemma 3.1, we get h(s) =h(t). Consequently, B = q. 2) Let G = G 1 G 2 be the disjoint union of G 1,G 2 Rand let q =(Σ s t) QidR. We show that G = q. Let h : V (q) V (G) { } be an assignment and assume G = h(σ). We have to show G = h(s) h(t). Define the assignments h 1 : V (q) V (G 1 ) { }, h 2 : V (q) V (G 2 ) { } by setting h i (x) =h(x) ifx V (G i ) and h(x) = otherwise (i {1, 2}). By Lemma 3.2, we get G = h(σ) and G i = h i (Σ) for each i. Since q QidR and G 1,G 2 R(i.e. G i = q), G i = h i (s) h i (t). And again by Lemma 3.2, G = h(s) h(t). Hence G = q. 3) By 1) and 2), we have IU f P h R Qvar(R). Now we are already to formulate the main theorem for quasi-varieties in G uf. Theorem 3.1. Let R be a non-empty subclass of G uf. Then Qvar Guf (R) = IU f P hf R. Proof. Because of Lemma 3.3 and Proposition 3.1, it suffices to show Qvar Guf (R) IU f P h R. Since every universal graph is the disjoint union of its connected components, it remains to show G IP h R for every given connected undirected universal graph G Qvar Guf (R). Let V (G) ={a 0,..., a n }. Consider the following set Σ of identities Σ={(x j1,..., x jni ) x j1 (a j1,..., a jni ) E(G)} {(x j1,..., x jni ) (a j1,..., a jni ) / E(G)}. Then Σ is finite since G is finite. Obviously, under the canonical assignment g : x i a i (i =0,..., n) we have G = g(σ). Thus for given a i,a j V (G),a i a j, the quasi-identity q =Σ x i x j does not hold in G. Since G Qvar(R), we have q / Qid(R), i.e. R q. Hence there is some R Rwith R q, i.e. there must be some assignment h : V (Σ) V (R) { } such that R = h(σ) but R h(x i ) h(x j ). By construction of Σ and connectedness

9 Classes of universal graphs 797 of G, for every two variables x, y V (Σ) there is some sequence (z 1,..., x) z 1,..., (z m,..., z m 1 ) z m, (y,..., z m ) y of identities from Σ. Consequently, h(x) = would implies h(y) = (note z = ). Since h(x i ) h(x j ) we have h(x) for all x V (Σ), i.e. h maps V (Σ) into V (R). By construction of Σ, h = g 1 h : a i h(x i ) is a strong homomorphism from G into R; in fact, (a k,..., a l ) E(G) implies (x k,..., x l ) x k Σ implies R = (h(x k ),..., h(x l )) h(x k ), i.e. (h (a k ),..., h (a l )) E(R). Analogously, we can show that (a k,..., a l ) / E(G) implies (h (a k ),..., h (a l )) / E(R): k, l {0,..., n}. By Proposition 3.1, we can conclude G IP h R. Let us consider what happens if we want to treat also infinite universal graphs. Since every finitely generated subgraphs of a universal graph algebra is finite, we have Qvar(R) =Qvar(S f (R)) for a given class R of universal graphs, where S f R denotes the class of all finite induced subgraphs of members of R. Thus, for an arbitrary R G u, we have Qvar Guf (R) =IS f U f P hf (R) = IU f P hf S f (R) by Theorem 3.1. Moreover, we have G Qvar(R) if and only if S f ({G}) Qvar Guf. This characterizes general universal graph quasi-varieties and our restriction to finite universal graphs was not essential. 4 Examples Definition 4.1. For a set Σ of identities and classes R and G of universal graphs let Mod(Σ) = {G G d G = Σ}, Id(R) ={s t R = s t, s, t W τ (X)}, Var(R) =Mod(Id(R)) (the universal graph variety generated by R) Var G (R) =G Var(R) (the universal graph variety generated by R in G). Many universal graph theoretic properties can be expressed as identities or quasi-identities. We mention here some examples which may be of universal graph theoretic interest, as well. Example 4.1. Let Σ = {(x, x 1,..., x ni 2,y),i I}. Then Mod(Σ) is the indicated class of universal graphs without loops. Example 4.2. Let Σ = {(x, x 1,..., x ni 2, (y, x ni 2,..., x 1,x)) (x, x 1,..., x ni 2,y),i I}. Then Mod(Σ) is the indicated class of undirected universal graphs. Every universal graph variety is also a universal graph quasi-variety. The converse is not true, and we mention here some universal graph quasi-variety of undirected universal graphs without loops which are not universal graph varieties.

10 798 P. Jampachon and T. Poomsa-ard Example 4.3. Let C G uf be a connected universal graph without loops. Up to isomorphism we can assume V (C) {x 0,x 1,...} and (x 0,x j1,..., x jni 2, x 1 ) E(C),i I. Let q = {(x 0,x j1,..., x jni 2,x 0 ), (x 0,x k1,..., x kni 2, (x 1,x kni 2,..., x k1,x 0 )) (x 0,x k1,..., x kni 2,x 1 ), Σ(C) x 0 x 1, i I}, where Σ(C) =(x, x j1,..., x jni 2,y) x (x, x j1,..., x jni 2,y) E(C)} {(x, x k1,..., x kni 2,y) (x, x k1,..., x kni 2,y) / E(C)}, x, y V (C), i I. We see that Mod(q) is the class of undirected universal graphs without loops which contain no induced subgraph isomorphic to C or to a strong homomorphism image of C. SoMod(q) is a universal graph quasi-variety but it is no a universal graph variety. 4. Conclusion and discussion In this article, a universal graph theoretic characterization of universal graph quasi-varieties, i.e. the classes of universal graphs with can be defined by quasi-identities for their corresponding universal graph algebras, is given. We obtain a theorem of Birkhoff-type, which uses graph theoretic closure operations. A class of finite undirected universal graphs is quasi-equational (i.e., a universal graph quasi-variety) if and only if it is closed with respect to isomorphisms, induced subgraphs, finite disjoint unions and homogeneous subproducts. Finally, it is worth while to mention that the result can be a guideline for futher investigate in the directions of the equational logic for universal graph algebras, universal graph varieties, subvarieties, and subvarieties of universal graph varieties generated by universal graph algebras. Acknowledgment This work was supported by the Higher Education Research Promotion and National Research University Project of Thailand, Office of the Higher Education Commission, through the the Cluster of Research to Enhance the Quality of Basic Education. References [1] S. Burris and H.P. Sankappanavar, A course in Universal Algebra, Springer-Verlag New York Heidelberg Berlin [2] K. Denecke and S.L. Wismath, Universal Algebra and Applications in Theoretical Computer Science, ChapmanHall/CRC [3] T. Poomsa-ard, Identities in universal graph algebras, Int. Math. Forum, 4, 2009, no. 35,

11 Classes of universal graphs 799 [4] R. Pöschel and W. Wessel, Classes of graphs definable by graph algebras identities or quasiidentities, Comment. Math. Univ. Carolonae 28(1987), [5] C. R. Shallon, Nonfinitely based finite algebras derived from lattices, Ph. D. Dissertation, Uni. of California, Los Angeles, Received: February 21, 2013

Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Graph Algebra of Type (2,0)

Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Graph Algebra of Type (2,0) International Mathematical Forum, 5, 2010, no. 12, 557-571 Triregular Leftmost without Loop and Reverse Arc Graph Varieties of Graph Algebra of Type (2,0) Montri Thongmoon and Tiang Poomsa-ard Department

More information

Identities in (X(YZ))Z with Reverse Arc Graph Varieties of Type (2,0)

Identities in (X(YZ))Z with Reverse Arc Graph Varieties of Type (2,0) International Mathematical Forum, 5, 2010, no. 28, 1365-1376 Identities in (X(YZ))Z with Reverse Arc Graph Varieties of Type (2,0) Apinant Anantpinitwatna and Tiang Poomsa-ard Department of Mathematics,

More information

Equational Logic. Chapter Syntax Terms and Term Algebras

Equational 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 information

Fuzzy M-solid subvarieties

Fuzzy M-solid subvarieties International Journal of Algebra, Vol. 5, 2011, no. 24, 1195-1205 Fuzzy M-Solid Subvarieties Bundit Pibaljommee Department of Mathematics, Faculty of Science Khon kaen University, Khon kaen 40002, Thailand

More information

Direct Product of BF-Algebras

Direct Product of BF-Algebras International Journal of Algebra, Vol. 10, 2016, no. 3, 125-132 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.614 Direct Product of BF-Algebras Randy C. Teves and Joemar C. Endam Department

More information

On Symmetric Bi-Multipliers of Lattice Implication Algebras

On Symmetric Bi-Multipliers of Lattice Implication Algebras International Mathematical Forum, Vol. 13, 2018, no. 7, 343-350 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/imf.2018.8423 On Symmetric Bi-Multipliers of Lattice Implication Algebras Kyung Ho

More information

Canonical Commutative Ternary Groupoids

Canonical Commutative Ternary Groupoids International Journal of Algebra, Vol. 11, 2017, no. 1, 35-42 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.714 Canonical Commutative Ternary Groupoids Vesna Celakoska-Jordanova Faculty

More information

Order-theoretical Characterizations of Countably Approximating Posets 1

Order-theoretical Characterizations of Countably Approximating Posets 1 Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 9, 447-454 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.4658 Order-theoretical Characterizations of Countably Approximating Posets

More information

GENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE LANGUAGES

GENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE LANGUAGES Atlantic Electronic http://aejm.ca Journal of Mathematics http://aejm.ca/rema Volume 6, Number 1, Summer 2014 pp. 26-37 GENERATING SETS AND DECOMPOSITIONS FOR IDEMPOTENT TREE ANGUAGES MARK THOM AND SHEY

More information

Some Properties of D-sets of a Group 1

Some Properties of D-sets of a Group 1 International Mathematical Forum, Vol. 9, 2014, no. 21, 1035-1040 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.45104 Some Properties of D-sets of a Group 1 Joris N. Buloron, Cristopher

More information

On Annihilator Small Intersection Graph

On Annihilator Small Intersection Graph International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 283-289 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7931 On Annihilator Small Intersection Graph Mehdi

More information

Independent Transversal Equitable Domination in Graphs

Independent Transversal Equitable Domination in Graphs International Mathematical Forum, Vol. 8, 2013, no. 15, 743-751 HIKARI Ltd, www.m-hikari.com Independent Transversal Equitable Domination in Graphs Dhananjaya Murthy B. V 1, G. Deepak 1 and N. D. Soner

More information

Universal Algebra for Logics

Universal 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 information

The Essentially Equational Theory of Horn Classes

The 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 information

Contra θ-c-continuous Functions

Contra θ-c-continuous Functions International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 1, 43-50 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.714 Contra θ-c-continuous Functions C. W. Baker

More information

Restrained Weakly Connected Independent Domination in the Corona and Composition of Graphs

Restrained Weakly Connected Independent Domination in the Corona and Composition of Graphs Applied Mathematical Sciences, Vol. 9, 2015, no. 20, 973-978 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121046 Restrained Weakly Connected Independent Domination in the Corona and

More information

Secure Weakly Convex Domination in Graphs

Secure Weakly Convex Domination in Graphs Applied Mathematical Sciences, Vol 9, 2015, no 3, 143-147 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ams2015411992 Secure Weakly Convex Domination in Graphs Rene E Leonida Mathematics Department

More information

A Remark on Certain Filtrations on the Inner Automorphism Groups of Central Division Algebras over Local Number Fields

A Remark on Certain Filtrations on the Inner Automorphism Groups of Central Division Algebras over Local Number Fields International Journal of lgebra, Vol. 10, 2016, no. 2, 71-79 HIKRI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.612 Remark on Certain Filtrations on the Inner utomorphism Groups of Central

More information

On J(R) of the Semilocal Rings

On J(R) of the Semilocal Rings International Journal of Algebra, Vol. 11, 2017, no. 7, 311-320 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.61169 On J(R) of the Semilocal Rings Giovanni Di Gregorio Dipartimento di

More information

Closure operators on sets and algebraic lattices

Closure 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 information

Secure Weakly Connected Domination in the Join of Graphs

Secure Weakly Connected Domination in the Join of Graphs International Journal of Mathematical Analysis Vol. 9, 2015, no. 14, 697-702 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.519 Secure Weakly Connected Domination in the Join of Graphs

More information

Solvability of System of Generalized Vector Quasi-Equilibrium Problems

Solvability of System of Generalized Vector Quasi-Equilibrium Problems Applied Mathematical Sciences, Vol. 8, 2014, no. 53, 2627-2633 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43183 Solvability of System of Generalized Vector Quasi-Equilibrium Problems

More information

A Note on Finite Groups in which C-Normality is a Transitive Relation

A Note on Finite Groups in which C-Normality is a Transitive Relation International Mathematical Forum, Vol. 8, 2013, no. 38, 1881-1887 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.39168 A Note on Finite Groups in which C-Normality is a Transitive Relation

More information

Restrained Independent 2-Domination in the Join and Corona of Graphs

Restrained Independent 2-Domination in the Join and Corona of Graphs Applied Mathematical Sciences, Vol. 11, 2017, no. 64, 3171-3176 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.711343 Restrained Independent 2-Domination in the Join and Corona of Graphs

More information

The variety of commutative additively and multiplicatively idempotent semirings

The variety of commutative additively and multiplicatively idempotent semirings Semigroup Forum (2018) 96:409 415 https://doi.org/10.1007/s00233-017-9905-2 RESEARCH ARTICLE The variety of commutative additively and multiplicatively idempotent semirings Ivan Chajda 1 Helmut Länger

More information

Partial cubes: structures, characterizations, and constructions

Partial cubes: structures, characterizations, and constructions Partial cubes: structures, characterizations, and constructions Sergei Ovchinnikov San Francisco State University, Mathematics Department, 1600 Holloway Ave., San Francisco, CA 94132 Abstract Partial cubes

More information

Axioms of Countability in Generalized Topological Spaces

Axioms of Countability in Generalized Topological Spaces International Mathematical Forum, Vol. 8, 2013, no. 31, 1523-1530 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2013.37142 Axioms of Countability in Generalized Topological Spaces John Benedict

More information

Cross Connection of Boolean Lattice

Cross Connection of Boolean Lattice International Journal of Algebra, Vol. 11, 2017, no. 4, 171-179 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.7419 Cross Connection of Boolean Lattice P. G. Romeo P. R. Sreejamol Dept.

More information

Mappings of the Direct Product of B-algebras

Mappings of the Direct Product of B-algebras International Journal of Algebra, Vol. 10, 2016, no. 3, 133-140 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.615 Mappings of the Direct Product of B-algebras Jacel Angeline V. Lingcong

More information

Block-Transitive 4 (v, k, 4) Designs and Suzuki Groups

Block-Transitive 4 (v, k, 4) Designs and Suzuki Groups International Journal of Algebra, Vol. 10, 2016, no. 1, 27-32 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.51277 Block-Transitive 4 (v, k, 4) Designs and Suzuki Groups Shaojun Dai Department

More information

Multi-coloring and Mycielski s construction

Multi-coloring and Mycielski s construction Multi-coloring and Mycielski s construction Tim Meagher Fall 2010 Abstract We consider a number of related results taken from two papers one by W. Lin [1], and the other D. C. Fisher[2]. These articles

More information

Algebraic Models in Different Fields

Algebraic Models in Different Fields Applied Mathematical Sciences, Vol. 8, 2014, no. 167, 8345-8351 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.411922 Algebraic Models in Different Fields Gaetana Restuccia University

More information

On Pairs of Disjoint Dominating Sets in a Graph

On Pairs of Disjoint Dominating Sets in a Graph International Journal of Mathematical Analysis Vol 10, 2016, no 13, 623-637 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/1012988/ijma20166343 On Pairs of Disjoint Dominating Sets in a Graph Edward M Kiunisala

More information

Complete and Fuzzy Complete d s -Filter

Complete and Fuzzy Complete d s -Filter International Journal of Mathematical Analysis Vol. 11, 2017, no. 14, 657-665 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijma.2017.7684 Complete and Fuzzy Complete d s -Filter Habeeb Kareem

More information

VAUGHT S THEOREM: THE FINITE SPECTRUM OF COMPLETE THEORIES IN ℵ 0. Contents

VAUGHT 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 information

Kannan Fixed Point Theorem on Generalized Metric Space with a Graph

Kannan Fixed Point Theorem on Generalized Metric Space with a Graph Applied Mathematical Sciences, Vol. 3, 209, no. 6, 263-274 HIKARI Ltd, www.m-hikari.com https://doi.org/0.2988/ams.209.9226 Kannan Fixed Point Theorem on Generalized Metric Space with a Graph Karim Chaira

More information

International Journal of Algebra, Vol. 7, 2013, no. 3, HIKARI Ltd, On KUS-Algebras. and Areej T.

International Journal of Algebra, Vol. 7, 2013, no. 3, HIKARI Ltd,   On KUS-Algebras. and Areej T. International Journal of Algebra, Vol. 7, 2013, no. 3, 131-144 HIKARI Ltd, www.m-hikari.com On KUS-Algebras Samy M. Mostafa a, Mokhtar A. Abdel Naby a, Fayza Abdel Halim b and Areej T. Hameed b a Department

More information

Equiblocking Sets in K 2,2 -Designs and in K 3,3 -Designs

Equiblocking Sets in K 2,2 -Designs and in K 3,3 -Designs Applied Mathematical Sciences, Vol. 7, 013, no. 91, 4549-4557 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ams.013.36341 Equiblocking Sets in K, -Designs and in K 3,3 -Designs Mario Gionfriddo

More information

Finite homogeneous and lattice ordered effect algebras

Finite homogeneous and lattice ordered effect algebras Finite homogeneous and lattice ordered effect algebras Gejza Jenča Department of Mathematics Faculty of Electrical Engineering and Information Technology Slovak Technical University Ilkovičova 3 812 19

More information

β Baire Spaces and β Baire Property

β Baire Spaces and β Baire Property International Journal of Contemporary Mathematical Sciences Vol. 11, 2016, no. 5, 211-216 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2016.612 β Baire Spaces and β Baire Property Tugba

More information

On Strong Alt-Induced Codes

On Strong Alt-Induced Codes Applied Mathematical Sciences, Vol. 12, 2018, no. 7, 327-336 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.8113 On Strong Alt-Induced Codes Ngo Thi Hien Hanoi University of Science and

More information

On the Union of Graphs Ramsey Numbers

On the Union of Graphs Ramsey Numbers Applied Mathematical Sciences, Vol. 8, 2014, no. 16, 767-773 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.311641 On the Union of Graphs Ramsey Numbers I Wayan Sudarsana Combinatorial

More information

Regular Generalized Star b-continuous Functions in a Bigeneralized Topological Space

Regular Generalized Star b-continuous Functions in a Bigeneralized Topological Space International Journal of Mathematical Analysis Vol. 9, 2015, no. 16, 805-815 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2015.5230 Regular Generalized Star b-continuous Functions in a

More information

THE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS

THE EQUATIONAL THEORIES OF REPRESENTABLE RESIDUATED SEMIGROUPS TH QUATIONAL THORIS OF RPRSNTABL RSIDUATD SMIGROUPS SZABOLCS MIKULÁS Abstract. We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We

More information

Complete Ideal and n-ideal of B-algebra

Complete Ideal and n-ideal of B-algebra Applied Mathematical Sciences, Vol. 11, 2017, no. 35, 1705-1713 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2017.75159 Complete Ideal and n-ideal of B-algebra Habeeb Kareem Abdullah University

More information

Completeness of Star-Continuity

Completeness of Star-Continuity Introduction to Kleene Algebra Lecture 5 CS786 Spring 2004 February 9, 2004 Completeness of Star-Continuity We argued in the previous lecture that the equational theory of each of the following classes

More information

A Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers

A Characterization of the Cactus Graphs with Equal Domination and Connected Domination Numbers International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 7, 275-281 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7932 A Characterization of the Cactus Graphs with

More information

Solving Homogeneous Systems with Sub-matrices

Solving Homogeneous Systems with Sub-matrices Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State

More information

On Geometric Hyper-Structures 1

On Geometric Hyper-Structures 1 International Mathematical Forum, Vol. 9, 2014, no. 14, 651-659 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.312232 On Geometric Hyper-Structures 1 Mashhour I.M. Al Ali Bani-Ata, Fethi

More information

Introduction to generalized topological spaces

Introduction to generalized topological spaces @ Applied General Topology c Universidad Politécnica de Valencia Volume 12, no. 1, 2011 pp. 49-66 Introduction to generalized topological spaces Irina Zvina Abstract We introduce the notion of generalized

More information

MULTI-HYPERSUBSTITUTIONS AND COLOURED SOLID VARIETIES arxiv: v2 [math.ra] 29 Nov 2008

MULTI-HYPERSUBSTITUTIONS AND COLOURED SOLID VARIETIES arxiv: v2 [math.ra] 29 Nov 2008 MULTI-HYPERSUBSTITUTIONS AND COLOURED SOLID VARIETIES arxiv:0811.4764v2 [math.ra] 29 Nov 2008 K. DENECKE, J. KOPPITZ, SL. SHTRAKOV Abstract. Hypersubstitutions are mappings which map operation symbols

More information

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12

MATH 8253 ALGEBRAIC GEOMETRY WEEK 12 MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f

More information

Second Hankel Determinant Problem for a Certain Subclass of Univalent Functions

Second Hankel Determinant Problem for a Certain Subclass of Univalent Functions International Journal of Mathematical Analysis Vol. 9, 05, no. 0, 493-498 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/0.988/ijma.05.55 Second Hankel Determinant Problem for a Certain Subclass of Univalent

More information

Stat 451: Solutions to Assignment #1

Stat 451: Solutions to Assignment #1 Stat 451: Solutions to Assignment #1 2.1) By definition, 2 Ω is the set of all subsets of Ω. Therefore, to show that 2 Ω is a σ-algebra we must show that the conditions of the definition σ-algebra are

More information

On Bornological Divisors of Zero and Permanently Singular Elements in Multiplicative Convex Bornological Jordan Algebras

On Bornological Divisors of Zero and Permanently Singular Elements in Multiplicative Convex Bornological Jordan Algebras Int. Journal of Math. Analysis, Vol. 7, 2013, no. 32, 1575-1586 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2013.3359 On Bornological Divisors of Zero and Permanently Singular Elements

More information

Foundations of Mathematics

Foundations of Mathematics Foundations of Mathematics Andrew Monnot 1 Construction of the Language Loop We must yield to a cyclic approach in the foundations of mathematics. In this respect we begin with some assumptions of language

More information

Minimal Characteristic Algebras for Rectangular k-normal Identities

Minimal Characteristic Algebras for Rectangular k-normal Identities Algebra Colloquium 18 : 4 (2011) 611 628 Algebra Colloquium c 2011 AMSS CAS & SUZHOU UNIV Minimal Characteristic Algebras for Rectangular k-normal Identities K. Hambrook S.L. Wismath Department of Mathematics

More information

Locating-Dominating Sets in Graphs

Locating-Dominating Sets in Graphs Applied Mathematical Sciences, Vol. 8, 2014, no. 88, 4381-4388 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46400 Locating-Dominating Sets in Graphs Sergio R. Canoy, Jr. 1, Gina A.

More information

An Envelope for Left Alternative Algebras

An Envelope for Left Alternative Algebras International Journal of Algebra, Vol. 7, 2013, no. 10, 455-462 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.3546 An Envelope for Left Alternative Algebras Josef Rukavicka Department

More information

Reachability relations and the structure of transitive digraphs

Reachability relations and the structure of transitive digraphs Reachability relations and the structure of transitive digraphs Norbert Seifter Montanuniversität Leoben, Leoben, Austria seifter@unileoben.ac.at Vladimir I. Trofimov Russian Academy of Sciences, Ekaterinburg,

More information

arxiv: v2 [math.co] 30 Jun 2013

arxiv: v2 [math.co] 30 Jun 2013 A polynomial representation and a unique code of a simple undirected graph arxiv:1304.5847v2 [math.co] 30 Jun 2013 Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen Abstract In this note we introduce a representation

More information

Course 212: Academic Year Section 1: Metric Spaces

Course 212: Academic Year Section 1: Metric Spaces Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........

More information

The Hurewicz Theorem

The Hurewicz Theorem The Hurewicz Theorem April 5, 011 1 Introduction The fundamental group and homology groups both give extremely useful information, particularly about path-connected spaces. Both can be considered as functors,

More information

On the intersection of infinite matroids

On the intersection of infinite matroids On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of

More information

Fuzzy Sequences in Metric Spaces

Fuzzy Sequences in Metric Spaces Int. Journal of Math. Analysis, Vol. 8, 2014, no. 15, 699-706 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.4262 Fuzzy Sequences in Metric Spaces M. Muthukumari Research scholar, V.O.C.

More information

1. Quivers and their representations: Basic definitions and examples.

1. Quivers and their representations: Basic definitions and examples. 1 Quivers and their representations: Basic definitions and examples 11 Quivers A quiver Q (sometimes also called a directed graph) consists of vertices and oriented edges (arrows): loops and multiple arrows

More information

2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS

2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS Volume 7, Number 1, Pages 41 47 ISSN 1715-0868 2-GENERATED CAYLEY DIGRAPHS ON NILPOTENT GROUPS HAVE HAMILTONIAN PATHS DAVE WITTE MORRIS Abstract. Suppose G is a nilpotent, finite group. We show that if

More information

MULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES. 1. Introduction

MULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES. 1. Introduction Acta Math. Univ. Comenianae Vol. LXXIII, 2(2004), pp. 217 221 217 MULTIVARIATE BIRKHOFF-LAGRANGE INTERPOLATION SCHEMES AND CARTESIAN SETS OF NODES N. CRAINIC Abstract. In this paper we study the relevance

More information

Graceful Labeling for Complete Bipartite Graphs

Graceful Labeling for Complete Bipartite Graphs Applied Mathematical Sciences, Vol. 8, 2014, no. 103, 5099-5104 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46488 Graceful Labeling for Complete Bipartite Graphs V. J. Kaneria Department

More information

Hyers-Ulam-Rassias Stability of a Quadratic-Additive Type Functional Equation on a Restricted Domain

Hyers-Ulam-Rassias Stability of a Quadratic-Additive Type Functional Equation on a Restricted Domain Int. Journal of Math. Analysis, Vol. 7, 013, no. 55, 745-75 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.1988/ijma.013.394 Hyers-Ulam-Rassias Stability of a Quadratic-Additive Type Functional Equation

More information

Prime and Semiprime Bi-ideals in Ordered Semigroups

Prime and Semiprime Bi-ideals in Ordered Semigroups International Journal of Algebra, Vol. 7, 2013, no. 17, 839-845 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.310105 Prime and Semiprime Bi-ideals in Ordered Semigroups R. Saritha Department

More information

SUBLATTICES 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 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 information

Unary Automatic Graphs: An Algorithmic Perspective 1

Unary Automatic Graphs: An Algorithmic Perspective 1 Unary Automatic Graphs: An Algorithmic Perspective 1 This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of

More information

Weak Arithmetics and Kripke Models 1

Weak Arithmetics and Kripke Models 1 Weak Arithmetics and Kripke Models 1 Morteza Moniri Institute for Studies in Theoretical Physics and Mathematics P.O. Box 19395-5746, Tehran, Iran email: ezmoniri@ipm.ir Abstract In the first section of

More information

Jónsson posets and unary Jónsson algebras

Jó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 information

On Permutation Polynomials over Local Finite Commutative Rings

On Permutation Polynomials over Local Finite Commutative Rings International Journal of Algebra, Vol. 12, 2018, no. 7, 285-295 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2018.8935 On Permutation Polynomials over Local Finite Commutative Rings Javier

More information

On the Computation of the Adjoint Ideal of Curves with Ordinary Singularities

On the Computation of the Adjoint Ideal of Curves with Ordinary Singularities Applied Mathematical Sciences Vol. 8, 2014, no. 136, 6805-6812 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.49697 On the Computation of the Adjoint Ideal of Curves with Ordinary Singularities

More information

Topology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.

Topology 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 information

Join Reductions and Join Saturation Reductions of Abstract Knowledge Bases 1

Join Reductions and Join Saturation Reductions of Abstract Knowledge Bases 1 International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 3, 109-115 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7312 Join Reductions and Join Saturation Reductions

More information

Some Properties of a Semi Dynamical System. Generated by von Forester-Losata Type. Partial Equations

Some Properties of a Semi Dynamical System. Generated by von Forester-Losata Type. Partial Equations Int. Journal of Math. Analysis, Vol. 7, 2013, no. 38, 1863-1868 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2013.3481 Some Properties of a Semi Dynamical System Generated by von Forester-Losata

More information

Reachability relations and the structure of transitive digraphs

Reachability relations and the structure of transitive digraphs Reachability relations and the structure of transitive digraphs Norbert Seifter Montanuniversität Leoben, Leoben, Austria Vladimir I. Trofimov Russian Academy of Sciences, Ekaterinburg, Russia November

More information

Regular Weakly Star Closed Sets in Generalized Topological Spaces 1

Regular Weakly Star Closed Sets in Generalized Topological Spaces 1 Applied Mathematical Sciences, Vol. 9, 2015, no. 79, 3917-3929 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.53237 Regular Weakly Star Closed Sets in Generalized Topological Spaces 1

More information

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field

More information

Some Results About Generalized BCH-Algebras

Some Results About Generalized BCH-Algebras International Journal of Algebra, Vol. 11, 2017, no. 5, 231-246 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2017.712 Some Results About Generalized BCH-Algebras Muhammad Anwar Chaudhry 1

More information

Christopher J. TAYLOR

Christopher J. TAYLOR REPORTS ON MATHEMATICAL LOGIC 51 (2016), 3 14 doi:10.4467/20842589rm.16.001.5278 Christopher J. TAYLOR DISCRIMINATOR VARIETIES OF DOUBLE-HEYTING ALGEBRAS A b s t r a c t. We prove that a variety of double-heyting

More information

Generalized Boolean and Boolean-Like Rings

Generalized Boolean and Boolean-Like Rings International Journal of Algebra, Vol. 7, 2013, no. 9, 429-438 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.2894 Generalized Boolean and Boolean-Like Rings Hazar Abu Khuzam Department

More information

arxiv: v1 [math.ra] 1 Apr 2015

arxiv: v1 [math.ra] 1 Apr 2015 BLOCKS OF HOMOGENEOUS EFFECT ALGEBRAS GEJZA JENČA arxiv:1504.00354v1 [math.ra] 1 Apr 2015 Abstract. Effect algebras, introduced by Foulis and Bennett in 1994, are partial algebras which generalize some

More information

EQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED

EQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED EQUATIONS OF TOURNAMENTS ARE NOT FINITELY BASED J. Ježek, P. Marković, M. Maróti and R. McKenzie Abstract. The aim of this paper is to prove that there is no finite basis for the equations satisfied by

More information

Upper and Lower α I Continuous Multifunctions

Upper and Lower α I Continuous Multifunctions International Mathematical Forum, Vol. 9, 2014, no. 5, 225-235 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.311204 Upper and Lower α I Continuous Multifunctions Metin Akdağ and Fethullah

More information

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted

More information

r-ideals of Commutative Semigroups

r-ideals of Commutative Semigroups International Journal of Algebra, Vol. 10, 2016, no. 11, 525-533 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ija.2016.61276 r-ideals of Commutative Semigroups Muhammet Ali Erbay Department of

More information

Supra g-closed Sets in Supra Bitopological Spaces

Supra g-closed Sets in Supra Bitopological Spaces International Mathematical Forum, Vol. 3, 08, no. 4, 75-8 HIKARI Ltd, www.m-hikari.com https://doi.org/0.988/imf.08.8 Supra g-closed Sets in Supra Bitopological Spaces R. Gowri Department of Mathematics

More information

Decompositions of Balanced Complete Bipartite Graphs into Suns and Stars

Decompositions of Balanced Complete Bipartite Graphs into Suns and Stars International Journal of Contemporary Mathematical Sciences Vol. 13, 2018, no. 3, 141-148 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2018.8515 Decompositions of Balanced Complete Bipartite

More information

The Endomorphism Ring of a Galois Azumaya Extension

The Endomorphism Ring of a Galois Azumaya Extension International Journal of Algebra, Vol. 7, 2013, no. 11, 527-532 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2013.29110 The Endomorphism Ring of a Galois Azumaya Extension Xiaolong Jiang

More information

THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS

THE 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 information

Applications of Homotopy

Applications of Homotopy Chapter 9 Applications of Homotopy In Section 8.2 we showed that the fundamental group can be used to show that two spaces are not homeomorphic. In this chapter we exhibit other uses of the fundamental

More information

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010) http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product

More information

ON IMPLICATIONAL BASES OF CLOSURE SYSTEMS WITH UNIQUE CRITICAL SETS

ON IMPLICATIONAL BASES OF CLOSURE SYSTEMS WITH UNIQUE CRITICAL SETS ON IMPLICATIONAL BASES OF CLOSURE SYSTEMS WITH UNIQUE CRITICAL SETS K. ADARICHEVA AND J. B. NATION Abstract. We show that every optimum basis of a finite closure system, in D. Maier s sense, is also right-side

More information

Rainbow Connection Number of the Thorn Graph

Rainbow Connection Number of the Thorn Graph Applied Mathematical Sciences, Vol. 8, 2014, no. 128, 6373-6377 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.48633 Rainbow Connection Number of the Thorn Graph Yixiao Liu Department

More information

On the Power of Standard Polynomial to M a,b (E)

On the Power of Standard Polynomial to M a,b (E) International Journal of Algebra, Vol. 10, 2016, no. 4, 171-177 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.6214 On the Power of Standard Polynomial to M a,b (E) Fernanda G. de Paula

More information