Domination and Independence Numbers of Γ(Z n )
|
|
- Lindsey Bruce
- 5 years ago
- Views:
Transcription
1 International Mathematical Forum, 3, 008, no. 11, Domination and Independence Numbers of Γ(Z n ) Emad E. AbdAlJawad and Hasan Al-Ezeh 1 Department of Mathematics, Faculty of Science Jordan University, Amman 1194, Jordan e.abdaljawad@yahoo.com, alezehh@ju.edu.jo Abstract The zero divisor graph of a commutative ring with one ( say R) isa graph whose vertices are the nonzero zero-divisors of this ring, with two distinct vertices are adjacent in case their product is zero. This graph is denoted by Γ(R). We evaluate the domination number of Γ(Z n ). We find out that the domination number of Γ(Z p α 1 1 pα... pα ) is equal to. We compute the independence number of Γ(Z n ) for some cases of n. For instance we evaluate the the independence number of Γ(Z p ), Γ(Z p q ), and Γ(Z pq ). Mathematics Subject Classification: Primary: 13A99; Secondary: 05C69 Keywords: Zero-divisor graph, Domination number, Independence number 1 Introduction Zero-divisor graphs first introduced by Bec, see [4]. Bec were mainly interested in graph coloring. In his wor, he let the elements of a commutative ring R to be the vertices of the graph and two distinct vertices x and y are adjacent if xy = 0. In a subsequent wor, Anderson and Livingston introduce the zero-divisor graph of a commutative ring R, see []. In their definition, they let the nonzero zero-divisors of R to be the set of vertices for the graph and two distinct vertices x and y are adjacent if xy = 0. Usually the set of zero-divisors of R is denoted by Z(R) and the set of nonzero zero-divisors of R is denoted by Z (R) =Z(R) {0}. The zero-divisor graph of R, Γ(Z (R)), is usually written Γ(R). The definition of the zero-divisor graph that was given 1 This wor is a part of a doctoral dissertation done by the first author and supervised by the second author. Corresponding author: Hasan Al-Ezeh.
2 504 E. E. AbdAlJawad and H. Al-Ezeh by Anderson and Livingston is the one that have been used in the literature now. Also in this paper we will use their definition. Many articles have been done on zero-divisor graphs, the reader is advised to consult [1,, 3, 7] for more details. Some researchers generalized the idea to commutative semigroups, see [5, 6]. Others wored on the noncommutative case where they introduce the directed graph related to the zero divisors of noncommutative rings. For more information see [9, 10, 11]. A dominating set in a graph Γ is a subset of the vertex set of Γ with the property that every vertex in Γ is either in the dominating set or adjacent to a vertex that is in the dominating set. The domination number of Γ, denoted by Domn(Γ), is defined as the cardinality of a minimum dominating set of Γ. Next we compute the domination number of Γ(Z n ). The Domination Number of Γ(Z n ) First we give the Domn(Γ(Z n )) where n is a prime power or two multiplied by a prime. Lemma 1. For Γ(Z n ),ifn = p, where p is a prime number, then Domn(Γ(Z n )) = 1. Also if n =p then Domn(Γ(Z n ))=1. Proof. If n = p then x = p 1 is adjacent to every other element in Γ(Z n ) and hence Domn(Γ(Z n )) = 1. Now, if n =p then the vertex set of Γ(Z n )is {,,..., (p 1),p}. It is clear that the vertex p is adjacent to every other vertex and hence Domn(Γ(Z n )) is equal to one. Lemma. Let n = p α 1 1 p α...p α where p 1,p,...,p are distinct primes and the α i s are positive integers. Also suppose that n p and n is not a prime power. Let D be any dominating set in Γ(Z n ) with minimum cardinality among all dominating sets. Then, for every i {1...}, D must contain at least one vertex from G i = {sp α p α i 1 i...p α : gcd(s, p i )=1} Proof. Tae F i = {rp i : gcd(r, p α pα i 1 i...p α )=1} then F i is a set of null vertices for every i. We have every vertex in F i is only adjacent to every vertex in G i. Suppose that D doesn t contain any vertex from G i0 for some i 0. Since D is a dominating set then D will contain all the vertices of F i0. Since n p we get the size of F i0 is greater than or equal to two. Now tae K =(D F i0 ) {h} where h is an element of G i0. We have, K is a dominating set where the size of K is less than the size of D. This contradicts the fact that D is a dominating set with minimum cardinality. Hence D will contain at least one element from G i for every i. Next we use the previous lemmas to find Domn(Γ(Z n )).
3 Domination and independence numbers 505 Theorem 1. (a) If n =p, where p is any prime number, then Domn(Γ(Z n )) = 1. (b) If n = p α 1, where p is any prime number and α 1 is a positive integer, then Domn(Γ(Z n )) = 1. (c) Let n = p α 1 1 pα...pα where p 1,p,...,p are distinct primes and the α i s are positive integers. Also suppose that n p and n is not a prime power. In this case Domn(Γ(Z n )) = Proof. The proof of (a) and (b) is in Lemma 1. For (c), let D be a set that contain exactly one element of G i = {sp α p α i 1 i...p α : gcd(s, p i )=1} for every i {1,,...,}, say this element is s i p α pα i 1 i...p α. We want to show that D is a dominating set with minimum cardinality. If x is any zero divisor of Z n then x is divisible by p i0 for some i 0 {1,,...,} and so x is adjacent to s i0 p α pα i 0 1 i 0...p α. Hence D is a dominating set. Using Lemma, any dominating set of Γ(Z n ) has at least one element of G i for every i {1,,...,n} and hence D has a minimum cardinality. 3 The Independence Number of Γ(Z n ) An independent set in a graph Γ is a subset I of the vertex set of Γ such that no two vertices of I are adjacent i.e. I is a subset of null vertices. The independence number of Γ, denoted by Indep(Γ), is defined as the cardinality of a maximum independent set of Γ. In this section we will compute the independence number of Γ(Z n ) for some cases of n. We present some nown algorithms to compute the zero-divisor graph of Z n for some cases of n. Some of these algorithms were presented by Joan Krone. For more details see [8]. Case 1: If n = p for some prime p and positive integer. One can find the zero-divisors of Z p by taing the numbers 1,,p 1 1 then multiply those numbers by p. One can divide the zero-divisors into 1 sets according to how many factors of p each divisor has. These sets are S p i = {sp i : gcd(s, p i )=1} where i {1,,..., 1}. Connect the vertices of the set S p i to the vertices of the set S p j when i + j. This way one can build the zero-divisor graph of Z p. The use of the Euler s phi-function gives the sizes of the S p i s and one will get S p i = p i p (i+1). Case : If n = p q r where p and q are distinct primes and and r are positive integers. One can divide the zero-divisors into three families. The first family is S p i = {sp i : gcd(s, p i q r )=1} where i {1,,...,}. The second family is S q i = {sq i : gcd(s, p q r i )=1} where i {1,,...,r}. The third family is S p i q j = {spi q j : gcd(s, p i q r j )=1} where i {1,,...,}, j {1,,...,r} and we can not have both i = and j = r. Connect elements
4 506 E. E. AbdAlJawad and H. Al-Ezeh of S p i to elements of S p i q j if i + i and j = r. Similarly, connect elements of S q j to elements of S p i q j if j + j r and i =. Connect elements of S p i q j to elements of S p i q j if i + i and j + j r. The next lemma gives the sizes of these sets. Lemma 3. 1) S p i = q r 1 p i 1 (p 1)(q 1) for i {1,..., 1} and S p = q r 1 (q 1). ) S q i = p 1 q r i 1 (q 1)(p 1) for i {1,...,r 1} and S q r = p 1 (p 1). 3) S p i q j = p i 1 q r j 1 (p 1)(q 1) for i {1,..., 1} and j {1,...,r 1}. S p q j = qr j 1 (q 1) and S p i q r = p i 1 (p 1). Proof. We will show that S p i = q r 1 p i 1 (p 1)(q 1). For the other sets the proof is similar. Tae T i = {p i, p i, 3p i,...,(p i q r )p i } {q, q, 3q,..., (p i q r 1 )q}. Note that T i is the set of elements that are divisible by p i and not divisible by any power of q. Tae T i+1 = { p i+1, p i+1, 3p i+1,..., (p i 1 q r )p i+1 } {q,q, 3q,..., (p i 1 q r 1 )q}. Also T i+1 is the set of elements that are divisible by p i+1 and not divisible by any power of q. We have S p i = T i T i+1 and hence S p i = T i T i+1 = p i q r p i q r 1 (p i 1 q r p i 1 q r 1 ) = q r 1 p i (q 1) q r 1 p i 1 ( 1+q) = q r 1 p (q 1)(p i p i 1 ) = q r 1 p i 1 (q 1)(p 1) The next theorem gives the independence number for Γ(Z n ) when n is a prime power. Theorem. Let p be any prime number and let be any positive integer that is greater than or equal to two then 1) If =then Indep(Γ(Z p )) = 1. ) If is an odd integer that is greater than two then we have Indep(Γ(Z p )) = 1 (p 1)p (i+1) = p 1 (p 1 1). 3) If is an even integer that is greater than two then we have 1 Indep(Γ(Z p )) = 1 + (p 1)p (i+1) =1+p 1 (p 1).
5 Domination and independence numbers 507 Proof. 1) It is clear that Indep(Γ(Z p )) = 1. This is because Γ(Z p )isa complete graph. ) According to the algorithm for calculating Γ(Z p ), we have 1 sets. These sets are S p,s p,...,s p 1, where S p i = {sp i : gcd(s, p i )=1}, and as we explain before S p i = p i p (i+1). As we explain in the beginning of this section, elements in S p i are adjacent to elements of S p i if i + i. Tae I = S p i. Observe that I is a set of null vertices and this is because 1 i {1,,..., 1 }. Hence I is an independent set. Since the set i= +1 S p i forms a complete subgraph of Γ(Z p ) we get I is an independent set with maximum cardinality. The size of I, which is the independence number, is equal to I = S p i = p i p (i+1) = (p 1)p (i+1) = p 1 (p 1 1). 3) The proof is similar to that one of ). Theorem 3. If p and q are two distinct primes and is a positive integer with p <qthen Indep(Γ(Z p q)) = p 1 (q 1). Proof. According to the algorithm for calculating Γ(Z p q r) we get Γ(Z p q)= 1 S p i S q S p i q. We will show that I = S p i is an independent set with maximum cardinality among all independent sets in Γ(Z p q). We will show 1 that any independent set that intersects S q or S p i q will have a size that is 1 less than the size of I. Assume M is an independent set with M S p i q and M S q. Since the elements of S q are only connected to the elements of S p and M contains elements of S q then M S p =. Let T = {i : 1 M S p i q } and observe that T is nonempty because M S p i q. Since S p i q is connected to S p i we get M S p i = for all i T. Hence M S q S p i q S p i where T c = {1,,...,} T. We will estimate the size of i T i T c M. We have M S q + S p i q + S p i < S p + S p i + S p i. i T i T c i T i T c This is because S p i q = p i p i 1 < (q 1)(p i p i 1 ) = S p i and S q = p p 1 <q 1=S p. These less than because p <q. Hence we have
6 508 E. E. AbdAlJawad and H. Al-Ezeh M < S p + S p i + S p i = S p i = I. If M is a independent i T i T c 1 set with M S p i q and M S q = or M is an independent set with 1 M S p i q = and M S q then in the same way we can show that M < S p i. Thus S p i is an independent set with maximum cardinality among all independent sets in Γ(Z p q). The independence number in this case 1 is S p i = S p i = (q 1)(p 1)p i 1 + q 1=p 1 (q 1). Theorem 4. If p and q are two distinct primes and is a positive integer with p<qthen Indep(Γ(Z pq )) = { q 1 (q 1) + p(q 1 q 1 ) if is an odd integer, q 1 (q 1) + p(q 1 q )+1 if is an even integer. Proof. We show the result when is an odd integer. When is even the proof is similar. According to the algorithm for calculating Γ(Z p qr) we get Γ(Z pq )=S p S q i S pq i. We will show that I = S p S q i S pq i is a an independent set with maximum cardinality among all independent sets in Γ(Z pq ). Let M be any independent set in Γ(Z pq ). We will show that if 1 M intersects S pq i or intersects S q i then the cardinality of M is less i= +1 i= +1 than the cardinality of I. Suppose that M 1 i= +1 S pq i. Since 1 i= +1 complete subgraph and M is an independent set then M will contain only one 1 element from S pq i. This element, say w, is adjacent to all the elements in 1 i= 1 S pq i i= +1 i= 1 S q i. Hence M is a subset of the size of M is less that the size of I. S pq i 3 3 S pq i is a S q i S p {w}. Hence
7 Domination and independence numbers 509 Now, suppose that M i= +1 {i : M S q i }. Since M S q i. Let t be the maximum of the set i= +1 S q i we get t> +1. We will assume that t. Indeed if t = then the proof is similar. Since M S q t and M is an t t 1 independent set we get M S pq i =. Hence M S p S q i S pq i. i= t For any i { +1,..., 1} we have S q i =(p 1)q i 1 (q 1) <q i 1 (q 1) = q ( i) 1 (q 1) = S pq i and the less than because p<qand i> +1. Using this we get M S p + = S p + < S p + = S p + = I. t t 1 t i= +1 1 i= t 1 + t 1 t 1 Hence the size of M is less than the size of I. Thus the independence number of Γ(Z pq )is Indep(Γ(Z pq )) = S p + 1 = q 1 (q 1) q i 1 (q 1)(p 1) + = q 1 (q 1) + p(q 1 q 1 ) q i 1 (q 1) 1 Theorem 5. If p and q are two distinct primes with p<qthen Indep(Γ(Z p q )) = (q 1)(p + pq p)+1
8 510 E. E. AbdAlJawad and H. Al-Ezeh Proof. According to the algorithm for calculating Γ(Z p q r) we get Γ(Z p q )= S p S q S p S q S pq S p q S pq. The set I = S p S q S p {a}, where a S pq, is an independent set in Γ(Z p q). We will show that I has a maximum cardinality among all independent sets in Γ(Z p q ). Assume that M is any independent set in Γ(Z p q ). Observe that T = S pq S p q S pq is a complete subgraph of Γ(Z p q). Since M is an independent set then M intersects T in at most one element. If M contains no elements from T then M is a subset of either S p S q S p or S p S q S q. Observe that S p S q S q < S p S q S p < I and this is because p<q. Hence the size of M is less than the size of I. IfM contain an element of T,sayw, and w S p q or w S pq then M is a subset of either S p S p {w} or S q S q {w} and this is because M is an independent set. In both cases we get M < I. If w S pq then M is a subset of either S p S q S p {w} or S p S q S q {w} and this is because M is an independent set. We have S p S q S q {w} < S p S q S p {w} and this is because p<q. Hence an independent set with maximum cardinality is S p S q S p {w}. Thus I is an independent set with maximum cardinality among all independent sets in Γ(Z p q ). The size of I, which is the independence number of Γ(Z p q), is equal to (p 1)(q 1)q+(q 1)p(p 1)+q(q 1)+1 = (q 1)(p +pq p)+1. Acnowledgements. The authors wishes to express deep gratitude to Omar A. AbuGhneim for his useful ideas and helpful suggestion that improved this wor considerably. References [1] E. E. AbdAlJawad, Some Properties of the Zero-Divisor Graph of the Ring of Dual Numbers of a Commuatitive Ring, Doctoral Dissertation, Jordan University, 007. [] D. F. Anderson and P. S. Livingston, The zero-divisor graph of a commutative ring, J. Algebra, 17 no. (1999), [3] D. F. Anderson, A. Frazier, A. Lauve, and P. S. Livingston, The Zero- Divisor Graph of a Commutative Ring II, 61-7, Ideal theoretic methods in commutative algebra (Columbia, MO, 1999), 61-7, Lecture Notes in Pure and Appl. Math., 0, Deer, New Yor, 001. [4] I. Bec, Coloring of commutative rings, J. Algebra, 116 no. 1 (1988), [5] F. DeMeyer, L. DeMeyer, Zero divisor graphs of semigroups, J. Algebra, 83 no. 1 (005),
9 Domination and independence numbers 511 [6] F. DeMeyer, T. McKenzie, K. Schneider, The zero-divisor graph of a commutative semigroup, Semigroup Forum, 65 no. (00), [7] F. DeMeyer, K. Schneider, Automorphisms and zero divisor graphs of commutative rings, Commutative rings, 5-37, Nova Sci. Publ., Hauppauge, NY, 00. [8] J. Krone, Algorithms for costructing zero-divisor graphs of commutative rings, preprint. [9] S. P. Redmond, The zero-divisor graph of a non-commutative ring, Commutative rings, 39-47, Nova Sci. Publ., Hauppauge, NY, 00. [10] S. P. Redmond, Structure in the zero-divisor graph of a noncommutative ring, Houston J. Math, 30 () (004), [11] T. Wu, On directed zero-divisor graphs of finite rings, Discrete Math., 96 no. 1 (005), Received: September 1, 007
Torsion Graph of Modules
E extracta mathematicae Vol. 26, Núm. 1, 153 163 (2011) Torsion Graph of Modules Sh. Ghalandarzadeh, P. Malakooti Rad Department of Mathematics, Faculty of Science, K. N. Toosi University of Technology,
More informationZero-Divisor Graph with Respect to an Ideal *
Zero-Divisor Graph with Respect to an Ideal * H. R. Maimani, M. R. Pournaki, S. Yassemi Abstract Let R be a commutative ring with nonzero identity and let I be an ideal of R. The zero-divisor graph of
More informationDiameter of the Zero Divisor Graph of Semiring of Matrices over Boolean Semiring
International Mathematical Forum, Vol. 9, 2014, no. 29, 1369-1375 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/imf.2014.47131 Diameter of the Zero Divisor Graph of Semiring of Matrices over
More informationOn the dot product graph of a commutative ring
Ayman Badawi American University of Sharjah, Sharjah, UAE September 25, 2014 Definition Let R be a commutative ring with nonzero identity, and let Z(R) be its set of zero-divisors. Recently, there has
More informationCommunications in Algebra Publication details, including instructions for authors and subscription information:
This article was downloaded by: [Cameron Wickham] On: 21 July 2011, At: 21:08 Publisher: Taylor & Francis Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
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 informationOn the torsion graph and von Neumann regular rings
Filomat 26:2 (2012), 253 259 DOI 10.2298/FIL1202253M Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the torsion graph and von
More informationON THE ZERO-DIVISOR GRAPH OF A RING
Communications in Algebra, 36: 3073 3092, 2008 Copyright Taylor & Francis Group, LLC ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870802110888 ON THE ZERO-DIVISOR GRAPH OF A RING David F. Anderson
More informationPerfect Zero-Divisor Graphs of Z_n
Rose-Hulman Undergraduate Mathematics Journal Volume 17 Issue 2 Article 6 Perfect Zero-Divisor Graphs of Z_n Bennett Smith Illinois College Follow this and additional works at: http://scholar.rose-hulman.edu/rhumj
More informationPrime and irreducible elements of the ring of integers modulo n
Prime and irreducible elements of the ring of integers modulo n M. H. Jafari and A. R. Madadi Department of Pure Mathematics, Faculty of Mathematical Sciences University of Tabriz, Tabriz, Iran Abstract
More informationON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING
ITALIAN JOURNAL OF PURE AND APPLIED MATHEMATICS N. 39 2018 (128 139) 128 ON GENERALIZED ZERO-DIVISOR GRAPH ASSOCIATED WITH A COMMUTATIVE RING N. Jahanbakhsh Basharlou Department of Mathematics Karaj Branch
More informationTHE ZERO-DIVISOR GRAPH OF A MODULE
Journal of Algebraic Systems Vol. 4, No. 2, (2017), pp 155-171 DOI: 10.22044/jas.2017.858 THE ZERO-DIVISOR GRAPH OF A MODULE A. R. NAGHIPOUR Abstract. Let R be a commutative ring with identity and M an
More informationarxiv: v2 [math.ac] 23 Feb 2011
arxiv:0808.3187v2 [math.ac] 23 Feb 2011 The Annihilating-Ideal Graph of Commutative Rings I M. Behboodi a,b and Z. Rakeei a a Department of Mathematical Science, Isfahan University of Technology, P. O.
More informationarxiv: v1 [math.ac] 28 Jun 2018
arxiv:1806.11442v1 [math.ac] 28 Jun 2018 On a new extension of the zero-divisor graph A. Cherrabi, H. Essannouni, E. Jabbouri,, A. Ouadfel Laboratory of Mathematics, Computing and Applications-Information
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationDiameter and girth of Torsion Graph
DOI: 10.2478/auom-2014-0054 An. Şt. Univ. Ovidius Constanţa Vol. 22(3),2014, 127 136 Diameter and girth of Torsion Graph P. Malakooti Rad 1, S. Yassemi 2, Sh. Ghalandarzadeh 3, P. Safari Abstract Let R
More informationFACTOR GRAPH OF NON-COMMUTATIVE RING
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 9, Issue 6, November - December 2018, pp. 178 183, Article ID: IJARET_09_06_019 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=9&itype=6
More informationZero-Divisor Graph of Triangular Matrix Rings over Commutative Rings 1
International Journal of Algebra, Vol 5, 2011, no 6, 255-260 Zero-Divisor Graph of Triangular Matrix Rings over Commutative Rings 1 Li Bingjun 1,2 1 College of Mathematics Central South University Changsha,
More informationOn directed zero-divisor graphs of finite rings
Discrete Mathematics 296 (2005) 73 86 www.elsevier.com/locate/disc On directed zero-divisor graphs of finite rings Tongsuo Wu Department of Mathematics, Shanghai Jiaotong University, Shanghai 200030, PR
More informationINFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS
INFINITE RINGS WITH PLANAR ZERO-DIVISOR GRAPHS YONGWEI YAO Abstract. For any commutative ring R that is not a domain, there is a zerodivisor graph, denoted Γ(R), in which the vertices are the nonzero zero-divisors
More informationSome results on the reduced power graph of a group
Some results on the reduced power graph of a group R. Rajkumar and T. Anitha arxiv:1804.00728v1 [math.gr] 2 Apr 2018 Department of Mathematics, The Gandhigram Rural Institute-Deemed to be University, Gandhigram
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationON QUASI-ZERO DIVISOR GRAPHS OF NON-COMMUTATIVE RINGS. Communicated by S. Alikhani
Algebraic Structures and Their Applications Vol. 5 No. 2 (2018 ) pp 1-13. ON QUASI-ZERO DIVISOR GRAPHS OF NON-COMMUTATIVE RINGS RAZIEH AMIRJAN AND EBRAHIM HASHEMI Communicated by S. Alikhani Abstract.
More informationVarious Topics on Graphical Structures Placed on Commutative Rings
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 8-2017 Various Topics on Graphical Structures Placed on Commutative Rings Darrin
More informationOn Zero Divisor Graphs of Multiplicative Lattices Minor Research Project [47 496/12(W RO)] Submitted to. University Grants Commission, New Delhi
On Zero Divisor Graphs of Multiplicative Lattices Minor Research Project [47 496/12(W RO)] Submitted to University Grants Commission, New Delhi By Mr. Sachin Vitthalrao Sarode Assistant Professor Department
More informationOn zero divisor graph of unique product monoid rings over Noetherian reversible ring
Volume 4, Number 1, February 2016, 95-113 On zero divisor graph of unique product monoid rings over Noetherian reversible ring E. Hashemi, A. Alhevaz, and E. Yoonesian Abstract. Let R be an associative
More informationTotal Graph and Complemented Graph of a Rough Semiring
Gazi University Journal of Science GU J Sci 29(2):459-466 (2016) Total Graph and Complemented Graph of a Rough Semiring B.PRABA 1, A. MANIMARAN 2,, V. M. CHANDRASEKARAN 2 1 SSN College of Engineering,
More informationMATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM
MATH 3030, Abstract Algebra FALL 2012 Toby Kenney Midyear Examination Friday 7th December: 7:00-10:00 PM Basic Questions 1. Compute the factor group Z 3 Z 9 / (1, 6). The subgroup generated by (1, 6) is
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More informationZero-Divisor Graphs of Idealizations with Respect to Prime Modules
Int. J. Contemp. Math. Sciences, Vol. 2, 2007, no. 26, 1279-1283 Zero-Divisor Graphs of Idealizations with Respect to Prime Modules Shahabaddin Ebrahimi Atani Department of Mathematics University of Guilan
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationRINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS
RINGS ISOMORPHIC TO THEIR NONTRIVIAL SUBRINGS JACOB LOJEWSKI AND GREG OMAN Abstract. Let G be a nontrivial group, and assume that G = H for every nontrivial subgroup H of G. It is a simple matter to prove
More informationMATH 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 informationARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS
ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers
More informationProperties of Ideal-Based Zero-Divisor Graphs of Commutative Rings
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 5-2014 Properties of Ideal-Based Zero-Divisor Graphs of Commutative Rings Jesse
More informationMinimal free resolutions for certain affine monomial curves
Contemporary Mathematics Volume 555, 11 Minimal free resolutions for certain affine monomial curves Philippe Gimenez, Indranath Sengupta, and Hema Srinivasan This paper is dedicated to Wolmer V Vasconcelos
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL NUMBERS. Ryan Gipson and Hamid Kulosman
International Electronic Journal of Algebra Volume 22 (2017) 133-146 DOI: 10.24330/ieja.325939 ATOMIC AND AP SEMIGROUP RINGS F [X; M], WHERE M IS A SUBMONOID OF THE ADDITIVE MONOID OF NONNEGATIVE RATIONAL
More informationAn other approach of the diameter of Γ(R) and Γ(R[X])
arxiv:1812.08212v1 [math.ac] 19 Dec 2018 An other approach of the diameter of Γ(R) and Γ(R[X]) A. Cherrabi, H. Essannouni, E. Jabbouri, A. Ouadfel Laboratory of Mathematics, Computing and Applications-Information
More informationSOME ASPECTS OF PRIME GRAPH OF SOME RINGS
SOME ASPECTS OF PRIME GRAPH OF SOME RINGS An Abstract Submitted to Gauhati University for the Degree of Doctor of Philosophy in Mathematics in the Faculty of Science Submitted by Sanjoy Kalita 2014 SYNOPSIS
More informationMATH10040 Chapter 1: Integers and divisibility
MATH10040 Chapter 1: Integers and divisibility Recall the basic definition: 1. Divisibilty Definition 1.1. If a, b Z, we say that b divides a, or that a is a multiple of b and we write b a if there is
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More informationName: Solutions Final Exam
Instructions. Answer each of the questions on your own paper. Be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. 1. [10 Points] All of
More informationSome generalizations of a supercongruence of van Hamme
Some generalizations of a supercongruence of van Hamme Victor J. W. Guo School of Mathematical Sciences, Huaiyin Normal University, Huai an, Jiangsu 3300, People s Republic of China jwguo@hytc.edu.cn Abstract.
More informationOn Dual Versions of Krull s Intersection Theorem
International Mathematical Forum, 2, 2007, no. 54, 2655-2659 On Dual Versions of Krull s Intersection Theorem H. Ansari-Toroghy and F. Farshadifar Department of Mathematics Faculty of Science, Guilan University
More informationPGSS Discrete Math Solutions to Problem Set #4. Note: signifies the end of a problem, and signifies the end of a proof.
PGSS Discrete Math Solutions to Problem Set #4 Note: signifies the end of a problem, and signifies the end of a proof. 1. Prove that for any k N, there are k consecutive composite numbers. (Hint: (k +
More informationZERO-DIVISOR GRAPHS OF AMALGAMATIONS ( )
ZERO-DIVISOR GRAPHS OF AMALGAMATIONS ( ) S. KABBAJ and A. MIMOUNI Abstract Let f : A B be a homomorphism of commutative rings and let J be an ideal of B. The amalgamation of A with B along J with respect
More informationarxiv: v2 [math.co] 31 Jul 2015
The rainbow connection number of the power graph of a finite group arxiv:1412.5849v2 [math.co] 31 Jul 2015 Xuanlong Ma a Min Feng b,a Kaishun Wang a a Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal
More informationThe Congruence-Based Zero-Divisor Graph
University of Tennessee, Knoxville Trace: Tennessee Research and Creative Exchange Doctoral Dissertations Graduate School 8-2015 The Congruence-Based Zero-Divisor Graph Elizabeth Fowler Lewis University
More informationarxiv: v1 [math.gn] 14 Feb 2018
SOME MORE ALGEBRA ON ULTRAFILTERS IN METRIC SPACES IGOR PROTASOV arxiv:1802.05224v1 [math.gn] 14 Feb 2018 Abstract. We continue algebraization of the set of ultrafilters on a metric spaces initiated in
More informationAlgebraically defined graphs and generalized quadrangles
Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number
More informationOn the stable set of associated prime ideals of monomial ideals and square-free monomial ideals
On the stable set of associated prime ideals of monomial ideals and square-free monomial ideals Kazem Khashyarmanesh and Mehrdad Nasernejad The 10th Seminar on Commutative Algebra and Related Topics, 18-19
More informationRINGS HAVING ZERO-DIVISOR GRAPHS OF SMALL DIAMETER OR LARGE GIRTH. S.B. Mulay
Bull. Austral. Math. Soc. Vol. 72 (2005) [481 490] 13a99, 05c99 RINGS HAVING ZERO-DIVISOR GRAPHS OF SMALL DIAMETER OR LARGE GIRTH S.B. Mulay Let R be a commutative ring possessing (non-zero) zero-divisors.
More informationZERO DIVISOR GRAPHS OF POSETS
ZERO DIVISOR GRAPHS OF POSETS A Thesis submitted to the University of Pune for the degree of Doctor of Philosophy in Mathematics By Ms. Anagha Uday Khiste Under the guidance of Dr. Vinayak V. Joshi Department
More informationNote on group distance magic complete bipartite graphs
Cent. Eur. J. Math. 12(3) 2014 529-533 DOI: 10.2478/s11533-013-0356-z Central European Journal of Mathematics Note on group distance magic complete bipartite graphs Research Article Sylwia Cichacz 1 1
More informationg(x) = 1 1 x = 1 + x + x2 + x 3 + is not a polynomial, since it doesn t have finite degree. g(x) is an example of a power series.
6 Polynomial Rings We introduce a class of rings called the polynomial rings, describing computation, factorization and divisibility in such rings For the case where the coefficients come from an integral
More informationA finite universal SAGBI basis for the kernel of a derivation. Osaka Journal of Mathematics. 41(4) P.759-P.792
Title Author(s) A finite universal SAGBI basis for the kernel of a derivation Kuroda, Shigeru Citation Osaka Journal of Mathematics. 4(4) P.759-P.792 Issue Date 2004-2 Text Version publisher URL https://doi.org/0.890/838
More informationBulletin of the. Iranian Mathematical Society
ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 41 (2015), No. 4, pp. 815 824. Title: Pseudo-almost valuation rings Author(s): R. Jahani-Nezhad and F.
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 informationPolynomial Rings : Linear Algebra Notes
Polynomial Rings : Linear Algebra Notes Satya Mandal September 27, 2005 1 Section 1: Basics Definition 1.1 A nonempty set R is said to be a ring if the following are satisfied: 1. R has two binary operations,
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationSplitting sets and weakly Matlis domains
Commutative Algebra and Applications, 1 8 de Gruyter 2009 Splitting sets and weakly Matlis domains D. D. Anderson and Muhammad Zafrullah Abstract. An integral domain D is weakly Matlis if the intersection
More informationON 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 information6]. (10) (i) Determine the units in the rings Z[i] and Z[ 10]. If n is a squarefree
Quadratic extensions Definition: Let R, S be commutative rings, R S. An extension of rings R S is said to be quadratic there is α S \R and monic polynomial f(x) R[x] of degree such that f(α) = 0 and S
More informationUnit Graph of Some Finite Group Z n, C n and D n
Unit Graph of Some Finite Group Z n, C n and D n A. D. Godase Department of Mathematics, V. P. College, Vaijapur, Aurangabad - 423701. (Maharashtra, India) ashokgodse2012@gmail.com Abstract We represent
More informationAlgebra Review. Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor. June 15, 2001
Algebra Review Instructor: Laszlo Babai Notes by Vincent Lucarelli and the instructor June 15, 2001 1 Groups Definition 1.1 A semigroup (G, ) is a set G with a binary operation such that: Axiom 1 ( a,
More informationAP-DOMAINS AND UNIQUE FACTORIZATION
AP-DOMAINS AND UNIQUE FACTORIZATION JIM COYKENDALL AND MUHAMMAD ZAFRULLAH Abstract. In this paper we generalize the standard notion of unique factorization domains (UFDs) to the the nonatomic situation.
More informationThe power graph of a finite group, II
The power graph of a finite group, II Peter J. Cameron School of Mathematical Sciences Queen Mary, University of London Mile End Road London E1 4NS, U.K. Abstract The directed power graph of a group G
More informationREVIEW Chapter 1 The Real Number System
REVIEW Chapter The Real Number System In class work: Complete all statements. Solve all exercises. (Section.4) A set is a collection of objects (elements). The Set of Natural Numbers N N = {,,, 4, 5, }
More informationZ Halkası Üzerinde Nilpotent Grafların Laplasyan Spektral Özellikleri Sezer Sorgun *1, H. Pınar Cantekin 2
Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, Vol(No): pp, year SAKARYA ÜNİVERSİTESİ FEN BİLİMLERİ ENSTİTÜSÜ DERGİSİ SAKARYA UNIVERSITY JOURNAL OF SCIENCE e-issn: 2147-835X Dergi sayfası:http://dergipark.gov.tr/saufenbilder
More informationThis exam contains 5 pages (including this cover page) and 4 questions. The total number of points is 100. Grade Table
MAT115A-21 Summer Session 2 2018 Practice Final Solutions Name: Time Limit: 1 Hour 40 Minutes Instructor: Nathaniel Gallup This exam contains 5 pages (including this cover page) and 4 questions. The total
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationMonomial transformations of the projective space
Monomial transformations of the projective space Olivier Debarre and Bodo Lass Abstract We prove that, over any field, the dimension of the indeterminacy locus of a rational map f : P n P n defined by
More informationRELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 39 No. 4 (2013), pp 663-674. RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS A. ERFANIAN AND B. TOLUE Communicated by Ali Reza Ashrafi Abstract. Suppose
More informationDevil s Staircase Rotation Number of Outer Billiard with Polygonal Invariant Curves
Devil s Staircase Rotation Number of Outer Billiard with Polygonal Invariant Curves Zijian Yao February 10, 2014 Abstract In this paper, we discuss rotation number on the invariant curve of a one parameter
More informationON NIL SEMI CLEAN RINGS *
Jordan Journal of Mathematics and Statistics (JJMS) 2 (2), 2009, pp. 95-103 ON NIL SEMI CLEAN RINGS * MOHAMED KHEIR AHMAD OMAR AL-MALLAH ABSTRACT: In this paper, the notions of semi-idempotent elements
More informationJ. Combin. Theory Ser. A 116(2009), no. 8, A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE
J. Combin. Theory Ser. A 116(2009), no. 8, 1374 1381. A NEW EXTENSION OF THE ERDŐS-HEILBRONN CONJECTURE Hao Pan and Zhi-Wei Sun Department of Mathematics, Naning University Naning 210093, People s Republic
More informationTripotents: a class of strongly clean elements in rings
DOI: 0.2478/auom-208-0003 An. Şt. Univ. Ovidius Constanţa Vol. 26(),208, 69 80 Tripotents: a class of strongly clean elements in rings Grigore Călugăreanu Abstract Periodic elements in a ring generate
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationOn balanced colorings of sparse hypergraphs
On balanced colorings of sparse hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu January 21, 2014 Abstract We investigate 2-balanced colorings
More informationMATH 145 Algebra, Solutions to Assignment 4
MATH 145 Algebra, Solutions to Assignment 4 1: a Let a 975 and b161 Find d gcda, b and find s, t Z such that as + bt d Solution: The Euclidean Algorithm gives 161 975 1 + 86, 975 86 3 + 117, 86 117 + 5,
More informationMath 324, Fall 2011 Assignment 7 Solutions. 1 (ab) γ = a γ b γ mod n.
Math 324, Fall 2011 Assignment 7 Solutions Exercise 1. (a) Suppose a and b are both relatively prime to the positive integer n. If gcd(ord n a, ord n b) = 1, show ord n (ab) = ord n a ord n b. (b) Let
More informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More information3 Boolean Algebra 3.1 BOOLEAN ALGEBRA
3 Boolean Algebra 3.1 BOOLEAN ALGEBRA In 1854, George Boole introduced the following formalism which eventually became Boolean Algebra. Definition. An algebraic system consisting of a set B of elements
More informationQuestionnaire for CSET Mathematics subset 1
Questionnaire for CSET Mathematics subset 1 Below is a preliminary questionnaire aimed at finding out your current readiness for the CSET Math subset 1 exam. This will serve as a baseline indicator for
More informationGROUPS AS GRAPHS. W. B. Vasantha Kandasamy Florentin Smarandache
GROUPS AS GRAPHS W. B. Vasantha Kandasamy Florentin Smarandache 009 GROUPS AS GRAPHS W. B. Vasantha Kandasamy e-mail: vasanthakandasamy@gmail.com web: http://mat.iitm.ac.in/~wbv www.vasantha.in Florentin
More informationGeneralizations of Primary Ideals
Generalizations of Primary Ideals Christine E. Gorton Faculty Advisor: Henry Heatherly Department of Mathematics University of Louisiana at Lafayette Lafayette, LA 70504-1010 ABSTRACT This paper looks
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 3 Due Friday, February 5 at 08:35 1. Let R 0 be a commutative ring with 1 and let S R be the subset of nonzero elements which are not zero divisors. (a)
More informationAN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION
AN ALGEBRAIC PROOF OF RSA ENCRYPTION AND DECRYPTION Recall that RSA works as follows. A wants B to communicate with A, but without E understanding the transmitted message. To do so: A broadcasts RSA method,
More information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #5 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 10: Proofs by Contradiction and Contraposition 1. Prove the following statement
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationHow many units can a commutative ring have?
How many units can a commutative ring have? Sunil K. Chebolu and Keir Locridge Abstract. László Fuchs posed the following problem in 960, which remains open: classify the abelian groups occurring as the
More informationTHE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS. Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND.
THE HALF-FACTORIAL PROPERTY IN INTEGRAL EXTENSIONS Jim Coykendall Department of Mathematics North Dakota State University Fargo, ND. 58105-5075 ABSTRACT. In this paper, the integral closure of a half-factorial
More informationarxiv: v1 [math.co] 3 May 2013
arxiv:1305.0601v1 [math.co] 3 May 2013 On the Cayley graph of a commutative ring with respect to its zero-divisors G. Aalipour a,b and S. Akbari a,b a Department of Mathematical Sciences, Sharif University
More information