Idempotent Elements of the Semigroups B ( D ) defined by Semilattices of the Class Σ ( X ), when Z 7
|
|
- Adela Kelly
- 6 years ago
- Views:
Transcription
1 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 ISSN Idempotent Elements of the Semigroups B ( defined by Semilattices of the Class Σ ( when 7 8 Nino sinaridze ninocinaridze@mailru epartment of Mathematics Faculty of Physics Mathematics and Computer Sciences Shota Rustaveli Batumi State University 5 Ninoshvili St Batumi 00 Georgia ABSRAC he paper gives description of idempotent elements of the semigroup B ( which are defined by semilattices of the class ( for which intersection the minimal elements is not empty When is a finite 8 set the formulas are derived by means of which the number of idempotent elements of the semigroup is calculated 00 mathematical Subject Classification 0M05 Key words: semilattice semigroup binary relation idempotent element Introduction Let be an arbitrary nonempty set be a semilattice of unions ie a nonempty set of subsets of the set that is closed with respect to the set-theoretic operations of unification of elements from f be an arbitrary mapping from into o each such a mapping f there corresponds a binary relation satisfies the condition f = ({ x f ( x to prove that B ( he set of all such f x on the set that f ( f : is denoted by B ( It is easy is a semigroup with respect to the operation of multiplication of binary relations which is called a complete semigroup of binary relations defined by a semilattice of unions (see ([] Item By we denote an empty binary relation or empty subset of the set he condition ( xy written in the form x y Let xy Y will be and t = Y hen by symbols we denote the following sets: By symbol ( t B ( { ( { y = x yx Y = y V = Y Y y Y { { t { { = = t Y = { x x = = = we mean an exact lower bound of the set in the semilattice ε If ε ε = ε efinition Let B ( and ε is called right unit if ε = Y then ε is called an idempotent element of the semigroup B ( for any B ( (see [] [] [] efinition We say that a complete semilattice of unions is an I semilattice of unions if it satisfies the following two conditions: a ( t b = ( for any t [] or [] t for any nonempty element of (see ([] definition ([] definition t
2 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 efinition Let B ( V ( ( ( of the form = Y Note that if V following conditions are true: = Y V ISSN and Y = { y y = A representation of a binary relation ( ( Y = Y V ( is colled quasinormal Y = for V( and Let ( m n is a quasinormal representation of a binary relation then the denote the class of all complete semilattice of unions where every element is isomorphic to a fixed semilattice (see [] heorem Let be a complete semilattice of unions he semigroup B ( possesses right unit iff is an I semilattice of unions (see ([] heorem ([] heorem or [5] heorem Let be a finite set and ( be the set of all those elements of the semilattice ( \{ Q = V which are nonlimiting elements of the set Q A binary relation having a quasinormal representation = ( Y is an idempotent element of this semigroup iff V( a ( b Y for any ( c V is complete I semilattise of unions ( Y for any nonlimiting element of the set ( ( r heorem Let Σ ( E ( (see ([] heorem 9 ([] heorem 9 or [5] and I denote respectively the complete semilattice of unions the set of all I subsemilatices of the semilattice the set of all right units of the semigroup B ( all idempotents of the semigroup B ( b if then hen for the sets E ( r ( ( r ( r ( ( = for any elements and of the set ( E E Σ( ( r ( I = E the equality Σ( ( r ( statement b heorem or [5] and the set of and I the following statements are true: Σ that satisfy the condition I = E is fulfilled for the finite set (see ([] statement b heorem ([] By the symbol ( Σ 8 we denote the class of all semilattices of unions whose every element is = 7 5 where ( \ \ \ \ \ 5 \ \ \ \ \ isomorphic to an semilattice of form { he semilattice satisfying the conditions ( is shown in Figure Let ( { P P P P P P P P family sets where P 0 P P P P P 5 P P 7 are pairwise disjoint subsets of the set and C = is a 0 5 7
3 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 = P0 P P P P P5 P P 7 ϕ 5 7 ISSN is a mapping of the semilattice onto the family sets C( hen for the formal equalities of the semilattice we have a form: 5 7 Fig iagram of the Semilattice = P0 P P P P P5 P P7 = P0 P P P P5 P P7 = P0 P P P P5 P P7 = P0 P P P5 P P7 = P0 P P5 P P7 5 = P0 P P P P P7 = P0 P5 P7 = P P P 7 0 here the elements P P P P 5 are basis sources the element P0 P P P 7 is sources of completenes of the semilattice herefore and δ = (see ([] Item ([] Item or [] Now assume that Σ ( 8 Q { Q { Q { { 5 Q { We introduce the following notation: = where (see diagram in figure = where and (see diagram in figure = where and (see diagram in figure Q = where and (see diagram in figure 5 = where and \ \ (see diagram 5 in figure Q = { where { 7 { in figure 7 Q7 = { 7 in figure \ \ (see diagram where and \ \ (see diagram 8 Q8 = { where { 7 { 5 { \ \ ( \ \( and 9 Q { 0 Q { ( (see diagram 8 in figure 9 = where \ \ and = (see diagram 9 in figure 0 = where \ \ and = (see diagram 0 in figure Q = { 7 where { Q = { 7 where 7 Q = { where ( \ ( and = (see diagram in figure Q = { where ( and = (see diagram in figure and 7 = (see diagram in figure = (see diagram in figure ( \ \ \
4 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 5 Q5 = { where { 7 = ( \ ( diagram 5 in figure \ Q = { \ where 5 = (see diagram in figure Fig iagrams of all I subsemilattice of the semilattice { ISSN \ and = (see enote by the symbol ( Qi ( i to Q i Assume that ( Q i and denote by the symbol ( semigroup B ( for which the semilattices V ( and Q i are mutually isomorphic and V ( efinition Let the symbol I ( Let further ( and ϑ ( ( ϑ = the set of all I -subsemilattices of the semilattice isomorphic I the set of all idempotent elements of the Qi = denote the set of all I -subsemilattices of the semilattice I I I It is assumed that I if and only if there exists some complete isomorphism ϕ between the semilattices and One can easily verify that the binary relation ϑ I is an equivalence relation on the set I ( Let be an I -subsemilattices of the semilattice By I( we denoted the set of all idempotent elements of the semigroup B ( and I ( Q = I( where i = i 5 Qi ϑi Results = Σ 8 Lemma Let { ( 7 5 and 7 hen the following sets exhibit all I subsemilattices of the considered semilattice : { { { { { { 5 { { 7 (see diagram of the figure { { { { { { { { { { { 5 { 5 { { { { { { { (see diagram of the figure { 7 5 { 7 5 { 7 { 7 { 7 { 7 { 7 { { { { { { { { 5 { { { (see diagram of the figure 5
5 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 { 7 5 { 7 { 7 { { { (see diagram of the figure { { { { { { { (see diagram 5 of the figure 7 (see diagram of the figure 7 5 (see diagram 7 of the figure (see diagram 8 of the figure { { 7 { { 8 { 7 5 { ISSN Proof he statements - immediately follows from the heorems in [] the statements 5-7 immediately follows from the heorems in [] and the statement 8 immediately follows from the heorems 7 in [] he Lemma is proved = Σ 8 then the following equalities are true: Lemma If { ( I( Q = I( Q ( 7 5 \ \ = \ \ \ \ I( Q ( ( = \ \ \ \ \ \ I( Q ( ( ( = 5 ( ( \ \ \( ( I Q5 = \ = 5 \ ( \ ( \ 7 = ( 5 5 ( ( \ ( \ \ \ \ \ ( ( I Q \ \ 7 I( Q ( ( \ \ \( \( \ 8 ( ( ( ( I Q = 8 Proof: he statements - immediately follows from the Corollary 5 in [] the statements 5-7 immediately follows from the heorems the statement 8 immediately follows from the heorems 7 he Lemma is proved = Σ 8 B he binary heorem Let { ( 7 5 relation is an idempotent relation of the semigroup B ( following conditions: = where Y = where ( Y ( Y ( Y ( Y ( Y Y Y { 7 = where conditions: Y Y Y Y Y and ( iff the binary relation satisfies one of the and satisfies the conditions: Y Y Y Y { and satisfies the
6 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 ( Y ( Y ( Y ( Y0 ISSN = where { Y Y Y Y0 and satisfies the conditions: Y Y Y Y Y Y Y Y Y 0 5 ( Y ( Y ( Y ( Y ( = where \ \ Y Y Y { and satisfies the conditions: Y Y Y Y Y Y = where { { ( Y ( Y ( Y ( Y ( Y 0 \ \ Y Y Y Y { Y Y Y Y Y Y Y Y 7 and satisfies the conditions Y Y Y Y 7 ( Y ( Y ( Y ( Y ( ( Y0 = where \ \ Y Y Y Y Y Y Y { 0 0 and satisfies the conditions Y Y 8 ( Y ( Y ( Y ( Y ( ( Y ( Y0 Y Y = where { { { \ \ { 7 ( \ ( \ Y Y Y Y and satisfies the conditions Y Y Y Y Y Y Y Y Y Y Proof: In this case when 7 by Lemma we know that diagrams -8 given in Fig exhibit all diagrams of I subsemilattices of the semilattices a quasinormal representation of idempotent elements of the semigroup B ( 5 which are defined by these I semilattices may have one of the forms listed above he statements - immediately follows from the Corollary in [] the statements 5-7 immediately follows from the Corollary in [] and the statement 8 immediately follows from the heorems 7 he heorem is proved = Σ 8 If is a finite set then the number I ( Q Lemma Let { ( 7 5 ( I Q = 8 Proof: By the definition of the semilattice we have 7 Qϑ I = {{ 7 { { 5 { { { { { If the equalities { 7 { { 5 { 5 { { 7 { 8 { are fulfilled then I ( Q I( obtain ( = = = = = = = = 8 = (see efinition From this equality and statement of Lemma we I Q = = 8 he Lemma is proved Lemma Let = { Σ ( 8 I ( Q i If is a finite set then the number 7
7 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 I \ \ \ \ \ \ \ \ ( Q ( ( ( ( ( ( ( ( = \ 5 \ \ \ \ 7 \ \ \ ( \ \ \ 7 \ ( \ ( \ ( ( \ ( \ ( \ ( \ \ \ 7 \ 5\ 7 \ 5 ( ( ( \ \ \ 5 \ \ 7 \ \ Proof: By the definition of the semilattice we have Qθ = { { { { { { { { { { I 5 7 { 7 { { 5 { { 7 { { { 7 { 7 5 If the equalities = = = = = are fulfilled then { { { { { { { { { { 5 5 = 7 = 7 8 = 9 = 0 = = = = = = { { { { { { { { { = 7 = 8 = 7 9 = ( ( I Q = I i ISSN (see efinition From this equality and the statement of Lemma we obtain the validity of Lemma he Lemma is proved = Σ 8 If is a finite set then the number I ( Q Lemma 5 Let { ( I \ \ \ \ \ \ ( ( ( ( ( \ \ Q \ \ 5 ( ( ( ( \ \ \ \ \ \ \ + ( ( + ( ( \ \ ( ( ( ( \ 7 \ 7 ( ( ( ( \ \ 7 \ \ 5\ ( ( + ( ( = + + \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ ( ( ( ( \ \ 7 ( ( ( ( \ 7 \ \ \ ( ( ( ( \ + \ \ \ + + \ \ \ + \ \ \ \ \ \ \ Proof: By the definition of the semilattice we have Qθ I = {{ { { { 5 { { If the equalities { { { 7 { 7 { 7 { 7 5 { { { { 7 { 7 { 7 5 8
8 are fulfilled then IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 ISSN = { = { = { = { 5 5 = { = { 7 = { 8 = { 9 = { 7 0 = { 7 = { 7 = { 7 5 = { = { 5 = { = = = { { { ( ( I Q = I i (see efinition From this equality and the statement of Lemma we obtain the validity of Lemma 5 he Lemma is proved = Σ 8 If is a finite set then the number I ( Q Lemma Let { ( I \ \ \ 5\ 7 \ 5 \ 5 ( Q ( ( ( \ 7 \ \ ( ( ( \ 7 \ \ ( ( ( \ \ \ + ( ( ( \ \ \ ( ( ( \ \ \ + ( ( ( = + \ \ \ + + \ \ \ + + \ \ \ + \ \ \ + + \ \ \ Proof: By the definition of the semilattice we have Qθ I = If the equalities are fulfilled then {{ { { { { { = = = { { { { { { = = = 5 ( ( I Q = I i (see efinition From this equality and the statement of Lemma we obtain the validity of Lemma he Lemma is proved = Σ 8 If is a finite set then the number Lemma 7 Let { ( I ( Q 5 I \ 5\ \ 5 ( Q5 ( ( ( ( \ ( ( ( ( \ \ \ + ( ( \ \ \ = + + 5\ \ 5 \ \ \ Proof By the definition of the semilattice we have Qθ I = {{ { { { { 7 5 { {
9 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 If the equalities = 7 = = = 7 5 = = = are fulfilled then { { { { { { { ( ( I Q5 = I i 7 ISSN (see efinition From this equality and the statement 5 of Lemma we obtain the validity of Lemma 7 he Lemma is proved = Σ 8 If is a finite set then the number I ( Q Lemma 8 Let { ( ( ( ( ( ( \ 7 \ \ \ \ \ \ I Q = 5 + \ ( \ \ \ \ \ \ + ( ( ( 5 Proof: By the definition of the semilattice we have Qθ I = {{ 7 { If the equalities = { 7 = { are fulfilled then ( = ( + ( I Q I I (see efinition From this equality and the statement of Lemma we obtain the validity of Lemma 8 he Lemma is proved = Σ 8 If is a finite set then the number I ( Q 7 Lemma 9 Let { ( 7 5 I 7 \ \ \ \ 5 5\ ( Q7 ( ( ( \ \ + ( ( ( = \ \ \ 5 5 Proof: By the definition of the semilattice we have Q7θ I = {{ 7 5 { If the equalities = { 7 5 = { are fulfilled then ( = ( + ( I Q I I 7 (see efinition From this equality and the statement 7 of Lemma we obtain the validity of Lemma 9 he Lemma is proved = Σ 8 If is a finite set then the Lemma 0 Let { ( number I ( Q \ \ \ \ \ I ( Q8 = ( + \ 5\ \ 5 \ \ + ( ( ( Proof: By the definition of the semilattice we have Q8θ I = {{ 7 5 { If the equalities = { 7 5 = { are fulfilled then ( = ( + ( I Q I I 8 (see efinition From this equality and the statement 8 of Lemma we obtain the validity of Lemma 0 70
10 IJISE - International Journal of Innovative Science Engineering & echnology Vol Issue January 0 he Lemma is proved Let us assume that 8 ( k = I Qi heorem Let = { Σ ( of all idempotent elements of the semigroup ( B then I = k Proof: his heorem immediately follows from the heorem he heorem is proved 7 Example Let = { 5 { { { { { ISSN If is a finite set and I is a set P = P = P = P = P = 5 P = P = P = hen = { 5 = { 5 = { 5 = { 5 = { 5 5 { = { 5 7 = { and = {{ { 5 { { 5 { 5 { 5 { 5 { 5 herefore we have that following equality and inequality is valid: { { 7 = 5 = where I ( Q = 8 I ( Q = 7 I ( Q = 5 I ( Q = I ( Q 5 = 7 I ( Q = ( ( I Q 8 = I = I Q 7 = Reference [] Ya iasamidze Sh Makharadze Complete Semigroups of binary relations Monograph Kriter urkey 0-50 pp [] Ya iasamidze Sh Makharadze Complete Semigroups of binary relations Monograph M Sputnik p (Russian [] Ya I iasamidze Complete Semigroups of Binary Relations Journal of Mathematical Sciences Plenum Publ Cor New York Vol 7 No [] iasamidze Ya Makharadze Sh Rokva N On I semilattices of union Bull Georg Nation Acad Sci [5] iasamidze Ya Makharadze Sh iasamidze Il Idempotents and regular elements of complete semigroups of binary relations Journal of Mathematical Sciences Plenum Publ Cor New York
Complete Semigroups of Binary Relations Defined by Semilattices of the Class Σ X,10
Applied Mathematics 05 6 74-4 Published Online February 05 in SciRes. http://www.scirp.org/journal/am http://dx.doi.org/0.46/am.05.606 Complete Semigroups of Binary Relations efined by Semilattices of
More informationV X Y Y X D Z D Z. D is V D Y Y D. ,, if,, V V X V X. f we will compare binary relation
International Journal of Engineering Science and Innovative echnology (IJESI) Volume Issue 3 May 201 Finite semigroups of binary relations defined by semi lattices of the class Σ( ) Mzevinar Bakuridze
More informationIdempotent and Regular Elements of the Complete Semigroups of Binary Relations of the Class ( )
Applied Mathematics 205 6 32-38 Published Online February 205 in SciRes. http://www.scirp.org/journal/am http://dx.doi.org/0.4236/am.205.62029 Idempotent and Regular Elements of the Complete Semigroups
More informationBatumi, GEORGIA 2 Department of Mathematics. Hacettepe University Beytepe, Ankara, TURKEY 3 Department of Mathematics
International Journal of Pure and Applied Mathematics Volume 93 No. 4 2014, 549-566 ISSN: 1311-8080 printed version; ISSN: 1314-3395 on-line version url: http://www.ijpam.eu doi: http://dx.doi.org/10.12732/ijpam.v93i4.6
More informationRegular Elements of the Complete Semigroups of Binary Relations of the Class 8
Gen. Math. Notes, Vol. 21, No. 1, March 2014, pp.27-42 ISSN 2219-7184; Copyright c ICSRS Publication, 2014 www.i-csrs.org Available free online at http://www.geman.in Regular Elements of the Complete Semigroups
More informationANNIHILATOR IDEALS IN ALMOST SEMILATTICE
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 7(2017), 339-352 DOI: 10.7251/BIMVI1702339R Former BULLETIN
More informationUnions of Dominant Chains of Pairwise Disjoint, Completely Isolated Subsemigroups
Palestine Journal of Mathematics Vol. 4 (Spec. 1) (2015), 490 495 Palestine Polytechnic University-PPU 2015 Unions of Dominant Chains of Pairwise Disjoint, Completely Isolated Subsemigroups Karen A. Linton
More informationCHAPTER 4. βs as a semigroup
CHAPTER 4 βs as a semigroup In this chapter, we assume that (S, ) is an arbitrary semigroup, equipped with the discrete topology. As explained in Chapter 3, we will consider S as a (dense ) subset of its
More informationTHE MAXIMAL SUBGROUPS AND THE COMPLEXITY OF THE FLOW SEMIGROUP OF FINITE (DI)GRAPHS
THE MAXIMAL SUBGROUPS AND THE COMPLEXITY OF THE FLOW SEMIGROUP OF FINITE (DI)GRAPHS GÁBOR HORVÁTH, CHRYSTOPHER L. NEHANIV, AND KÁROLY PODOSKI Dedicated to John Rhodes on the occasion of his 80th birthday.
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationON 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 informationLattices, closure operators, and Galois connections.
125 Chapter 5. Lattices, closure operators, and Galois connections. 5.1. Semilattices and lattices. Many of the partially ordered sets P we have seen have a further valuable property: that for any two
More informationAperiodic languages and generalizations
Aperiodic languages and generalizations Lila Kari and Gabriel Thierrin Department of Mathematics University of Western Ontario London, Ontario, N6A 5B7 Canada June 18, 2010 Abstract For every integer k
More informationSemilattices of r-archimedean subdimonoids
BULETINUL ACADEMIEI DE ŞTIINŢE A REPUBLICII MOLDOVA. MATEMATICA Number 3(67), 2011, Pages 108 112 ISSN 1024 7696 Semilattices of r-archimedean subdimonoids Anatolii V. Zhuchok Abstract. We characterize
More informationUNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS
UNIVERSALITY OF THE LATTICE OF TRANSFORMATION MONOIDS MICHAEL PINSKER AND SAHARON SHELAH Abstract. The set of all transformation monoids on a fixed set of infinite cardinality λ, equipped with the order
More informationDomination in Cayley Digraphs of Right and Left Groups
Communications in Mathematics and Applications Vol. 8, No. 3, pp. 271 287, 2017 ISSN 0975-8607 (online); 0976-5905 (print) Published by RGN Publications http://www.rgnpublications.com Domination in Cayley
More informationMA441: Algebraic Structures I. Lecture 18
MA441: Algebraic Structures I Lecture 18 5 November 2003 1 Review from Lecture 17: Theorem 6.5: Aut(Z/nZ) U(n) For every positive integer n, Aut(Z/nZ) is isomorphic to U(n). The proof used the map T :
More informationSYNTACTIC 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 informationAxioms for the Real Number System
Axioms for the Real Number System Math 361 Fall 2003 Page 1 of 9 The Real Number System The real number system consists of four parts: 1. A set (R). We will call the elements of this set real numbers,
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Define and differentiate between important sets Use correct notation when describing sets: {...}, intervals
More informationDEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY
HANDOUT ABSTRACT ALGEBRA MUSTHOFA DEPARTMENT OF MATHEMATIC EDUCATION MATHEMATIC AND NATURAL SCIENCE FACULTY 2012 BINARY OPERATION We are all familiar with addition and multiplication of two numbers. Both
More informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY MTHE6011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions. Notes are not permitted
More informationSome Properties of a Set-valued Homomorphism on Modules
2012, TextRoad Publication ISSN 2090-4304 Journal of Basic and Applied Scientific Research www.textroad.com Some Properties of a Set-valued Homomorphism on Modules S.B. Hosseini 1, M. Saberifar 2 1 Department
More informationPrime and Irreducible Ideals in Subtraction Algebras
International Mathematical Forum, 3, 2008, no. 10, 457-462 Prime and Irreducible Ideals in Subtraction Algebras Young Bae Jun Department of Mathematics Education Gyeongsang National University, Chinju
More informationAxioms 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 informationAttempt QUESTIONS 1 and 2, and THREE other questions. Do not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 2016 17 SEMIGROUP THEORY WITH ADVANCED TOPICS MTHE7011A Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More informationSet Notation and the Real Numbers
Set Notation and the Real Numbers Oh, and some stuff on functions, too 1 Elementary Set Theory Vocabulary: Set Element Subset Union Intersection Set Difference Disjoint A intersects B Empty set or null
More informationDenotational semantics: proofs
APPENDIX A Denotational semantics: proofs We show that every closed term M has a computable functional [[M ] as its denotation. A.1. Unification We show that for any two constructor terms one can decide
More informationAutomata and Languages
Automata and Languages Prof. Mohamed Hamada Software Engineering Lab. The University of Aizu Japan Mathematical Background Mathematical Background Sets Relations Functions Graphs Proof techniques Sets
More informationLecture 8: Equivalence Relations
Lecture 8: Equivalence Relations 1 Equivalence Relations Next interesting relation we will study is equivalence relation. Definition 1.1 (Equivalence Relation). Let A be a set and let be a relation on
More informationMinimal order semigroups with specified commuting probability
Minimal order semigroups with specified commuting probability STEPHEN M. BUCKLEY Abstract. We determine the minimal order of a semigroup whose commuting probability equals any specified rational value
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More informationA NOTE ON Θ-CLOSED SETS AND INVERSE LIMITS
An. Şt. Univ. Ovidius Constanţa Vol. 18(2), 2010, 161 172 A NOTE ON Θ-CLOSED SETS AND INVERSE LIMITS Ivan Lončar Abstract For every Hausdorff space X the space X Θ is introduced. If X is H-closed, then
More informationCompletely regular semigroups and (Completely) (E, H E )-abundant semigroups (a.k.a. U-superabundant semigroups): Similarities and Contrasts
Completely regular semigroups and (Completely) (E, H E )-abundant semigroups (a.k.a. U-superabundant semigroups): Similarities and Contrasts Xavier MARY Université Paris-Ouest Nanterre-La Défense, Laboratoire
More informationA GENERAL THEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUTATIVE RING. David F. Anderson and Elizabeth F. Lewis
International Electronic Journal of Algebra Volume 20 (2016) 111-135 A GENERAL HEORY OF ZERO-DIVISOR GRAPHS OVER A COMMUAIVE RING David F. Anderson and Elizabeth F. Lewis Received: 28 April 2016 Communicated
More informationIntuitionistic Fuzzy Hyperideals in Intuitionistic Fuzzy Semi-Hypergroups
International Journal of Algebra, Vol. 6, 2012, no. 13, 617-636 Intuitionistic Fuzzy Hyperideals in Intuitionistic Fuzzy Semi-Hypergroups K. S. Abdulmula and A. R. Salleh School of Mathematical Sciences,
More informationON SOME SEMIGROUPS GENERATED FROM CAYLEY FUNCTIONS LEJO J. MANAVALAN, P.G. ROMEO
Available online at http://scikorg J Semigroup Theory Appl 2018, 2018:5 https://doiorg/1028919/jsta/3562 ISSN: 2051-2937 ON SOME SEMIGROUPS GENERATED FROM CAYLEY FUNCTIONS LEJO J MANAVALAN, PG ROMEO Department
More informationON 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 informationTHE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS
THE LATTICE OF SUBVARIETIES OF SEMILATTICE ORDERED ALGEBRAS A. PILITOWSKA 1 AND A. ZAMOJSKA-DZIENIO 2 Abstract. This paper is devoted to the semilattice ordered V-algebras of the form (A, Ω, +), where
More informationCongruence Boolean Lifting Property
Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;
More informationSimultaneous congruence representations: a special case
Algebra univers. 54 (2005) 249 255 0002-5240/05/020249 07 DOI 10.1007/s00012-005-1931-3 c Birkhäuser Verlag, Basel, 2005 Algebra Universalis Mailbox Simultaneous congruence representations: a special case
More informationA topological semigroup structure on the space of actions modulo weak equivalence.
A topological semigroup structure on the space of actions modulo wea equivalence. Peter Burton January 8, 08 Abstract We introduce a topology on the space of actions modulo wea equivalence finer than the
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationThe 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 information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationMonoids of languages, monoids of reflexive. relations and ordered monoids. Ganna Kudryavtseva. June 22, 2010
June 22, 2010 J -trivial A monoid S is called J -trivial if the Green s relation J on it is the trivial relation, that is aj b implies a = b for any a, b S, or, equivalently all J -classes of S are one-element.
More informationSemigroup, 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 informationPartial 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 informationEmbedding theorems for normal divisible residuated lattices
Embedding theorems for normal divisible residuated lattices Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics and Computer
More informationCS154. Non-Regular Languages, Minimizing DFAs
CS54 Non-Regular Languages, Minimizing FAs CS54 Homework is due! Homework 2 will appear this afternoon 2 The Pumping Lemma: Structure in Regular Languages Let L be a regular language Then there is a positive
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationA GENERALIZATION OF BI IDEALS IN SEMIRINGS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) 2303-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 8(2018), 123-133 DOI: 10.7251/BIMVI1801123M Former BULLETIN
More information10. Finite Lattices and their Congruence Lattices. If memories are all I sing I d rather drive a truck. Ricky Nelson
10. Finite Lattices and their Congruence Lattices If memories are all I sing I d rather drive a truck. Ricky Nelson In this chapter we want to study the structure of finite lattices, and how it is reflected
More informationTheory of Computation 1 Sets and Regular Expressions
Theory of Computation 1 Sets and Regular Expressions Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Theory of Computation
More informationON LEFT-INVARIANT BOREL MEASURES ON THE
Georgian International Journal of Science... Volume 3, Number 3, pp. 1?? ISSN 1939-5825 c 2010 Nova Science Publishers, Inc. ON LEFT-INVARIANT BOREL MEASURES ON THE PRODUCT OF LOCALLY COMPACT HAUSDORFF
More informationMATH 31BH Homework 1 Solutions
MATH 3BH Homework Solutions January 0, 04 Problem.5. (a) (x, y)-plane in R 3 is closed and not open. To see that this plane is not open, notice that any ball around the origin (0, 0, 0) will contain points
More informationON FUZZY TOPOLOGICAL BCC-ALGEBRAS 1
Discussiones Mathematicae General Algebra and Applications 20 (2000 ) 77 86 ON FUZZY TOPOLOGICAL BCC-ALGEBRAS 1 Wies law A. Dudek Institute of Mathematics Technical University Wybrzeże Wyspiańskiego 27,
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More information1.3 Vertex Degrees. Vertex Degree for Undirected Graphs: Let G be an undirected. Vertex Degree for Digraphs: Let D be a digraph and y V (D).
1.3. VERTEX DEGREES 11 1.3 Vertex Degrees Vertex Degree for Undirected Graphs: Let G be an undirected graph and x V (G). The degree d G (x) of x in G: the number of edges incident with x, each loop counting
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationOn the lattice of congruences on a fruitful semigroup
On the lattice of congruences on a fruitful semigroup Department of Mathematics University of Bielsko-Biala POLAND email: rgigon@ath.bielsko.pl or romekgigon@tlen.pl The 54th Summer School on General Algebra
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More informationComplete 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 informationCS 154, Lecture 4: Limitations on DFAs (I), Pumping Lemma, Minimizing DFAs
CS 154, Lecture 4: Limitations on FAs (I), Pumping Lemma, Minimizing FAs Regular or Not? Non-Regular Languages = { w w has equal number of occurrences of 01 and 10 } REGULAR! C = { w w has equal number
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationHomework 5. Solutions
Homework 5. Solutions 1. Let (X,T) be a topological space and let A,B be subsets of X. Show that the closure of their union is given by A B = A B. Since A B is a closed set that contains A B and A B is
More informationJournal Algebra Discrete Math.
Algebra and Discrete Mathematics Number 2. (2005). pp. 20 35 c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE On posets of width two with positive Tits form Vitalij M. Bondarenko, Marina V.
More informationLarge subsets of semigroups
CHAPTER 8 Large subsets of semigroups In the van der Waerden theorem 7.5, we are given a finite colouring ω = A 1 A r of the commutative semigroup (ω, +); the remark 7.7(b) states that (at least) one of
More informationOn Convergence of Sequences of Measurable Functions
On Convergence of Sequences of Measurable Functions Christos Papachristodoulos, Nikolaos Papanastassiou Abstract In order to study the three basic kinds of convergence (in measure, almost every where,
More informationChapter 9: Relations Relations
Chapter 9: Relations 9.1 - Relations Definition 1 (Relation). Let A and B be sets. A binary relation from A to B is a subset R A B, i.e., R is a set of ordered pairs where the first element from each pair
More informationGroups that Distribute over Stars
Groups that Distribute over Stars Arthur Holshouser 3600 Bullard St Charlotte, NC, USA, 808 Harold Reiter Department of Mathematics UNC Charlotte Charlotte, NC 83 hbreiter@emailunccedu 1 Abstract Suppose
More informationOn minimal models of the Region Connection Calculus
Fundamenta Informaticae 69 (2006) 1 20 1 IOS Press On minimal models of the Region Connection Calculus Lirong Xia State Key Laboratory of Intelligent Technology and Systems Department of Computer Science
More informationCommutative FSM Having Cycles over the Binary Alphabet
Commutative FSM Having Cycles over the Binary Alphabet Dr.S. Jeya Bharathi 1, Department of Mathematics, Thiagarajar College of Engineering, Madurai, India A.Jeyanthi 2,* Department of Mathematics Anna
More informationPermutation Groups and Transformation Semigroups Lecture 2: Semigroups
Permutation Groups and Transformation Semigroups Lecture 2: Semigroups Peter J. Cameron Permutation Groups summer school, Marienheide 18 22 September 2017 I am assuming that you know what a group is, but
More informationLecture 1: Lattice(I)
Discrete Mathematics (II) Spring 207 Lecture : Lattice(I) Lecturer: Yi Li Lattice is a special algebra structure. It is also a part of theoretic foundation of model theory, which formalizes the semantics
More informationBoolean Semilattices
Boolean Semilattices Clifford Bergman Iowa State University June 2015 Motivating Construction Let G = G, be a groupoid (i.e., 1 binary operation) Form the complex algebra G + = Sb(G),,,,,, G X Y = { x
More informationAvailable online at J. Math. Comput. Sci. 2 (2012), No. 6, ISSN: COSET CAYLEY DIGRAPH STRUCTURES
Available online at http://scik.org J. Math. Comput. Sci. 2 (2012), No. 6, 1766-1784 ISSN: 1927-5307 COSET CAYLEY DIGRAPH STRUCTURES ANIL KUMAR V 1, PARAMESWARAN ASHOK NAIR 2, 1 Department of Mathematics,
More informationWe define the multi-step transition function T : S Σ S as follows. 1. For any s S, T (s,λ) = s. 2. For any s S, x Σ and a Σ,
Distinguishability Recall A deterministic finite automaton is a five-tuple M = (S,Σ,T,s 0,F) where S is a finite set of states, Σ is an alphabet the input alphabet, T : S Σ S is the transition function,
More informationFinite pseudocomplemented lattices: The spectra and the Glivenko congruence
Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented
More informationSets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationWeak Choice Principles and Forcing Axioms
Weak Choice Principles and Forcing Axioms Elizabeth Lauri 1 Introduction Faculty Mentor: David Fernandez Breton Forcing is a technique that was discovered by Cohen in the mid 20th century, and it is particularly
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationFuzzy 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 informationOn Submodular and Supermodular Functions on Lattices and Related Structures
On Submodular and Supermodular Functions on Lattices and Related Structures Dan A. Simovici University of Massachusetts Boston Department of Computer Science Boston, USA dsim@cs.umb.edu Abstract We give
More informationAnalysis Comprehensive Exam Questions Fall F(x) = 1 x. f(t)dt. t 1 2. tf 2 (t)dt. and g(t, x) = 2 t. 2 t
Analysis Comprehensive Exam Questions Fall 2. Let f L 2 (, ) be given. (a) Prove that ( x 2 f(t) dt) 2 x x t f(t) 2 dt. (b) Given part (a), prove that F L 2 (, ) 2 f L 2 (, ), where F(x) = x (a) Using
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
5-453 FORMAL LANGUAGES, AUTOMATA AN COMPUTABILITY FA NFA EFINITION Regular Language Regular Expression How can we prove that two regular expressions are equivalent? How can we prove that two FAs (or two
More informationOn Transfinite Cardinal Numbers
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 14, Issue 4 Ver. IV (Jul - Aug 2018), PP 17-21 www.iosrjournals.org On Transfinite Cardinal Numbers J N Salunke* and B
More informationAN ALGEBRAIC APPROACH TO GENERALIZED MEASURES OF INFORMATION
AN ALGEBRAIC APPROACH TO GENERALIZED MEASURES OF INFORMATION Daniel Halpern-Leistner 6/20/08 Abstract. I propose an algebraic framework in which to study measures of information. One immediate consequence
More informationHarvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries
Harvard CS121 and CSCI E-121 Lecture 2: Mathematical Preliminaries Harry Lewis September 5, 2013 Reading: Sipser, Chapter 0 Sets Sets are defined by their members A = B means that for every x, x A iff
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:
More informationMATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics.
MATH 614 Dynamical Systems and Chaos Lecture 6: Symbolic dynamics. Metric space Definition. Given a nonempty set X, a metric (or distance function) on X is a function d : X X R that satisfies the following
More informationON DIFFERENTIAL BASES FORMED OF INTERVALS
GEORGAN MATHEMATCAL JOURNAL: Vol. 4, No., 997, 8-00 ON DFFERENTAL ASES FORMED OF NTERVALS G. ONAN AND T. ZEREKDZE n memory of young mathematician A. ereashvili Abstract. Translation invariant subbases
More information3 Hausdorff and Connected Spaces
3 Hausdorff and Connected Spaces In this chapter we address the question of when two spaces are homeomorphic. This is done by examining two properties that are shared by any pair of homeomorphic spaces.
More informationJournal Algebra Discrete Math.
Algebra and Discrete Mathematics Number. (004). pp. 45 55 c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE On growth of the inverse semigroup of partially defined co finite automorphisms of
More informationGiven any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer
Chapter 2 Topogenic Graphs Given any simple graph G = (V, E), not necessarily finite, and a ground set X, a set-indexer of G is an injective set-valued function f : V (G) 2 X such that the induced edge
More informationarxiv: 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 informationChapter 4. Measure Theory. 1. Measure Spaces
Chapter 4. Measure Theory 1. Measure Spaces Let X be a nonempty set. A collection S of subsets of X is said to be an algebra on X if S has the following properties: 1. X S; 2. if A S, then A c S; 3. if
More information