Linear identities in graph algebras

Size: px
Start display at page:

Download "Linear identities in graph algebras"

Transcription

1 Comment.Math.Univ.Carolin. 50,1(2009) Linear identities in graph algebras Agata Pilitowska Abstract. Wefindthebasisofalllinearidentitieswhicharetrueinthevarietyofentropic graph algebras. We apply it to describe the lattice of all subvarieties of power entropic graph algebras. Keywords: graph algebra, linear identity, entropic algebra, equational basis, lattice of subvarieties, power algebra of subsets Classification: Primary 08B15, 03C05, 03C13, 08C10; Secondary 17D99, 08A05, 08A40, 08A62, 08A99 1. Introduction In 1979 Caroline Shallon introduced in her dissertation[9] algebras associated withgraphs.let G=(V, E)bea(undirected)graphwithaset V ofverticesand aset E V V ofedges. Itsgraphalgebra A(G)=(V {0}, )isagroupoid with the multiplication defined as follows: { x, if (x, y) E, x y:= 0, otherwise. C. Shallon proved that many finite graph algebras are nonfinitely based. Moreoveritwasshownin[4]thatagraphalgebra A(G)isfinitelybasedifandonlyif it is entropic. Inthispaperwefindalllinearidentitieswhicharetrueinthevarietyofentropic graph algebras. Some new linear identity(3.1) true in this variety is crucial for the final result. Linear identities play an important rôle in the theory of power algebras. Thepower(complexorglobal)algebraCmA=(P(A), F)ofanalgebra(A, F) isthefamily P(A)ofallnon-emptysubsetsof Awithcomplexoperationsgiven by f(a 1,...,A n ):= {f(a 1,..., a n ) a i A i }, where A 1,..., A n Aand f Fisan n-aryoperation. While working on this paper, the author was partially supported by the INTAS grant# and Statutory Grant of Warsaw University of Technology# 504G

2 12 A. Pilitowska Power algebras were studied by several authors, for instance by G. Grätzer andh.lakser[5],s.whitney[6],a.shafaat[8],c.brink[3],i.bošnjakand R. Madarász[2]. Complexoperationsmaypreservesomeofpropertiesof(A, F), butnotall identitiestruein(a, F)mustbesatisfiedinCmA. Forexample, thepower algebraofagroupisnotagainagroup[5].foranarbitraryvariety V,G.Grätzer and H. Lakser determined the identities satisfied by the variety generated by CmA,forA V.Theyappliedtheirresulttodescribeallsubvarietiesofpower algebras of lattices and groups[5]. They showed that there is exactly one nontrivial variety of power algebras of lattices and there are exactly three non-trivial varieties of power algebras of groups. Inthispaperweshowthatthelatticeofallsubvarietiesofthevarietygenerated by power algebras of entropic graph algebras has eight elements. In Section 2 we recall main known results concerning graph algebras. Section 3 is devoted to linear identities satisfied in entropic graph algebras. In the last Section 4 we present some theorems concerning identities satisfied by power algebras of sets and describe all subvarieties of power entropic graph algebras. Wesaythatanalgebra(A, F)isidempotent ifeachelement a Aformsa one-elementsubalgebraof(a, F).Analgebra(A, F)isentropic,ifeachoperation f Fasamappingfromadirectpowerofthealgebraintothealgebraisactually a homomorphism. Wecallaterm tlinear,ifeveryvariableoccursin tatmostonce.anidentity t uiscalledlinear,ifbothterms tand uarelinear.anidentity t uiscalled regular,if tand ucontainthesamevariables.thenotation t(x 1,..., x n )means thattheterm tcontainsnoothervariablesthan x 1,..., x n (butnotnecessarily all of them). In the case of groupoid terms we will use non-brackets notation, as follows: { (...((xx1 )x 2 )...)x n, n 1, xx 1 x 2... x n := x, n=0. 2. Graph algebras Foreachnaturalnumber n N,let P n denote n-vertexgraphsintheformof apathwithoutloops,and L n denote n-vertexgraphsintheformofapathwith loops, as in the diagrams: P n : 1 L n : n Forgraphs Gand H, G+Hwilldenotethedisjointunionof Gand H,with noedgesbetween Gand H.... n

3 Linear identities in graph algebras 13 Itisnotdifficulttoseethatthedirectproductoftwographalgebrasisnot necessarilyagraphalgebra. Sotheclassofallgraphalgebrasdoesnotforma variety.letusdenoteby V A(G) thevarietygeneratedbyagraphalgebra A(G). Aswasshownin[1],thevarietyofallentropicgraphalgebrasisgeneratedby thealgebra A(P 2 + L 2 ).Thefollowingidentities (2.1) (2.2) (2.3) (2.4) (2.5) (2.6) (2.7) (2.8) (2.9) xy xyy x(yz) xy(yz) xyz xzy xy x(yx) x(yzu) x(yz)(yu) x(y(zu)) x(yz)(uz) x(yz)(uv) x(yv)(uz) x(xy) x(yy) xx(yz) x(yy)(zz) formabasisfor V A(P2 +L 2 ).Itiseasytoseethattheentropiclaw (E) xy(zw) xz(yw). follows by the above identities: xy(zw) (2.4) x(yx)(zw) (2.7) x(yw)(zx) (2.3) x(zx)(yw) (2.4) xz(yw). The lattice of all subvarieties of the variety of entropic graph algebras was discussedin[1]anditisgiveninfigure1. T denotes the trivial variety, SL is the variety of semilattices, LZ is the variety ofleftzerobands(groupoidsdeterminedbyidentity xy x), LNisthevarietyof left normal bands idempotent semigroups satisfying the additional left-normal law(2.3), U 1 isthevarietydefinedbytwoidentities:(2.1)and (2.10) xx xy and U 2 isthevarietydefinedbyallidentities(2.1) (2.9)andadditionalone (2.11) xx x(yy).

4 14 A. Pilitowska V A(P2 +L 2 ) U 2 V A(P3 +L 1 ) V V A(P1 +L 2 ) A(P2 +L 1 ) V A(P3 ) V A(P2 ) U 1 V A(P1 +L 1 ) LN V A(P1 ) LZ SL T Figure 1 The remaining subvarieties of entropic graph algebras have the following basis: V A(P1 ) : xy uz; V A(P1 +L 1 ) : x(yz) (xy)z, xy yx, xy x(yy); V A(P1 +L 2 ) : (2.1) (2.9), x(yz) (xy)z; V A(P2 ) : (2.1) (2.9), xx yy, x(yz) z(yx); V A(P2 +L 1 ) : (2.1) (2.9), x(yz) z(yx); V A(P3 ) : (2.1) (2.9), xx yy; V A(P3 +L 1 ) : (2.1) (2.9), x(yy) y(xx). As it was proved in[1] using the regular identities(2.1) (2.9), every term in thevariety V A(P2 +L 2 ) maybeexpressedinoneofthestandardforms: (i) x, (ii) x 1 (x 1 x 1 )(x 2 x 2 )...(x n x n ), for n 1, (iii) x 1 (y 1 x 1 )(y 2 x 2 )...(y n x n ) (x 1 y 1 )(y 2 x 2 )...(y n x n ), for n 1,where {x 1,..., x n } {y 1,..., y n }=. Thevariables x 1,..., x n will bereferredtoasbottomand y 1,..., y n willbereferredtoastopvariables.

5 Linear identities in graph algebras 15 Theorem 2.1([1]). An identity p q is derivable from identities(2.1) (2.9) if andonlyifbothsidesoftheidentity p qhavethesamestandardform,the sameleftmostvariablesand(inthecaseoftype(iii))thesametopandbottom variables. 3. Linear identities in entropic graph algebras Inthissectionwewillfindalllinearidentitieswhicharetrueinthevariety V A(P2 +L 2 ). Firstweprovethatallentropicgraphalgebrassatisfysomelinear identity which plays an important rôle in this paper. Theorem 3.1. The following linear identity (3.1) x(y(zt)) xy(tz) issatisfiedinthevariety V A(P2 +L 2 ). Proof: x(y(zt)) (2.6) x(yz)(tz) (2.2) xy(yz)(tz) (E) xyt(yzz) (2.1) xyt(yz) (E) xyy(tz) (2.1) xy(tz). LetΣbethefollowingsetofidentities: (E) xy(zt) xz(yt), Σ: (2.3) xyz xzy, (3.1) x(y(zt)) xy(tz). Theseidentitiesarealllinearandregularandtheyholdinanyvarietyofentropic graph algebras. Moreover, the linear identity(3.1) also follows from Σ: x(yz)(tw) (E) xt(yzw) (2.3) xt(ywz) (E) x(yw)(tz). Wewillshowthatanylinearidentitytruein V A(P2 +L 2 ) isaconsequenceofσ. Before proving this fact we present a sequence of technical lemmas. Let n 1and πbeanypermutationoftheset {1,2,..., n}.byusingidentities from Σ repeatedly we obtain: (3.2) (3.3) (3.4) (xy 1 y 2... y n )(zt 1 t 2... t n ) xz(y 1 t 1 )...(y n t n )(by(e)), xy 1 y 2...y n xy π(1) y π(2)...y π(n) (by(2.3)), x(y(z 1 t 1 )(z 2 t 2 )...(z n t n )) xy(t 1 z 1 )(t 2 z 2 )...(t n z n )(by(3.1)).

6 16 A. Pilitowska Moreover, as it was proved in[1], the following identity follows by entropicity and identities(2.3) and(2.7): (3.5) xy 1...y k (y k+1 z 1 )...(y k+n z n ) xy π(1)... y π(k) (y π(k+1) z δ(1) )...(y π(k+n) z δ(n) ), where πisapermutationontheset {1,2,..., k+ n}and δisapermutationon theset {1,2,..., n}. Lemma 3.2. The following identities (3.6) (3.7) xy 1... y n x(y 1 x)(y 2 x)...(y n x), x(yz 1 z 2... z n ) x(yx)(yz 1 )(yz 2 )...(yz n ) holdinthevariety V A(P2 +L 2 ) forany n 1. Proof:Theproofof(3.6)goesbyinduction.For n=1,theidentity(3.6)follows by(2.4). Nowletusassumethat(3.6)istrueforsome n >1. Thenusing(2.3) and(2.4) we obtain xy 1... y n+1 x(y 1 x)(y 2 x)...(y n x)y n+1 (2.3) xy n+1 (y 1 x)(y 2 x)...(y n x) (2.4) x(y n+1 x)(y 1 x)(y 2 x)...(y n x) (2.3) x(y 1 x)(y 2 x)...(y n+1 x). The identity(3.7) follows directly by(3.6) and(3.4): x(yz 1 z 2... z n ) (3.6) x(y(z 1 y)(z 2 y)...(z n y)) (3.4) xy(yz 1 )...(yz n ) (2.4) x(yx)(yz 1 )...(yz n ). Lemma3.3. Let n, k 0.ThefollowingidentitiesfollowfromthesetΣ: (3.8) (3.9) (3.10) (3.11) x(y(t 1 t 2 z 1... z n )) xyz 1... z n (t 2 t 1 ), (x(y 1 y 2... y n ))(t 1 t 2 z 1... z k ) (x(y 1 y 2...y n z 1... z k ))(t 1 t 2 ), (x(ty 1... y n w))z (x(ty 1... y n ))(zw), (x(z 1 y 1... y n ))(z 2 w) (x(z 2 y 1... y n ))(z 1 w),

7 Linear identities in graph algebras 17 (3.12) (yy 1 y 2... y n )(zz 1 z 2... z k ) { (y(zz1... z k n ))(y 1 z k n+1 )...(y n z k ), if k > n 0 yy 1... y n k z(y n k+1 z 1 )...(y n z k ), if n k 0 (3.13) (x(z 1 y 1...y k ))(z 2 y k+1 )...(z n+1 y k+n ) (x(z π(1) y δ(1)... y δ(k) ))(z π(2) y δ(k+1) )...(z π(n+1) y δ(k+n) ), foranypermutation δontheset {1,2,..., k+ n}andanypermutation πonthe set {1,2,..., n+1}. Proof:1.For n=0,theidentity(3.8)followsby(3.1).if n >0,then x(y(t 1 t 2 z 1... z n 1 z n )) (3.1) (xy)(z n (t 1 t 2 z 1... z n 1 )). Byinductionon nand(3.3)weobtain (xy)(z n (t 1 t 2 z 1... z n 1 )) xyz n z 1... z n 1 (t 2 t 1 ) (3.3) xyz 1... z n (t 2 t 1 ). 2.For n=0and k=0,theidentity(3.9)isobvious.if n >0and k >0,then (x(y 1 y 2... y n ))(t 1 t 2 z 1... z k 1 z k ) (3.1) x(y 1 y 2...y n (z k (t 1 t 2 z 1...z k 1 ))) (3.3) x(y 1 (z k (t 1 t 2 z 1... z k 1 ))y 2... y n ). Using(3.8)weconcludethat y 1 (z k (t 1 t 2 z 1... z k 1 )) y 1 z k z 1...z k 1 (t 2 t 1 ).Thus x(y 1 (z k (t 1 t 2 z 1... z k 1 ))y 2... y n ) x(y 1 z k z 1... z k 1 (t 2 t 1 )y 2... y n ) (3.3) x(y 1 y 2...y n z 1...z k (t 2 t 1 )) (3.1) (x(y 1 y 2... y n z 1...z k ))(t 1 t 2 ). 3.For n=0,theidentity(3.10)followsby(2.3)andentropicity.if n >0,then (x(ty 1... y n w))z (2.3) (xz)(ty 1... y n w) (E) (x(ty 1... y n ))(zw). 4.For n=0,theidentity(3.11)followsbyentropicity.if n >0,then (x(z 1 y 1...y n ))(z 2 w) (2.3) (x(z 2 w))(z 1 y 1... y n ) (E) (x(z 1 y 1...y n 1 ))(z 2 wy n ). Byinductionon n,(2.3)and(2.7)weobtain (x(z 1 y 1... y n 1 ))(z 2 wy n ) (x(z 2 wy 1... y n 1 ))(z 1 y n ) (2.3) (x(z 2 y 1...y n 1 w))(z 1 y n ) (2.7) (x(z 2 y 1...y n ))(z 1 w). 5. The identity(3.12) follows directly by(3.2). 6. The identity(3.13) follows by(2.3),(2.7) and(3.11). Thenexttheoremdescribesalllineartermsinthevariety V A(P2 +L 2 ).

8 18 A. Pilitowska Theorem3.4. Everytermin V A(P2 +L 2 ) maybeexpressedinoneofthefollowing standard forms: (I1) (I2) xy 1...y k (t 1 w 1 )...(t n w n ), k 0, n 0; (x(y 1 y 2... y k ))(t 1 w 1 )...(t n w n ), k 2, n 0. Proof: Weshow(usingΣ)thatthesetoftermsoftheform(I1)and(I2)is closed under multiplication. (a)let γ xy 1...y k (t 1 w 1 )...(t n w n )and δ ab 1... b l (c 1 d 1 )...(c m d m ). By (3.3)and(3.4)wehave γδ [xy 1... y k (t 1 w 1 )...(t n w n )][ab 1... b l (c 1 d 1 )...(c m d m )] If l > k 0,then (3.3) xy 1... y k (ab 1...b l (c 1 d 1 )...(c m d m ))(t 1 w 1 )...(t n w n ) (3.4) ((xy 1... y k )(ab 1... b l ))(d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ). ((xy 1... y k )(ab 1... b l ))(d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ) (3.12) (x(ab 1... b l k ))(y 1 b l k+1 )...(y k b l )(d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ). Hence γδcanbewrittenintheform(i2). For k l 0, ((xy 1...y k )(ab 1... b l ))(d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ) (3.12) xy 1... y k l a(y k l+1 b 1 )...(y k b l )(d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ), and γδhastheform(i1). (b)let γ xy 1... y k (t 1 w 1 )...(t n w n )and δ (a(b 1 b 2... b l ))(c 1 d 1 )...(c m d m ) for l 2.Then γδ [xy 1... y k (t 1 w 1 )...(t n w n )][(a(b 1 b 2... b l ))(c 1 d 1 )...(c m d m )] (3.3) x((a(b 1 b 2...b l ))(c 1 d 1 )...(c m d m ))y 1...y k (t 1 w 1 )...(t n w n ) (3.4),(3.3) x(a(b 1 b 2... b l ))y 1... y k (d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ). By(3.8)wehavethat x(a(b 1 b 2... b l )) xab 3... b l (b 2 b 1 ).Consequently x(a(b 1 b 2...b l ))y 1...y k (d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ) xab 3... b l y 1... y k (b 2 b 1 )(d 1 c 1 )...(d m c m )(t 1 w 1 )...(t n w n ),

9 Linear identities in graph algebras 19 and γδisreducedtotheform(i1). (c)let γ (a(b 1 b 2...b l ))(c 1 d 1 )...(c m d m )and δ xy 1... y k (t 1 w 1 )...(t n w n ), for l 2.Then γδ [(a(b 1 b 2... b l ))(c 1 d 1 )...(c m d m )][xy 1... y k (t 1 w 1 )...(t n w n )] (3.3) (a(b 1 b 2... b l ))(xy 1...y k (t 1 w 1 )...(t n w n ))(c 1 d 1 )...(c m d m ) (3.4) (a(b 1 b 2... b l ))(xy 1...y k )(w 1 t 1 )...(w n t n )(c 1 d 1 )...(c m d m ). If k=0,thenby(3.10) γδ (a(b 1 b 2...b l 1 ))(xb l )(w 1 t 1 )...(w n t n )(c 1 d 1 )...(c m d m ). If k 1,thenby(3.9)wehave It follows that (a(b 1 b 2... b l ))(xy 1... y k ) (3.9) (a(b 1 b 2... b l y 2...y k ))(xy 1 ). (a(b 1 b 2... b l ))(xy 1... y k )(w 1 t 1 )...(w n t n )(c 1 d 1 )...(c m d m ) (a(b 1 b 2... b l y 2...y k ))(xy 1 )(w 1 t 1 )...(w n t n )(c 1 d 1 )...(c m d m ). Hence,forany k 0, γδmaybereducedtotheform(i2). (d) Let γ (x(y 1 y 2... y k ))(t 1 w 1 )...(t n w n ) and δ (a(b 1 b 2... b l ))(c 1 d 1 )... (c m d m ),for k, l 2.By(3.4)and(E),wehave γδ [(x(y 1 y 2... y k ))(t 1 w 1 )...(t n w n )][(a(b 1 b 2...b l ))(c 1 d 1 )...(c m d m )] (3.4) (x((y 1...y k )(w 1 t 1 )...(w n t n )))(a((b 1 b 2...b l )(d 1 c 1 )...(d m c m ))) (E) xa(((y 1... y k )(w 1 t 1 )...(w n t n ))((b 1 b 2...b l )(d 1 c 1 )...(d m c m ))). Thusby(a)and(b),alsointhiscase, γδreducestotherequiredform. Proposition3.5. ThesetΣisabasisforalllinearidentitiestrueinthevariety of entropic graph algebras. Proof:Accordingtoresultsof[1],eachidentitywhichissatisfiedin V A(P2 +L 2 ) isregular. Let p q be linearandregularidentitytruein V A(P2 +L 2 ). By Theorem3.4,theterms pand qareinoneofthetwostandardforms. Case 1. Let pand qbeoftype(i1). Therearedistinctvariables {x, y 1,..., y k, y k+1..., y k+n, z 1,..., z n }={a, b 1,..., b l, b l+1,..., b l+m, c 1,..., c m },such that p xy 1...y k (y k+1 z 1 )...(y k+n z n )

10 20 A. Pilitowska and By(3.6), and q ab 1...b l (b l+1 c 1 )...(b l+m c m ). p x(y 1 x)...(y k x)(y k+1 z 1 )...(y k+n z n ) q a(b 1 a)...(b l a)(b l+1 c 1 )...(b l+m c m ). ByTheorem2.1,theidentity p qissatisfiedin V A(P2 +L 2 ) ifandonlyif x=a, {x, z 1,..., z n } = {a, c 1,..., c m }and {y 1,..., y k+n } = {b 1,..., b l+m }. This impliesthat n=m, k= landtherearepermutations πon {1,2,..., k+ n}and δon {1,2,..., n}suchthat q xy π(1)... y π(k) (y π(k+1) z δ(1) )...(y π(k+n) z δ(n) ). Consequently, by identity(3.5), the identity p q follows from Σ. Case2.Let pand qbeoftype(i2).therearedistinctvariables {x, z 1,..., z n+1, y 1,..., y k+n }={a, b 1,..., b l, b m+1, c 1,..., c l+m },suchthat and k, l 2. By the identity(3.7), p (x(z 1 y 1... y k ))(z 2 y k+1 )...(z n+1 y k+n ), q (a(b 1 c 1... c l ))(b 2 c l+1 )...(b m+1 c l+m ), p x(z 1 x)(z 1 y 1 )...(z 1 y k )(z 2 y k+1 )...(z n+1 y k+n ) and q a(b 1 a)(b 1 c 1 )...(b 1 c l )(b 2 c l+1 )...(b m+1 c l+m ). ByTheorem2.1,theidentity p qissatisfiedin V A(P2 +L 2 ) ifandonlyif x= a, {x, y 1,..., y k+n }={a, c 1,..., c l+m }and {z 1,..., z n+1 }={b 1,..., b m+1 }. Thisimpliesthat n=m, k= landtherearepermutations δon {1,2,..., k+ n} and πon {1,2,..., n+1}suchthat q (x(z π(1) y δ(1)...y δ(k) ))(z π(2) y δ(k+1) )...(z π(n+1) y δ(k+n) ). Hence,byidentity(3.13),theidentity p qfollowsfromσ. Case3.Let pbeoftype(i1)and qbeoftype(i2).asbefore, p xy 1...y k (y k+1 z 1 )...(y k+n z n )

11 Linear identities in graph algebras 21 and q (a(b 1 c 1... c l ))(b 2 c l+1 )...(b m+1 c l+m ), where {x, z 1,..., z n, y 1,..., y k+n }={a, b 1,..., b m+1, c 1,..., c l+m }and l 2. SimilarlyasinCase1andCase2,theidentities(3.6),(3.7)andTheorem2.1 implythattheidentity p q issatisfiedin V A(P2 +L 2 ) ifandonlyif x=a, {x, z 1,..., z n } = {a, c 1,..., c l+m }and {y 1,..., y k+n } = {b 1,..., b m+1 }. It followsthat n=m+land m+1=k+n.hence k+l=1.butweassumedthat l 2,sothisgivesacontradiction. Thisshowsthatanylinearidentityholdingin V A(P2 +L 2 ) isaconsequenceofσ. 4. The variety of power entropic graph algebras Usingtheresultoftheprevioussectionwewilldescribethelatticeofallsubvarieties of power entropic graph algebras. Let Vbeavariety. WewilldenotebyCmVthevarietygeneratedbypower algebras of algebras in V, i.e., CmV:=HSP({CmA A V}). Evidently, V CmV,becauseeveryalgebraAin V embedsintocmaby x {x}.g.grätzerandh.lakserprovedthefollowingtheorem. Theorem 4.1([5]). Let V be a variety. The variety CmV satisfies precisely those identities resulting through identification of variables from the linear identities truein V. Forexample,anidempotentlawissatisfiedinthevarietyCmVifandonlyif itisaconsequenceoflinearidentitiestruein V. As an immediate corollary of the Theorem 4.1 we have the following result. Corollary4.2([5]). Foravariety V,CmV= Vifandonlyif Visdefinedbya set of linear identities. AsitwasshowninSection3,anylinearidentitytruein V A(P2 +L 2 ) isderivable fromthesetσ.hence,bytheorem4.1,weobtainthefollowingresult. Proposition4.3. CmV A(P2 +L 2 ) =Mod(Σ). Similarlyasinthecaseofthevariety V A(P2 +L 2 ) wecanshowthatvarieties CmV A(P3 ),CmU 2andCmV A(P3 +L 1 ) arealsodefinedbythesetσ. Now we will give a description of varieties generated by power algebras from remainingsubvarietiesof V A(P2 +L 2 ).Thevarieties T, LZand V A(P 1 ) aredefined onlybylinearidentities.hencebycorollary4.2,cmt = T,CmLZ= LZand CmV A(P1 ) = V A(P 1 ).

12 22 A. Pilitowska Thevarieties SLand V A(P1 +L 1 ) satisfyassociativityandcommutativity. Hence,CmSL=CmV A(P1 +L 1 ) isthevariety CSofcommutativesemigroups. Itiseasytoseethatbyleft-normallaw(2.3)andassociativity,alinearregular identity p qistrueinthevariety LNor V A(P1 +L 2 ) ifandonlyifterms pand qhavethesameleftmostvariable.thisimpliesthatcmln=cmv A(P1 +L 2 ) is the variety LS of left-normal semigroups. Moreover,thevariety U 1 satisfiestheassociativelaw. Thisimpliesthateach linearidentityin U 1 isaconsequenceoftheidentity xy xzandassociativity. HenceCmU 1 coincideswiththevariety USdefinedby xy xzandassociativity. Now let us consider the following linear identity: (4.1) x(yz) z(yx). Itisnotdifficulttoseethattheidentity(3.1)isaconsequenceofentropicity, left-normality and the identity(4.1): x(y(zt)) (4.1) zt(yx) (2.3) z(yx)t (4.1) x(yz)t (2.3) xt(yz) (E) xy(tz). LetΓbethefollowingsetofidentities: Γ: Lemma4.4. For n 1,theidentity (E) xy(zt) xz(yt), (2.3) xyz xzy, (4.1) x(yz) z(yx). x 1 y 1 (y 2 x 2 )...(y n x n ) x π(1) y δ(1) (y δ(2) x π(2) )...(y δ(n) x π(n) ) followsfromthesetγforanypermutations πand δoftheset {1,2,..., n}. Proof: This follows directly by(3.5) and(4.1). Theorem4.5. Anylinearidentityholdinginthevariety V A(P2 +L 1 ) isaconsequenceofthesetγ. Proof:UsingthesamemethodsasinproofsofTheorem3.4andProposition3.5 weobtainthateachlinearregularidentitytruein V A(P2 +L 1 ) isoneofthetwo following types: x 1 y 1... y k (y k+1 x 2 )...(y n+k x n+1 ) x δ(1) y π(1)...y π(k) (y π(k+1) x δ(2) )...(y π(n+k) x δ(n+1) ),

13 Linear identities in graph algebras 23 foranypermutation πontheset {1,..., n+k}andanypermutation δonthe set {1,..., n+1},or (x 1 (y 1 x 2...x k ))(y 2 x k+1 )...(y n+1 x k+n ) (x δ(1) (y π(1) x δ(2)...x δ(k) ))(y π(2) x δ(k+1) )...(y π(n+1) x δ(k+n) ), foranypermutation πontheset {1,..., n+1}andanypermutation δonthe set {1,..., n+k}. By identities(3.5),(3.13),(4.1) and(4.2), both follow from Γ. Similarly,wecanshowthatanylinearidentitytruein V A(P2 ) isalsoaconsequence of Γ. All these observations prove the following proposition. Proposition 4.6. There are eight varieties of power entropic graph algebras: CmV A(P2 +L 2 ) =CmV A(P 3 ) =CmU 2=CmV A(P3 +L 1 ) =Mod(Σ) CmV A(P2 +L 1 ) =CmV A(P 2 ) =Mod(Γ) CmLN=CmV A(P1 +L 2 ) = LS=Mod(xyz xzy, xyz x(yz)) CmSL=CmV A(P1 +L 1 ) = CS=Mod(xy yx, xyz x(yz)) CmU 1 = US=Mod(xy xz, xyz x(yz)) CmV A(P1 ) = V A(P 1 ) =Mod(xy uz) CmLZ= LZ=Mod(xy x) CmT = T =Mod(x y) ThelatticeofallsubvarietiesofCmV A(P2 +L 2 ) isgiveninfigure2: Mod(Σ) Mod(Γ) LS CS US V A(P1 ) LZ T Figure 2

14 24 A. Pilitowska References [1] Baker K.A., McNulty G.F., Werner H., The finitely based varieties of graph algebras, Acta Sci. Math.(Szeged) 51(1987), [2] Bošnjak I., Madarász R., On power structures, Algebra Discrete Math. 2(2003), [3] Brink C., Power structures, Algebra Universalis 30(1993), [4] Davey B.A., Idziak P.H., Lampe W.A., McNulty G.F., Dualizability and graph algebras, Discrete Math. 214(2000), [5] Grätzer G., Lakser H., Identities for globals(complex algebras) of algebras, Colloq. Math. 56(1988), [6] Grätzer G., Whitney S., Infinitary varieties of structures closed under the formation of complex structures, Colloq. Math. 48(1984), [7] McNulty G.F., Shallon C., Inherently nonfinitely based finite algebras, R. Freese, O. Garcia (Eds.), Universal Algebra and Lattice Theory(Puebla, 1982), Lecture Notes in Mathematics, 1004, Springer, Berlin, 1983, pp [8] Shafaat A., On varieties closed under the construction of power algebras, Bull. Austral. Math. Soc. 11(1974), [9] Shallon C.R., Nonfinitely based binary algebras derived from lattices, Ph.D. Thesis, University of California at Los Angeles, Faculty of Mathematics and Information Science, Warsaw University of Technology, Plac Politechniki 1, Warsaw, Poland apili@mini.pw.edu.pl URL: apili (Received May 23, 2008)

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

arxiv:math/ v1 [math.ra] 27 Oct 2006

arxiv:math/ v1 [math.ra] 27 Oct 2006 ON COMPLEX ALGEBRAS OF SUBALGEBRAS arxiv:math/0610832v1 [math.ra] 27 Oct 2006 KIRA ADARICHEVA, AGATA PILITOWSKA, AND DAVID STANOVSKÝ Abstract. Let V be a variety of algebras. We establish a condition (so

More information

ON SOME CONGRUENCES OF POWER ALGEBRAS

ON SOME CONGRUENCES OF POWER ALGEBRAS ON SOME CONGRUENCES OF POWER ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. In a natural way we can lift any operation defined on a set A to an operation on the set of all non-empty subsets

More information

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

Varieties generated by modes of submodes

Varieties generated by modes of submodes Algebra Univers. 68 (2012) 221 236 DOI 10.1007/s00012-012-0201-4 Published online October 17, 2012 2012 The Author(s) Algebra Universalis This article is published with open access at Springerlink.com

More information

The Lattice of Subvarieties of Semilattice Ordered Algebras

The Lattice of Subvarieties of Semilattice Ordered Algebras Order (2014) 31:217 238 DOI 10.1007/s11083-013-9297-1 The Lattice of Subvarieties of Semilattice Ordered Algebras A. Pilitowska A. Zamojska-Dzienio Received: 27 September 2012 / Accepted: 30 May 2013 /

More information

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any

A DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»

More information

IMPLICATION ALGEBRAS

IMPLICATION ALGEBRAS Discussiones Mathematicae General Algebra and Applications 26 (2006 ) 141 153 IMPLICATION ALGEBRAS Ivan Chajda Department of Algebra and Geometry Palacký University of Olomouc Tomkova 40, 779 00 Olomouc,

More information

370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea

370 Y. B. Jun generate an LI-ideal by both an LI-ideal and an element. We dene a prime LI-ideal, and give an equivalent condition for a proper LI-idea J. Korean Math. Soc. 36 (1999), No. 2, pp. 369{380 ON LI-IDEALS AND PRIME LI-IDEALS OF LATTICE IMPLICATION ALGEBRAS Young Bae Jun Abstract. As a continuation of the paper [3], in this paper we investigate

More information

Realizations of Loops and Groups defined by short identities

Realizations of Loops and Groups defined by short identities Comment.Math.Univ.Carolin. 50,3(2009) 373 383 373 Realizations of Loops and Groups defined by short identities A.D. Keedwell Abstract. In a recent paper, those quasigroup identities involving at most three

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

Semigroup, monoid and group models of groupoid identities. 1. Introduction

Semigroup, monoid and group models of groupoid identities. 1. Introduction Quasigroups and Related Systems 16 (2008), 25 29 Semigroup, monoid and group models of groupoid identities Nick C. Fiala Abstract In this note, we characterize those groupoid identities that have a (nite)

More information

Axioms of Kleene Algebra

Axioms of Kleene Algebra Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.

More information

arxiv: v1 [math.ra] 3 Oct 2009

arxiv: v1 [math.ra] 3 Oct 2009 ACTOR OF AN ALTERNATIVE ALGEBRA J.M. CASAS, T. DATUASHVILI, AND M. LADRA arxiv:0910.0550v1 [math.ra] 3 Oct 2009 Abstract. We define a category galt of g-alternative algebras over a field F and present

More information

REGULAR IDENTITIES IN LATTICES

REGULAR IDENTITIES IN LATTICES TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 158, Number 1, July 1971 REGULAR IDENTITIES IN LATTICES BY R. PADMANABHANC) Abstract. An algebraic system 3i = is called a quasilattice

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

13. LECTURE 13. Objectives

13. LECTURE 13. Objectives 13. LECTURE 13 Objectives I can use Clairaut s Theorem to make my calculations easier. I can take higher derivatives. I can check if a function is a solution to a partial differential equation. Higher

More information

An extension of Willard s Finite Basis Theorem: Congruence meet-semidistributive varieties of finite critical depth

An extension of Willard s Finite Basis Theorem: Congruence meet-semidistributive varieties of finite critical depth An extension of Willard s Finite Basis Theorem: Congruence meet-semidistributive varieties of finite critical depth Kirby A. Baker, George F. McNulty, and Ju Wang In Celebration of the Sixtieth Birthday

More information

arxiv: v1 [math.ra] 25 May 2013

arxiv: v1 [math.ra] 25 May 2013 Quasigroups and Related Systems 20 (2012), 203 209 Congruences on completely inverse AG -groupoids Wieslaw A. Dudek and Roman S. Gigoń arxiv:1305.6858v1 [math.ra] 25 May 2013 Abstract. By a completely

More information

Boolean Algebra CHAPTER 15

Boolean Algebra CHAPTER 15 CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an

More information

On the Complete Join of Permutative Combinatorial Rees-Sushkevich Varieties

On the Complete Join of Permutative Combinatorial Rees-Sushkevich Varieties International Journal of Algebra, Vol. 1, 2007, no. 1, 1 9 On the Complete Join of Permutative Combinatorial Rees-Sushkevich Varieties Edmond W. H. Lee 1 Department of Mathematics, Simon Fraser University

More information

Octonions. Robert A. Wilson. 24/11/08, QMUL, Pure Mathematics Seminar

Octonions. Robert A. Wilson. 24/11/08, QMUL, Pure Mathematics Seminar Octonions Robert A. Wilson 4//08, QMUL, Pure Mathematics Seminar Introduction This is the second talk in a projected series of five. I shall try to make them as independent as possible, so that it will

More information

Periodic lattice-ordered pregroups are distributive

Periodic lattice-ordered pregroups are distributive Periodic lattice-ordered pregroups are distributive Nikolaos Galatos and Peter Jipsen Abstract It is proved that any lattice-ordered pregroup that satisfies an identity of the form x lll = x rrr (for the

More information

A CLASS OF LOOPS CATEGORICALLY ISOMORPHIC TO UNIQUELY 2-DIVISIBLE BRUCK LOOPS

A CLASS OF LOOPS CATEGORICALLY ISOMORPHIC TO UNIQUELY 2-DIVISIBLE BRUCK LOOPS A CLASS OF LOOPS CATEGORICALLY ISOMORPHIC TO UNIQUELY 2-DIVISIBLE BRUCK LOOPS MARK GREER Abstract. We define a new variety of loops we call Γ-loops. After showing Γ-loops are power associative, our main

More information

ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES

ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES italian journal of pure and applied mathematics n. 32 2014 (561 578) 561 ON HOW TO CONSTRUCT LEFT SEMIMODULES FROM THE RIGHT ONES Barbora Batíková Department of Mathematics CULS Kamýcká 129, 165 21 Praha

More information

Demonstration of the Coupled Evolution Rules 163 APPENDIX F: DEMONSTRATION OF THE COUPLED EVOLUTION RULES

Demonstration of the Coupled Evolution Rules 163 APPENDIX F: DEMONSTRATION OF THE COUPLED EVOLUTION RULES Demonstration of the Coupled Evolution Rules 163 APPENDIX F: DEMONSTRATION OF THE COUPLED EVOLUTION RULES Before going into the demonstration we need to point out two limitations: a. It assumes I=1/2 for

More information

SEMIRINGS SATISFYING PROPERTIES OF DISTRIBUTIVE TYPE

SEMIRINGS SATISFYING PROPERTIES OF DISTRIBUTIVE TYPE proceedings of the american mathematical society Volume 82, Number 3, July 1981 SEMIRINGS SATISFYING PROPERTIES OF DISTRIBUTIVE TYPE ARIF KAYA AND M. SATYANARAYANA Abstract. Any distributive lattice admits

More information

1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices.

1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices. 1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices. Proof: Every vertex, except the root, is the child of an internal vertex. Since there are i internal vertices, each of

More information

LOOPS OF BOL-MOUFANG TYPE WITH A SUBGROUP OF INDEX TWO

LOOPS OF BOL-MOUFANG TYPE WITH A SUBGROUP OF INDEX TWO LOOPS OF BOL-MOUFANG TYPE WITH A SUBGROUP OF INDEX TWO MICHAEL K. KINYON, J. D. PHILLIPS, AND PETR VOJTĚCHOVSKÝ Abstract. We describe all constructions for loops of Bol-Moufang type analogous to the Chein

More information

The least element is 0000, the greatest element is 1111.

The least element is 0000, the greatest element is 1111. Note: this worksheet has been modified to emphasize the Boolean algebra content. Some problems have been deleted.; this, for instance, is why the first problem is #5 rather than #1. 5. Let A be the set

More information

On atoms in BCC-algebras

On atoms in BCC-algebras Discussiones Mathematicae ser. Algebra and Stochastic Methods 15 (1995), 81 85 On atoms in BCC-algebras Wies law A. DUDEK and Xiaohong ZHANG Abstract We characterize the the set of all atoms of a BCC-algebra

More information

ON 2-ABSORBING PRIMARY AND WEAKLY 2-ABSORBING ELEMENTS IN MULTIPLICATIVE LATTICES

ON 2-ABSORBING PRIMARY AND WEAKLY 2-ABSORBING ELEMENTS IN MULTIPLICATIVE LATTICES italian journal of pure and applied mathematics n. 34 2015 (263 276) 263 ON 2-ABSORBING PRIMARY AND WEAKLY 2-ABSORBING ELEMENTS IN MULTIPLICATIVE LATTICES Fethi Çallialp Beykent University Faculty of Science

More information

Question: 1. Use suitable identities to find the following products:

Question: 1. Use suitable identities to find the following products: CH-2 Polynomial Question: 1. Use suitable identities to find the following products: (i) (x + 4) (x + 10) Solution:- (x+4)(x+10) = x 2 +10x+4x+4 x 10 = x 2 +14x+40 (ii) (x + 8) (x 10) Solution: x 2-10x+8x-80

More information

1. A polynomial p(x) in one variable x is an algebraic expression in x of the form

1. A polynomial p(x) in one variable x is an algebraic expression in x of the form POLYNOMIALS Important Points 1. A polynomial p(x) in one variable x is an algebraic expression in x of the form p(x) = a nx n +a n-1x n-1 + a 2x 2 +a 1x 1 +a 0x 0 where a 0, a 1, a 2 a n are constants

More information

Levi s Commutator Theorems for Cancellative Semigroups

Levi s Commutator Theorems for Cancellative Semigroups Levi s Commutator Theorems for Cancellative Semigroups R. Padmanabhan W. McCune R. Veroff Abstract A conjecture of Padmanabhan, on provability in cancellative semigroups, is addressed. Several of Levi

More information

FREE STEINER LOOPS. Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia

FREE STEINER LOOPS. Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia GLASNIK MATEMATIČKI Vol. 36(56)(2001), 85 93 FREE STEINER LOOPS Smile Markovski, Ana Sokolova Faculty of Sciences and Mathematics, Republic of Macedonia Abstract. A Steiner loop, or a sloop, is a groupoid

More information

Loops of Bol-Moufang type with a subgroup of index two

Loops of Bol-Moufang type with a subgroup of index two BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Number 2(45), 2004, Pages 1 17 ISSN 1024 7696 Loops of Bol-Moufang type with a subgroup of index two M. K. Kinyon, J. D. Phillips, and P.

More information

Course 2BA1: Hilary Term 2007 Section 8: Quaternions and Rotations

Course 2BA1: Hilary Term 2007 Section 8: Quaternions and Rotations Course BA1: Hilary Term 007 Section 8: Quaternions and Rotations David R. Wilkins Copyright c David R. Wilkins 005 Contents 8 Quaternions and Rotations 1 8.1 Quaternions............................ 1 8.

More information

SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS

SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS SYNTACTIC SEMIGROUP PROBLEM FOR THE SEMIGROUP REDUCTS OF AFFINE NEAR-SEMIRINGS OVER BRANDT SEMIGROUPS JITENDER KUMAR AND K. V. KRISHNA Abstract. The syntactic semigroup problem is to decide whether a given

More information

Arithmetic Analogues of Derivations

Arithmetic Analogues of Derivations JOURNAL OF ALGEBRA 198, 9099 1997 ARTICLE NO. JA977177 Arithmetic Analogues of Derivations Alexandru Buium Department of Math and Statistics, Uniersity of New Mexico, Albuquerque, New Mexico 87131 Communicated

More information

ON VARIETIES OF LEFT DISTRIBUTIVE LEFT IDEMPOTENT GROUPOIDS

ON VARIETIES OF LEFT DISTRIBUTIVE LEFT IDEMPOTENT GROUPOIDS ON VARIETIES OF LEFT DISTRIBUTIVE LEFT IDEMPOTENT GROUPOIDS DAVID STANOVSKÝ Abstract. We describe a part of the lattice of subvarieties of left distributive left idempotent groupoids (i.e. those satisfying

More information

Classifying Bol-Moufang Quasigroups Under a Single Operation

Classifying Bol-Moufang Quasigroups Under a Single Operation Classifying Bol-Moufang Quasigroups Under a Single Operation Ashley Arp Jasmine Van Exel Michael Kaminski Davian Vernon Black Hills State University Paine College Knox College Morehouse College Abstract

More information

BOOLEAN ALGEBRA TRUTH TABLE

BOOLEAN ALGEBRA TRUTH TABLE BOOLEAN ALGEBRA TRUTH TABLE Truth table is a table which represents all the possible values of logical variables / statements along with all the possible results of the given combinations of values. Eg:

More information

RIGHT PRODUCT QUASIGROUPS AND LOOPS

RIGHT PRODUCT QUASIGROUPS AND LOOPS RIGHT PRODUCT QUASIGROUPS AND LOOPS MICHAEL K. KINYON, ALEKSANDAR KRAPEŽ, AND J. D. PHILLIPS Abstract. Right groups are direct products of right zero semigroups and groups and they play a significant role

More information

CHAPTER 3 BOOLEAN ALGEBRA

CHAPTER 3 BOOLEAN ALGEBRA CHAPTER 3 BOOLEAN ALGEBRA (continued) This chapter in the book includes: Objectives Study Guide 3.1 Multiplying Out and Factoring Expressions 3.2 Exclusive-OR and Equivalence Operations 3.3 The Consensus

More information

On the variety generated by planar modular lattices

On the variety generated by planar modular lattices On the variety generated by planar modular lattices G. Grätzer and R. W. Quackenbush Abstract. We investigate the variety generated by the class of planar modular lattices. The main result is a structure

More information

Cheban loops. 1 Introduction

Cheban loops. 1 Introduction Ashdin Publishing Journal of Generalized Lie Theory and Applications Vol. 4 (2010), Article ID G100501, 5 pages doi:10.4303/jglta/g100501 Cheban loops J. D. Phillips a and V. A. Shcherbacov b a Department

More information

Boolean Algebra. Examples: (B=set of all propositions, or, and, not, T, F) (B=2 A, U,, c, Φ,A)

Boolean Algebra. Examples: (B=set of all propositions, or, and, not, T, F) (B=2 A, U,, c, Φ,A) Boolean Algebra Definition: A Boolean Algebra is a math construct (B,+,.,, 0,1) where B is a non-empty set, + and. are binary operations in B, is a unary operation in B, 0 and 1 are special elements of

More information

Algebras inspired by the equivalential calculus

Algebras inspired by the equivalential calculus Algebras inspired by the equivalential calculus Wies law A. DUDEK July 8, 1998 Abstract The equivalential calculus was introduced by Leśniewski in his paper on the protothetic [8]. Such logical system

More information

IDEMPOTENT n-permutable VARIETIES

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

Derivations on Trellises

Derivations on Trellises Journal of Applied & Computational Mathematics Journal of Applied & Computational Mathematics Ebadi and Sattari, J Appl Computat Math 2017, 7:1 DOI: 104172/2168-96791000383 Research Article Open Access

More information

Common idempotents in compact left topological left semirings

Common idempotents in compact left topological left semirings arxiv:1002.1599v1 [math.gn] 8 Feb 2010 Common idempotents in compact left topological left semirings Denis I. Saveliev 24 January 2010, Muscat ICAA A classical result of topological algebra states that

More information

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev E&CE 223 Digital Circuits & Systems Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev 4 of 92 Section 2: Boolean Algebra & Logic Gates Major topics Boolean algebra NAND & NOR gates Boolean

More information

Polynomials as Generators of Minimal Clones

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

Finite Simple Abelian Algebras are Strictly Simple

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

BOOLEAN ALGEBRA 1. DEFINITION

BOOLEAN ALGEBRA 1. DEFINITION 9 BOOLEAN ALGEBRA 1. DEFINITION A Boolean algebra is an algebraic structure which consists of a non empty set B, equipped with two binary operations (denoted by and or + and or * and o), one unary operation

More information

Chapter-2 BOOLEAN ALGEBRA

Chapter-2 BOOLEAN ALGEBRA Chapter-2 BOOLEAN ALGEBRA Introduction: An algebra that deals with binary number system is called Boolean Algebra. It is very power in designing logic circuits used by the processor of computer system.

More information

arxiv: v1 [math.gr] 10 Sep 2018

arxiv: v1 [math.gr] 10 Sep 2018 THE LATTICE OF VARIETIES OF IMPLICATION SEMIGROUPS SERGEY V. GUSEV, HANAMANTAGOUDA P. SANKAPPANAVAR, AND BORIS M. VERNIKOV arxiv:1809.03148v1 [math.gr] 10 Sep 2018 Abstract. An implication semigroup is

More information

A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY

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

Relations of Centralizers on Semiprime Semirings

Relations of Centralizers on Semiprime Semirings International Journal of Mathematics Research. ISSN 0976-5840 Volume 10, Number 1 (2018), pp. 21-32 International Research Publication House http://www.irphouse.com Relations of Centralizers on Semiprime

More information

Algebraic closure of some generalized convex sets

Algebraic closure of some generalized convex sets Algebraic closure of some generalized convex sets Anna B. ROMANOWSKA* Warsaw University of Technology, Poland Gábor CZÉDLI University of Szeged, Hungary 1 AFFINE SPACES AND CONVEX SETS 1. Real affine spaces

More information

Classification of algebras with minimal quadratic growth of identities

Classification of algebras with minimal quadratic growth of identities São Paulo Journal of Mathematical Sciences 1, 1 (2007), 97 109 Classification of algebras with minimal quadratic growth of identities A. C. Vieira Departamento de Matemática, Instituto de Ciências Exatas,

More information

Shifting Lemma and shifting lattice identities

Shifting Lemma and shifting lattice identities Shifting Lemma and shifting lattice identities Ivan Chajda, Gábor Czédli, and Eszter K. Horváth Dedicated to the memory of György Pollák (1929 2001) Abstract. Gumm [6] used the Shifting Lemma with high

More information

Contents. Chapter 2 Digital Circuits Page 1 of 30

Contents. Chapter 2 Digital Circuits Page 1 of 30 Chapter 2 Digital Circuits Page 1 of 30 Contents Contents... 1 2 Digital Circuits... 2 2.1 Binary Numbers... 2 2.2 Binary Switch... 4 2.3 Basic Logic Operators and Logic Expressions... 5 2.4 Truth Tables...

More information

Chapter 2 Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 1 Gate Circuits and Boolean Equations Chapter 2 - Part 1 2 Chapter 2 - Part 1 3 Chapter 2 - Part 1 4 Chapter 2 - Part

More information

On finite congruence-simple semirings

On finite congruence-simple semirings On finite congruence-simple semirings arxiv:math/0205083v2 [math.ra] 19 Aug 2003 Chris Monico Department of Mathematics and Statistics Texas Tech University Lubbock, TX 79409-1042 cmonico@math.ttu.edu

More information

A Note on UNAR LA-Semigroup

A Note on UNAR LA-Semigroup Punjab University Journal of Mathematics (ISSN 1016-2526) Vol. 50(3)(2018) pp. 113-121 A Note on UNAR LA-Semigroup Muhammad Rashad Department of Mathematics, University of Malakand, Pakistan, Email: rashad@uom.edu.pk

More information

MATH 19520/51 Class 5

MATH 19520/51 Class 5 MATH 19520/51 Class 5 Minh-Tam Trinh University of Chicago 2017-10-04 1 Definition of partial derivatives. 2 Geometry of partial derivatives. 3 Higher derivatives. 4 Definition of a partial differential

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

Commutative, idempotent groupoids and the constraint satisfaction problem

Commutative, idempotent groupoids and the constraint satisfaction problem Commutative, idempotent groupoids and the constraint satisfaction problem Clifford Bergman and David Failing Abstract. A restatement of the Algebraic Dichotomy Conjecture, due to Maroti and McKenzie, postulates

More information

/ M Morris Mano Digital Design Ahmad_911@hotmailcom / / / / wwwuqucscom Binary Systems Introduction - Digital Systems - The Conversion Between Numbering Systems - From Binary To Decimal - Octet To Decimal

More information

On Regularity of Incline Matrices

On Regularity of Incline Matrices International Journal of Algebra, Vol. 5, 2011, no. 19, 909-924 On Regularity of Incline Matrices A. R. Meenakshi and P. Shakila Banu Department of Mathematics Karpagam University Coimbatore-641 021, India

More information

D-bounded Distance-Regular Graphs

D-bounded Distance-Regular Graphs D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically

More information

THE VARIETIES OF QUASIGROUPS OF BOL-MOUFANG TYPE: AN EQUATIONAL REASONING APPROACH

THE VARIETIES OF QUASIGROUPS OF BOL-MOUFANG TYPE: AN EQUATIONAL REASONING APPROACH THE VARIETIES OF QUASIGROUPS OF BOL-MOUFANG TYPE: AN EQUATIONAL REASONING APPROACH J. D. PHILLIPS AND PETR VOJTĚCHOVSKÝ Abstract. A quasigroup identity is of Bol-Moufang type if two of its three variables

More information

Subdifferentiation of Monotone Functions from Semilattices to Distributive Lattices

Subdifferentiation of Monotone Functions from Semilattices to Distributive Lattices Order 12: 307-313, 1995. 307 1995 Kluwer Academic Publishers. Printed in the Netherlands. Subdifferentiation of Monotone Functions from Semilattices to Distributive Lattices J.D.H. SMITH Department of

More information

On the Structure of Rough Approximations

On the Structure of Rough Approximations On the Structure of Rough Approximations (Extended Abstract) Jouni Järvinen Turku Centre for Computer Science (TUCS) Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland jjarvine@cs.utu.fi Abstract. We study

More information

Chapter 2: Switching Algebra and Logic Circuits

Chapter 2: Switching Algebra and Logic Circuits Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used

More information

SEMILATTICE CONGRUENCES VIEWED FROM QUASI-ORDERS

SEMILATTICE CONGRUENCES VIEWED FROM QUASI-ORDERS PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 41, Number 1, November 1973 SEMILATTICE CONGRUENCES VIEWED FROM QUASI-ORDERS TAKAYUKI TAMURA Abstract. Let S be a semigroup. This paper proves that

More information

Homework 1/Solutions. Graded Exercises

Homework 1/Solutions. Graded Exercises MTH 310-3 Abstract Algebra I and Number Theory S18 Homework 1/Solutions Graded Exercises Exercise 1. Below are parts of the addition table and parts of the multiplication table of a ring. Complete both

More information

Two questions on semigroup laws

Two questions on semigroup laws Two questions on semigroup laws O. Macedońska August 17, 2013 Abstract B. H. Neumann recently proved some implication for semigroup laws in groups. This may help in solution of a problem posed by G. M.

More information

Equational Theory of Kleene Algebra

Equational Theory of Kleene Algebra Introduction to Kleene Algebra Lecture 7 CS786 Spring 2004 February 16, 2004 Equational Theory of Kleene Algebra We now turn to the equational theory of Kleene algebra. This and the next lecture will be

More information

arxiv: v2 [math.dg] 3 Sep 2014

arxiv: v2 [math.dg] 3 Sep 2014 HOLOMORPHIC HARMONIC MORPHISMS FROM COSYMPLECTIC ALMOST HERMITIAN MANIFOLDS arxiv:1409.0091v2 [math.dg] 3 Sep 2014 SIGMUNDUR GUDMUNDSSON version 2.017-3 September 2014 Abstract. We study 4-dimensional

More information

NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES

NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with

More information

CHAPTER 2 BOOLEAN ALGEBRA

CHAPTER 2 BOOLEAN ALGEBRA CHAPTER 2 BOOLEAN ALGEBRA This chapter in the book includes: Objectives Study Guide 2.1 Introduction 2.2 Basic Operations 2.3 Boolean Expressions and Truth Tables 2.4 Basic Theorems 2.5 Commutative, Associative,

More information

Commutative idempotent groupoids and the constraint satisfaction problem

Commutative idempotent groupoids and the constraint satisfaction problem Algebra Univers. DOI 10.1007/s00012-015-0323-6 Springer Basel 2015 Algebra Universalis Commutative idempotent groupoids and the constraint satisfaction problem Clifford Bergman and David Failing Abstract.

More information

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

Classes of Universal Graphs Definable by Universal Graph Algebra Quasi-Identities International Mathematical Forum, Vol. 8, 2013, no. 16, 789-799 HIKARI Ltd, www.m-hikari.com Classes of Universal Graphs Definable by Universal Graph Algebra Quasi-Identities P. Jampachon and T. Poomsa-ard

More information

INTUITIONISTIC FUZZY IDEALS OF LA-SEMIGROUPS.

INTUITIONISTIC FUZZY IDEALS OF LA-SEMIGROUPS. INTUITIONISTIC FUZZY IDEALS OF LA-SEMIGROUPS. MUHAMMAD ASLAM AND SALEEM ABDULLAH Abstract. e consider the intuitionistic fuzzi cation of the concept of several ideals in LA-semigroup S, investigate some

More information

3. Abstract Boolean Algebras

3. 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 information

Monoid varieties with continuum many subvarieties

Monoid varieties with continuum many subvarieties Monoid varieties with continuum many subvarieties Marcel Jackson (La Trobe University, Melbourne) Joint work with E.W.H. Lee (Nova Southeastern University, Florida) A construction Let W be a set of possibly

More information

arxiv: v1 [math.co] 9 Jun 2015

arxiv: v1 [math.co] 9 Jun 2015 On Maximal Chains of Systems of Word Equations Juhani Karhumäki and Aleksi Saarela Department of Mathematics and Statistics University of Turku, 20014 Turku, Finland arxiv:1506.02913v1 [math.co] 9 Jun

More information

( ) R kj. = y k y j. y A ( ) z A. y a. z a. Derivatives of the second order electrostatic tensor with respect to the translation of ( ) δ yβ.

( ) R kj. = y k y j. y A ( ) z A. y a. z a. Derivatives of the second order electrostatic tensor with respect to the translation of ( ) δ yβ. Supporting information Derivatives of R with respect to the translation of fragment along the y and z axis: y = y k y j (S1) z ( = z z k j) (S2) Derivatives of S with respect to the translation of fragment

More information

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings.

MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and

More information

Special graphs and quasigroup functional equations

Special graphs and quasigroup functional equations and quasigroup functional equations Mathematical Institute of the SASA Belgrade, Serbia Spectra of graphs and applications 2016 Belgrade, May 19 20, 2016. and quasigroup functional equations Dedicated

More information

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman

CS 121 Digital Logic Design. Chapter 2. Teacher Assistant. Hanin Abdulrahman CS 121 Digital Logic Design Chapter 2 Teacher Assistant Hanin Abdulrahman 1 2 Outline 2.2 Basic Definitions 2.3 Axiomatic Definition of Boolean Algebra. 2.4 Basic Theorems and Properties 2.5 Boolean Functions

More information

Commentationes Mathematicae Universitatis Carolinae

Commentationes Mathematicae Universitatis Carolinae Commentationes Mathematicae Universitatis Carolinae Mark Greer; Lee Raney Moufang semidirect products of loops with groups and inverse property extensions Commentationes Mathematicae Universitatis Carolinae,

More information

Lesson 7: Algebraic Expressions The Commutative and Associative Properties

Lesson 7: Algebraic Expressions The Commutative and Associative Properties : Algebraic Expressions The Commutative and Associative Properties Four Properties of Arithmetic: The Commutative Property of Addition: If a and b are real numbers, then a + b = b + a. The Associative

More information

Quandles and the Towers of Hanoi

Quandles and the Towers of Hanoi The the Bob Laboratory for Algebraic and Symbolic Computation Reem-Kayden Center for Science and Computation Bard College Annandale-on-Hudson, NY 12504 August 8, 2011 The 1 2 3 4 The The Figure Eight (4

More information

The varieties of quasigroups of Bol Moufang type: An equational reasoning approach

The varieties of quasigroups of Bol Moufang type: An equational reasoning approach Journal of Algebra 293 (2005) 17 33 www.elsevier.com/locate/jalgebra The varieties of quasigroups of Bol Moufang type: An equational reasoning approach J.D. Phillips a,petrvojtěchovský b, a Department

More information

IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS

IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS Scientiae Mathematicae Japonicae Online, Vol. 8, (2003), 597 606 597 IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS R. J. BIGNALL AND M. SPINKS Received April 1, 2003 Abstract. The variety

More information

languages by semifilter-congruences

languages by semifilter-congruences ideas Suffix semifilter-congruences Southwest Univ. Southwest Univ. Hongkong Univ. July 5 9, 2010, Nankai, China. Prefixsuffix Contents ideas 1 2 ideas 3 Suffix- 4 Prefix-suffix- Suffix Prefixsuffix ideas

More information