Bi-ideal-simple semirings
|
|
|
- Lesley Cameron
- 10 years ago
- Views:
Transcription
1 Comment.Math.Univ.Carolin. 46,3(2005) Bi-ideal-simple semirings VáclavFlaška,TomášKepka,JanŠaroch Abstract. Commutative congruence-simple semirings were studied in[2] and [7](but see also[1],[3] [6]). The non-commutative case almost(see[8]) escaped notice so far. Whatever, every congruence-simple semiring is bi-ideal-simple and the aim of this very short note is to collect several pieces of information on these semirings. Keywords: bi-ideal-simple, semiring, zeropotent Classification: 16Y60 1. Introduction A semiring is a non-empty set equipped with two binary operations, denoted as addition and multiplication, such that the addition makes a commutative semigroup, the multiplication is associative and distributes over the addition from both sides. The additive(multiplicative, resp.) semigroup of the semiring may, but need not, contain a neutral and/or an absorbing element. An element will be called bi-absorbing if it is absorbing for both the operations. If such an element exists,itwillbedenotedbythesymbol o(= o S ).Wethushave o+x=ox=xo=o forevery x S. Let Sbeasemiring. Weput A+B= {a+b; a A, b B}, AB= {ab; a A, b B}and2A={a+a; a A}foranytwosubsets Aand Bof S. A semiring S is called congruence-simple if it has just two congruence relations. 2. Bi-ideals Let Sbeasemiring. Anon-emptysubset Iof Siscalledabi-ideal of Sif (S+I) SI IS I(i.e., Iisanidealbothoftheadditiveandthemultiplicative semigroup of the semiring S). The following seven lemmas are easy. 2.1Lemma. Aone-elementsubset {w}of Sisabi-idealifandonlyif w=o S is a bi-absorbing element of S. This research has been supported by the Grant Agency of the Charles University, Grant #444/2004 and by the institutional grant MSM
2 392 V.Flaška,T.Kepka,J.Šaroch 2.2Lemma. Thesubsets S, S+ S, SS+ S, SSS+ S,...arebi-idealsof S. 2.3Lemma. SaS+ Sisabi-idealof Sforevery a S. Intheremaininglemmas,assumethat o S. 2.4Lemma. Theset {x S; xsx=o}isabi-ideal. 2.5Lemma. Theset {x S; x+xsx=o}isabi-ideal. 2.6Lemma. Theset {x S;2x=o}isabi-ideal. 2.7Lemma. Thesets(o:S) l = {x S; xs= o},(o:s) r = {x S; Sx=o} and(o:s) m = {x S; SxS= o}arebi-ideals. 3. Bi-ideal-free semirings 3.1 Proposition. A semiring S is bi-ideal-free(i.e., it has no proper bi-ideal) if andonlyif S= SaS+ Sforevery a S. Proof: The assertion follows easily from Bi-ideal-simple semirings introduction Asemiring Swillbecalledbi-ideal-simpleif S 2and I= Swhenever Iis abi-idealof Swith I Proposition. Asemiring Sisbi-ideal-simpleifandonlyifatleastone(and thenjustone)ofthefollowingfivecasestakesplace: (1) S =2; (2) S 3and S= SaS+ Sforevery a S; (3) S 3, o Sand S= SaS+ Sforevery a S, a o; (4) S 3, o S, S+ S= oand SaS= Sforevery a S, a o; (5) S 3, o S, SS= oand S+ a=sforevery a S, a o. Proof: We prove only the direct implication, the converse one being trivial. So, let Sbeabi-ideal-simplesemiring. Wewillassumethat S 3and,moreover, inviewof3.1,that Sisnotbi-ideal-free. Then o Sby2.1andwehaveto distinguish the following three cases. (i) Let S+ S= o.if SS= o,theneverysubsetof Scontaining oisabi-ideal andthen S =2,acontradiction.Thus SS o,andhence(o:s) l = oby 2.7. Similarly(o:S) r = oand,bycombination,weget(o:s) m = o(use 2.7again). Now,if a S, a o,then SaS oand,since S+ S= o,the set SaSisabi-ideal.Thus SaS= Sand(4)istrue. (ii) Let SS= o. Theneveryidealof S(+)isabi-ideal,andsothesemigroup S(+) is ideal-simple. Now,(5) is clear. (iii) Let S+ S o SS. Wehave(o : S) l = o = (o : S) r by2.7, and hence(o:s) m = o,too. Further, S+ S = S by2.2. Now,if a S,
3 Bi-ideal-simple semirings 393 a o,then bac oforsome b, c S,and b=d+e, d, e S. Then o bac=dac+eac SaS+ Sandconsequently, SaS+ S= Sby2.3. It meansthat(3)istrue. Intherestofthissection,weassumethat Sisabi-ideal-simplesemiringwith o S. 4.2Proposition. If Sisanil-semiring(i.e.,forevery x Sthereexists n 1 with x n = o),then SS= o. Proof:Theresultisclearfor S =2,andsolet S 3.If a S, a o,issuch thateither S= SaS+Sor S= SaS,then a=bac+w, b, c S, w S {0},and wehave a=b 2 ac 2 + bwc+w=b 3 ac 3 + b 2 wc 2 + bwc+w=...,acontradiction with b n = o.thus SaS+ S S SaSandtherestisclearfrom Lemma. If S 3and SS o,thenforevery a S, a o,thereexist elements b, c, d Ssuchthat bac o ada. Proof: Combine 2.4, 2.7 and Lemma. Justoneofthefollowingtwocasestakesplace: (1) x+xsx=oforevery x S; (2)forevery a S, a o,thereexistsatleastone b Swith a+aba o. Proof: Use Lemma. Justoneofthefollowingtwocasestakesplace: (1)2x=oforevery x S; (2)2a oforevery a S, a o. Proof: Use Congruence-simple semirings 5.1 Proposition. Every congruence-simple semiring is bi-ideal-simple. Proof:If Iisabi-ideal,thentherelation(I I) id S isacongruenceof S. 5.2Proposition. Let Sbeabi-ideal-simplesemiringwith o Sandlet a S, a o. If risacongruenceof Smaximalwithrespectto(a, o) / r,then S/ris a congruence-simple semiring. Proof: S/risnon-trivial. If sisacongruenceof Ssuchthat r sand r s, then(a, o) sand I= {x S;(x, o) s}isabi-idealof S. Since I 2,we have I= Sand s=s S. 5.3Corollary. Let Sbeabi-ideal-simplesemiringwith o S.Then Scanbe imbedded into the product of congruence-simple factors of S.
4 394 V.Flaška,T.Kepka,J.Šaroch 6. Bi-ideal-simple semirings of type 4.1(4) 6.1. If S is a bi-ideal-simple semiring of type 4.1(4), then the multiplicative semigroup of S is ideal-simple Let Sbeamultiplicativeideal-simplesemigroupwith S 3and o S. Setting S+ S= owegetabi-ideal-simplesemiringoftype4.1(4). 7. Bi-ideal-simple semirings of type 4.1(5) 7.1. If Sisabi-ideal-simplesemiringoftype4.1(5),then T(+)isan(abelian) subgroupof S(+),where T= S \ {o} Let T(+)beanabeliangroup, T 2, o / T and S= T {o}. Setting SS= S+ o=o+s= owegetabi-ideal-simplesemiringoftype4.1(5). 8. Additively zeropotent semirings In this section, let S be an additively zeropotent semiring(a zp-semiring for short). Thatis, o S and2s = o. Wedefinearelation on S by a b iff b (S+ a) {a}. Itiseasytocheckthat isarelationoforderwhichis compatiblewiththetwooperationsdefinedon S.Thatis, isanorderingofthe semiring S. Clearly, o is the greatest element of S. 8.1Lemma. If S 2,thenanelement a S, a o,ismaximalin S \ {o}if andonlyif S+ a=o. Proof: Obvious. Intherestofthissection,wewillassumethat S= S+ S. 8.2Lemma. If S 2,then Shasnominimalelements. Proof:If a S, a o,then a=b+c, b a.if b=a,then a=a+c=a+2c= a+o=o,acontradiction. 8.3Corollary. Either S =1or Sisinfinite. 8.4 Lemma. The only idempotent element of S is the bi-absorbing element o. Proof: Let b 2 = bforsome b S. Then b=c+dand b=b 3 = b(c+d)b= bcb+bdb.ofcourse, c b, d b,andhence cd bd, cd cb, o=2cd bd+cb and bd+cb=o.finally, o=bob=bdb+bcb=b. 8.5Corollary. If Scontainsaleft(orright)unit,then S =1. 8.6Lemma. If a k = a l forsome a Sand1 k < l,then a k = o. Proof: Therearepositiveintegers m, nsuchthat m(l k)=k+ n. Now,if b=a k+n,then b=a k a n = a l a n = a k a l k a n = a l a l k a n = a k a l k a l k a n = =a k a m(l k) a n = a 2k+2n = b 2.By8.4, b=o,andhence a k = a l = a k a l k = a k a l k a l k = =a k a m(l k) = a k a k+n = a k b=o.
5 Bi-ideal-simple semirings Lemma. Let a, b Sand k, l 1besuchthat a k = a l + b.then a 2k = o. Moreover,if 2k l,then a k = o. Proof:Wehave a 2l + a l b=a l (a l + b)=a k+l =(a l + b)a l = a 2l + ba l. Consequently, a 2k =(a l +b) 2 = a 2l +a l b+ba l +b 2 = a 2l +ba l +ba l +b 2 = o.if2k l, then a 2k = oimplies a l = oandhence a k = a l + b=o. 8.8Lemma. If a Sisanon-nilpotentelement,thenthepowers a 1, a 2, a 3,... are pair-wise incomparable. Proof: Combine 8.6 and Lemma. If a, b Saresuchthat aba a,then a=o. Proof: If aba=a,then(ab) 2 = ab, ab=oby8.4and a=aba=oa=o. If aba+c=a,then ab=abab+cb=(ab) 2 + cb, ab=oby8.7and a=o,too. 8.10Lemma. If a, b Saresuchthat ab=a o(ab=b o,resp.),then a b(b a,resp.). Proof: Firstly, a bby8.4. Now,if a b,then b=a+c, ac bc, c b, ac ab=a, o=2ac a+bcand a+bc=o. Thus o=a(a+bc)=a 2 + abc= a 2 + ac=a(a+c)=ab=a,acontradiction.similarlythesecondcase. 8.11Proposition. Let Sbeazp-semiringwith S+ S= Sand S 2.Then: (i) Sisinfinite; (ii) theorderedset(s, )hasnominimalelements; (iii) the bi-absorbing element o is the only idempotent element of S; (iv) Scontainsneitheraleftnorarightunit; (v)if a Sisnotnilpotent,thentheelements a i, i 1,arepair-wiseincomparablein(S, ); (vi)if a o,then aba aforevery b S; (vii) if o a b,then ab a; (viii) if o b a,then ab b. Proof:See8.2,8.3,8.4,8.5,8.8,8.9and Bi-ideal-simple zp-semirings 9.1 Proposition. Let S be a zp-semiring with S 3. Then S is bi-ideal-simple ifandonlyifatleastone(andthenjustone)ofthefollowingtwocasestakes place: (1) S+ S= oand SaS= Sforevery a S, a o; (2) S= S+ SaSforevery a S, a o. Proof: The result follows easily from 4.1. Intherestofthissection,let Sbeabi-ideal-simplesemiringsuchthat S+S o. Then S+ S= Sand Sisinfinite(see8.11).Moreover,by4.2, Sisnotnil.
6 396 V.Flaška,T.Kepka,J.Šaroch 9.2Lemma. Let V beafinitesubsetof S \ {o}.thenthereexistsatleastone element a Ssuchthat a oand a vforevery v V. Proof:Firstly,by9.1,wehave S= S+SbSforevery b S, b o.inparticular, SbS o, SS oand,by4.3,forevery w V thereisatleastone a w Swith wa w w o. Then a w oand wa w w wby8.9. Now,asequence v 1,...,v k, k 2,ofelementsfrom V willbecalledadmissibleinthesequeliftheseelements arepair-wisedistinctand v i a i v i v i+1 forsome a i S,1 i k 1. Ifthereisnoadmissiblesequence,then wa w w oand wa w w v forall w, v V. Theresultisprovedinthiscase, andhencewecanassumethat v 1,...,v k, k 2,isanadmissiblesequencewithmaximallength k. Let mbemaximalwithrespectto1 m kand v k bv k v m foratleastone b S.Then m < kby8.9and v m a m v m v m+1 implies v k bv k a m v k bv k v m+1, acontradictionwiththemaximalityof m. Wehavethusshownthat v k cv k v i forall1 i kand c S.Inparticular, o v k a k v k v i forsome a k Sand all i,1 i k.finally,itfollowsfromthemaximalityof kthat v k a k v k vfor every v V. 9.3Corollary. Denoteby Athesetofmaximalelementsof (S \ {o}, )(see 8.1)andassumethateveryelementfrom S \ {o}issmallerorequaltoanelement from A.Thentheset Aisinfinite. 9.4 Proposition. Just one of the following two cases takes place: (1) x+xsx=oand x m + x n = oforevery x Sandallpositiveintegers m, n; (2)forevery a S, a o,thereexistsatleastone b Ssuchthat a+aba o. Proof: Takingintoaccount4.4,wemayassumethat x+xsx=oforevery x S. Then x+x 3 = oandweput I= {a S; a+a 2 = o}. Clearly, Iisan idealof S(+). Moreover,if a Iand b S,then ab+abab=(a+aba)b=o. Thus ab I,similarly ba Iandweseethat Iisabi-idealof S. If I= {o},then a+a 2 oforevery a S, a o.but a 2 + a 4 = a(a+a 3 )= ao=oand a 2 I. Itfollowsthat a 2 = oforevery a S,acontradictionwith 4.2. Thus I {o}andweget I= Sand x+x 2 = oforevery x S. Further, x+x=obythezp-propertyand x+x n = oforevery n 3,since x+xsx=o. If2 n m,then x n + x m = x n 1 (x+x m n+1 )=x n 1 o=o. 9.5Proposition. Denoteby Athesetofmaximalelementsoftheorderedset (S \ {o}, ).If Aisnon-empty,then x+xsx=oforevery x S(i.e.,thecase 9.4(1) takes place). Proof: Combine 8.1 and An open problem Noexampleofanon-trivialzp-semiring Swith S+ S= S(see8.11)is known(atleasttotheauthorsofthepresentbriefnote).
7 Bi-ideal-simple semirings 397 References [1] Eilhauer R., Zur Theorie der Halbkörper, I, Acta Math. Acad. Sci. Hungar. 19(1968), [2] El Bashir R., Hurt J., Jančařík A., Kepka T., Simple commutative semirings, J. Algebra 236(2001), [3] Golan J., The Theory of Semirings with Application in Math. and Theoretical Computer Science, Pitman Monographs and Surveys in Pure and Applied Mathematics 54, Longman, Harlow, [4] Hebisch U., Weinert H.J., Halbringe. Algebraische Theorie und Anwendungen in der Informatik, Teubner, Stuttgart, [5] Hutehins H.C., Weinert H.J., Homomorphisms and kernels of semifields, Period. Math. Hungar. 21(1990), [6] Koch H., Über Halbkörper, die in algebraischen Zahlkörpern enhalten sind, Acta Math. Acad. Sci. Hungar. 15(1964), [7] Mitchell S.S., Fenoglio P.B., Congruence-free commutative semirings, Semigroup Forum 37(1988), [8] Monico C., On finite congruence-simple semirings, J. Algebra 271(2004), Department of Algebra, Faculty of Mathematics and Physics, Charles University, Sokolovská 83, Praha 8, Czech Republic (Received October 12, 2004, revised March 9, 2005)
COMMUTATIVE RINGS. Definition: A domain is a commutative ring R that satisfies the cancellation law for multiplication:
COMMUTATIVE RINGS Definition: A commutative ring R is a set with two operations, addition and multiplication, such that: (i) R is an abelian group under addition; (ii) ab = ba for all a, b R (commutative
FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS
International Electronic Journal of Algebra Volume 6 (2009) 95-106 FACTORING CERTAIN INFINITE ABELIAN GROUPS BY DISTORTED CYCLIC SUBSETS Sándor Szabó Received: 11 November 2008; Revised: 13 March 2009
ON ROUGH (m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS
U.P.B. Sci. Bull., Series A, Vol. 75, Iss. 1, 2013 ISSN 1223-7027 ON ROUGH m, n) BI-Γ-HYPERIDEALS IN Γ-SEMIHYPERGROUPS Naveed Yaqoob 1, Muhammad Aslam 1, Bijan Davvaz 2, Arsham Borumand Saeid 3 In this
Online EFFECTIVE AS OF JANUARY 2013
2013 A and C Session Start Dates (A-B Quarter Sequence*) 2013 B and D Session Start Dates (B-A Quarter Sequence*) Quarter 5 2012 1205A&C Begins November 5, 2012 1205A Ends December 9, 2012 Session Break
ON SOME CLASSES OF REGULAR ORDER SEMIGROUPS
Commun. Korean Math. Soc. 23 (2008), No. 1, pp. 29 40 ON SOME CLASSES OF REGULAR ORDER SEMIGROUPS Zhenlin Gao and Guijie Zhang Reprinted from the Communications of the Korean Mathematical Society Vol.
Fundamentele Informatica II
Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear
THE PRODUCT SPAN OF A FINITE SUBSET OF A COMPLETELY BOUNDED ARTEX SPACE OVER A BI-MONOID
THE PRODUCT SPAN OF A FINITE SUBSET OF A COMPLETELY BOUNDED ARTEX SPACE OVER A BI-MONOID ABSTRACT The product of subsets of an Artex space over a bi-monoid is defined. Product Combination of elements of
Boolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions
CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions Theory of Formal Languages In the English language, we distinguish between three different identities: letter, word, sentence.
Rough Semi Prime Ideals and Rough Bi-Ideals in Rings
Int Jr. of Mathematical Sciences & Applications Vol. 4, No.1, January-June 2014 Copyright Mind Reader Publications ISSN No: 2230-9888 www.journalshub.com Rough Semi Prime Ideals and Rough Bi-Ideals in
I. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
Some Special Artex Spaces Over Bi-monoids
Some Special Artex Spaces Over Bi-monoids K.Muthukumaran (corresponding auther) Assistant Professor PG and Research Department Of Mathematics, Saraswathi Narayanan College, Perungudi Madurai-625022,Tamil
INCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
Degree Hypergroupoids Associated with Hypergraphs
Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples
On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a
Abstract Algebra Cheat Sheet
Abstract Algebra Cheat Sheet 16 December 2002 By Brendan Kidwell, based on Dr. Ward Heilman s notes for his Abstract Algebra class. Notes: Where applicable, page numbers are listed in parentheses at the
6 Commutators and the derived series. [x,y] = xyx 1 y 1.
6 Commutators and the derived series Definition. Let G be a group, and let x,y G. The commutator of x and y is [x,y] = xyx 1 y 1. Note that [x,y] = e if and only if xy = yx (since x 1 y 1 = (yx) 1 ). Proposition
1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain
Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is
A 2-factor in which each cycle has long length in claw-free graphs
A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
Mathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
Left-Handed Completeness
Left-Handed Completeness Dexter Kozen Computer Science Department Cornell University RAMiCS, September 19, 2012 Joint work with Alexandra Silva Radboud University Nijmegen and CWI Amsterdam Result A new
ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath
International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December
ADDITIVE GROUPS OF RINGS WITH IDENTITY
ADDITIVE GROUPS OF RINGS WITH IDENTITY SIMION BREAZ AND GRIGORE CĂLUGĂREANU Abstract. A ring with identity exists on a torsion Abelian group exactly when the group is bounded. The additive groups of torsion-free
Math 312 Homework 1 Solutions
Math 31 Homework 1 Solutions Last modified: July 15, 01 This homework is due on Thursday, July 1th, 01 at 1:10pm Please turn it in during class, or in my mailbox in the main math office (next to 4W1) Please
ACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS. Cosmin Pelea
ACTA UNIVERSITATIS APULENSIS No 15/2008 PRODUCTS OF MULTIALGEBRAS AND THEIR FUNDAMENTAL ALGEBRAS Cosmin Pelea Abstract. An important tool in the hyperstructure theory is the fundamental relation. The factorization
Applications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010
Boolean Algebra (cont d) 2 Contents Multiplying out and factoring expressions Exclusive-OR and Exclusive-NOR operations The consensus theorem Summary of algebraic simplification Proving validity of an
Algebraic Properties and Proofs
Algebraic Properties and Proofs Name You have solved algebraic equations for a couple years now, but now it is time to justify the steps you have practiced and now take without thinking and acting without
Section IV.21. The Field of Quotients of an Integral Domain
IV.21 Field of Quotients 1 Section IV.21. The Field of Quotients of an Integral Domain Note. This section is a homage to the rational numbers! Just as we can start with the integers Z and then build the
Discrete Mathematics, Chapter 4: Number Theory and Cryptography
Discrete Mathematics, Chapter 4: Number Theory and Cryptography Richard Mayr University of Edinburgh, UK Richard Mayr (University of Edinburgh, UK) Discrete Mathematics. Chapter 4 1 / 35 Outline 1 Divisibility
On the Algebraic Structures of Soft Sets in Logic
Applied Mathematical Sciences, Vol. 8, 2014, no. 38, 1873-1881 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43127 On the Algebraic Structures of Soft Sets in Logic Burak Kurt Department
SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov
Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices
MAT188H1S Lec0101 Burbulla
Winter 206 Linear Transformations A linear transformation T : R m R n is a function that takes vectors in R m to vectors in R n such that and T (u + v) T (u) + T (v) T (k v) k T (v), for all vectors u
CS 103X: Discrete Structures Homework Assignment 3 Solutions
CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B
THREE DIMENSIONAL GEOMETRY
Chapter 8 THREE DIMENSIONAL GEOMETRY 8.1 Introduction In this chapter we present a vector algebra approach to three dimensional geometry. The aim is to present standard properties of lines and planes,
calculating the result modulo 3, as follows: p(0) = 0 3 + 0 + 1 = 1 0,
Homework #02, due 1/27/10 = 9.4.1, 9.4.2, 9.4.5, 9.4.6, 9.4.7. Additional problems recommended for study: (9.4.3), 9.4.4, 9.4.9, 9.4.11, 9.4.13, (9.4.14), 9.4.17 9.4.1 Determine whether the following polynomials
s-convexity, model sets and their relation
s-convexity, model sets and their relation Zuzana Masáková Jiří Patera Edita Pelantová CRM-2639 November 1999 Department of Mathematics, Faculty of Nuclear Science and Physical Engineering, Czech Technical
Local periods and binary partial words: An algorithm
Local periods and binary partial words: An algorithm F. Blanchet-Sadri and Ajay Chriscoe Department of Mathematical Sciences University of North Carolina P.O. Box 26170 Greensboro, NC 27402 6170, USA E-mail:
Factorization Algorithms for Polynomials over Finite Fields
Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is
The common ratio in (ii) is called the scaled-factor. An example of two similar triangles is shown in Figure 47.1. Figure 47.1
47 Similar Triangles An overhead projector forms an image on the screen which has the same shape as the image on the transparency but with the size altered. Two figures that have the same shape but not
MA651 Topology. Lecture 6. Separation Axioms.
MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples
Invertible elements in associates and semigroups. 1
Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary
4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
GENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
Proposition 4: SAS Triangle Congruence
Proposition 4: SAS Triangle Congruence The method of proof used in this proposition is sometimes called "superposition." It apparently is not a method that Euclid prefers since he so rarely uses it, only
Lights and Darks of the Star-Free Star
Lights and Darks of the Star-Free Star Edward Ochmański & Krystyna Stawikowska Nicolaus Copernicus University, Toruń, Poland Introduction: star may destroy recognizability In (finitely generated) trace
GROUP ALGEBRAS. ANDREI YAFAEV
GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite
26 Ideals and Quotient Rings
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 26 Ideals and Quotient Rings In this section we develop some theory of rings that parallels the theory of groups discussed
it is easy to see that α = a
21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore
Solution to Homework 2
Solution to Homework 2 Olena Bormashenko September 23, 2011 Section 1.4: 1(a)(b)(i)(k), 4, 5, 14; Section 1.5: 1(a)(b)(c)(d)(e)(n), 2(a)(c), 13, 16, 17, 18, 27 Section 1.4 1. Compute the following, if
Solutions to In-Class Problems Week 4, Mon.
Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions
C H A P T E R Regular Expressions regular expression
7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun
ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION. E. I. Pancheva, A. Gacovska-Barandovska
Pliska Stud. Math. Bulgar. 22 (2015), STUDIA MATHEMATICA BULGARICA ON LIMIT LAWS FOR CENTRAL ORDER STATISTICS UNDER POWER NORMALIZATION E. I. Pancheva, A. Gacovska-Barandovska Smirnov (1949) derived four
2. Let H and K be subgroups of a group G. Show that H K G if and only if H K or K H.
Math 307 Abstract Algebra Sample final examination questions with solutions 1. Suppose that H is a proper subgroup of Z under addition and H contains 18, 30 and 40, Determine H. Solution. Since gcd(18,
So let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
Max-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER
Séminaire Lotharingien de Combinatoire 53 (2006), Article B53g ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER RON M. ADIN AND YUVAL ROICHMAN Abstract. For a permutation π in the symmetric group
CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation
CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation Prof. David Marshall School of Computer Science & Informatics Factorisation Factorisation is a way of
Separation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
k, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
Group Fundamentals. Chapter 1. 1.1 Groups and Subgroups. 1.1.1 Definition
Chapter 1 Group Fundamentals 1.1 Groups and Subgroups 1.1.1 Definition A group is a nonempty set G on which there is defined a binary operation (a, b) ab satisfying the following properties. Closure: If
Chapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries
Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do
Row Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
CHAPTER 5. Number Theory. 1. Integers and Division. Discussion
CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a
Summary. Operations on Fuzzy Sets. Zadeh s Definitions. Zadeh s Operations T-Norms S-Norms. Properties of Fuzzy Sets Fuzzy Measures
Summary Operations on Fuzzy Sets Zadeh s Operations T-Norms S-Norms Adriano Cruz 00 NCE e IM/UFRJ [email protected] Properties of Fuzzy Sets Fuzzy Measures One should not increase, beyond what is necessary,
3.1 Triangles, Congruence Relations, SAS Hypothesis
Chapter 3 Foundations of Geometry 2 3.1 Triangles, Congruence Relations, SAS Hypothesis Definition 3.1 A triangle is the union of three segments ( called its side), whose end points (called its vertices)
Factoring finite abelian groups
Journal of Algebra 275 (2004) 540 549 www.elsevier.com/locate/jalgebra Factoring finite abelian groups A.D. Sands Department of Mathematics, Dundee University, Dundee DD1 4HN, Scotland, UK Received 1 April
Baltic Way 1995. Västerås (Sweden), November 12, 1995. Problems and solutions
Baltic Way 995 Västerås (Sweden), November, 995 Problems and solutions. Find all triples (x, y, z) of positive integers satisfying the system of equations { x = (y + z) x 6 = y 6 + z 6 + 3(y + z ). Solution.
SMALL SKEW FIELDS CÉDRIC MILLIET
SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite
A simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
Unit 3 Boolean Algebra (Continued)
Unit 3 Boolean Algebra (Continued) 1. Exclusive-OR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication
Linear Algebra. A vector space (over R) is an ordered quadruple. such that V is a set; 0 V ; and the following eight axioms hold:
Linear Algebra A vector space (over R) is an ordered quadruple (V, 0, α, µ) such that V is a set; 0 V ; and the following eight axioms hold: α : V V V and µ : R V V ; (i) α(α(u, v), w) = α(u, α(v, w)),
Chapter 7: Products and quotients
Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products
How To Factor By Gcf In Algebra 1.5
7-2 Factoring by GCF Warm Up Lesson Presentation Lesson Quiz Algebra 1 Warm Up Simplify. 1. 2(w + 1) 2. 3x(x 2 4) 2w + 2 3x 3 12x Find the GCF of each pair of monomials. 3. 4h 2 and 6h 2h 4. 13p and 26p
Finite dimensional C -algebras
Finite dimensional C -algebras S. Sundar September 14, 2012 Throughout H, K stand for finite dimensional Hilbert spaces. 1 Spectral theorem for self-adjoint opertors Let A B(H) and let {ξ 1, ξ 2,, ξ n
Continued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS
SOME PROPERTIES OF FIBER PRODUCT PRESERVING BUNDLE FUNCTORS Ivan Kolář Abstract. Let F be a fiber product preserving bundle functor on the category FM m of the proper base order r. We deduce that the r-th
1. Find the length of BC in the following triangles. It will help to first find the length of the segment marked X.
1 Find the length of BC in the following triangles It will help to first find the length of the segment marked X a: b: Given: the diagonals of parallelogram ABCD meet at point O The altitude OE divides
Homework until Test #2
MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such
CH3 Boolean Algebra (cont d)
CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations
Section 8.8. 1. The given line has equations. x = 3 + t(13 3) = 3 + 10t, y = 2 + t(3 + 2) = 2 + 5t, z = 7 + t( 8 7) = 7 15t.
. The given line has equations Section 8.8 x + t( ) + 0t, y + t( + ) + t, z 7 + t( 8 7) 7 t. The line meets the plane y 0 in the point (x, 0, z), where 0 + t, or t /. The corresponding values for x and
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan
Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers
Quotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
On an algorithm for classification of binary self-dual codes with minimum distance four
Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory June 15-21, 2012, Pomorie, Bulgaria pp. 105 110 On an algorithm for classification of binary self-dual codes with minimum
INTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN. Part II: Group Theory
Solutions to TOPICS IN ALGEBRA I.N. HERSTEIN Part II: Group Theory No rights reserved. Any part of this work can be reproduced or transmitted in any form or by any means. Version: 1.1 Release: Jan 2013
Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization
Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative
How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)
Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness
FACTORING IN QUADRATIC FIELDS. 1. Introduction. This is called a quadratic field and it has degree 2 over Q. Similarly, set
FACTORING IN QUADRATIC FIELDS KEITH CONRAD For a squarefree integer d other than 1, let 1. Introduction K = Q[ d] = {x + y d : x, y Q}. This is called a quadratic field and it has degree 2 over Q. Similarly,
Matrix Representations of Linear Transformations and Changes of Coordinates
Matrix Representations of Linear Transformations and Changes of Coordinates 01 Subspaces and Bases 011 Definitions A subspace V of R n is a subset of R n that contains the zero element and is closed under
The confidence-probability semiring Günther J. Wirsching Markus Huber Christian Kölbl
UNIVERSITÄT AUGSBURG The confidence-probability semiring Günther J. Wirsching Markus Huber Christian Kölbl Report 2010-04 April 2010 INSTITUT FÜR INFORMATIK D-86135 AUGSBURG 2 Copyright c Günther J. Wirsching,
