UNIQUE PRIME CARTESIAN FACTORIZATION OF GRAPHS OVER FINITE FIELDS
|
|
- Brittany Wilkinson
- 5 years ago
- Views:
Transcription
1 UNIQUE PRIME CARTESIAN FACTORIZATION OF GRAPHS OVER FINITE FIELDS RICHARD H. HAMMACK Abstract. A fundamental result, due to Sabidussi and Vizing, states that every connected graph has a unique pre factorization relative to the Cartesian product; but disconnected graphs are not uniquely pre factorable. This paper describes a system of modular arithmetic on graphs under which both connected and disconnected graphs have unique pre Cartesian factorizations. 1. Introduction The Cartesian product of two sple graphs G = (V (G), E(G)) and H = (V (H), E(H)) is the graph G H with V (G H) = V (G) V (H), and (u, x)(v, y) E(G H) if either u = v and xy E(H), or uv E(G) and x = y. This product is commutative and associative: G H = H G and G (H K) = (G H) K (up to isomorphism) for all graphs G, H and K. Also G H is connected if and only if both G and H are connected. For a full treatment of this product, see Chapter 4 of Imrich and Klažar [2]. We denote the empty graph (i.e. the graph with no vertices) as O, and the complete graph on n vertices as K n. Notice that G O = O and G K 1 = G for all graphs G. If n N, then ng denotes the graph that is the disjoint union of n copies of G (or O if n = 0). Note n(g H) = ng H = G nh. For a positive integer n, we define G n = G G G (n factors) and we adopt the convention G 0 = K 1. A graph G is pre if it is nontrivial and G = G 1 G 2 plies G 1 = K 1 or G 2 = K 1. Every graph G has a pre factorization G = G 1 G 2 G p, where each factor G i is pre. A fundamental theorem, proved independently by Sabidussi [3] and Vizing [4] states that the pre factorization of a connected graph is unique, that is if a connected graph G has pre factorizations G 1 G 2 G p and H 1 H 2 H q, then p = q and G i = H i for 1 i p (after reindexing, if necessary). But disconnected graphs are not uniquely pre factorable, in general. One standard example is the graph G = K 1 + K 2 + K K3 2 + K4 2 + K5 2, where the sum represents disjoint union. It is proved in [2] (Theorem 4.2) that G has two distinct pre factorizations OCTOBER
2 MISSOURI JOURNAL OF MATHEMATICAL SCIENCES (K 1 + K 2 + K 2 2 ) (K 1 + K 3 2 ) and (K 1 + K 2 ) (K 1 + K K4 2 ). In this example we may think of G as having been obtained by substituting K 2 for x in the polynomial f = 1 + x + x 2 + x 3 + x 4 + x 5. This polynomial has two distinct factorizations into irreducibles over N, namely (1 + x + x 2 )(1 + x 3 ) and (1 + x)(1 + x 2 + x 4 ), which yield the two factorizations of G. Of course, f can be uniquely pre factored over Z as f = (1 + x)(1 + x + x 2 )(1 x + x 2 ), but this does not translate into a factoring of G because the negative has no mediate meaning when applied to graphs. But what if the factoring is done over Z 2? Then f factors uniquely as (1 + x)(1 + x + x 2 )(1 + x + x 2 ). Substituting K 2 gives (K 1 + K 2 ) (K 1 + K 2 + K2 2) (K 1 + K 2 + K2 2) = K 1 + 3K 2 + 5K K K4 2 + K5 2. This is not G, but rather G + 2K 2 + 4K K K2. 4 However, if the coefficients are regarded as elements in Z 2, it seems reasonable to define 2K 2 = O, 4K2 2 = O, etc., so (K 1 + K 2 ) (K 1 + K 2 + K2 2) (K 1 + K 2 + K2 2) is a factorization of G over Z 2. The next section makes this idea precise. For each pre number k, we construct a ring G k of graphs that are added modulo k and multiplied with the Cartesian product. These rings are shown to be unique factorization domains, so every graph connected or disconnected has a unique pre factorization in G k. 2. Graphs Modulo k In this section, k denotes a pre number and Z k is the field Z/kZ. We regard Z k as the subset {0, 1, 2,..., k 1} Z with addition and multiplication done modulo k. So if n Z k and G is a graph, then ng denotes the graph that is the disjoint union of n copies of G. Let Γ be the set of all sple graphs, including O, and let Γ c Γ denote the set of all connected graphs, excluding O. Denote by G k the infinite densional vector space over Z k with basis Γ c. An element in G k is thus a sum A Γ c a A A with each a A in Z k and a A = 0 for all but finitely many A Γ c. Such a sum can be visualized as the graph that has a A components isomorphic to A, for each connected graph A. (If all a A are 0, the sum is identified with the empty graph.) Thus we will think of G k as a collection of graphs, and a nonzero G = A Γ c a A A in G k is connected provided exactly one coefficient a A is nonzero, and it equals 1. In words, G k consists of all graphs G having the property that G has no more than k 1 components that are isomorphic to any other graph A, so for large k, G k can be thought of as an approxation of Γ. But unlike 150 VOLUME 21, NUMBER 3
3 UNIQUE FACTORIZATION OF GRAPHS OVER FIELDS Γ, there is an operation + on G k. For G, H G k, graph G + H has the following property. If exactly m of G s components and exactly n if H s components are isomorphic to a connected graph A, then exactly m + n (mod k) components of G + H are isomorphic to A. Define a product k on G k as ( ) ( ) a A A k b A A = a A b B (A B). A Γ c A Γ c A,B Γ c Notice that G k H = G H if G and H are connected. If G and H are not both connected, then, intuitively, G k H can be regarded as the graph G H with all sets of k isomorphic components deleted. For example, in G 3, we have 2K 2 3 2K 3 = K 2 K 3, while 2K 2 2K 3 = 4(K 2 K 3 ). Deleting three of the four isomorphic components of 4(K 2 K 3 ) leaves K 2 K 3. Next, we verify that k is distributive and associative. For this, let G = A Γ c a A A, H = A Γ c b A A, and K = A Γ c c A A. For distributivity, observe the following. ( ) [( ) ( )] G k (H + K) = a A A k b A A + c A A A Γ c A Γ c A Γ c ( ) ( ) = a A A k (b A + c A )A A Γ c A Γ c = a A (b B + c B )(A B) = (a A b B + a A c B )(A B) A,B Γ c A,B Γ c = a A b B (A B) + a A c B (A B) = G k H + G k K. A,B Γ c A,B Γ c Next, associativity is verified. [( ) ( )] ( ) (G k H) k K = a A A k b A A k c A A A Γ c A Γ c A Γ c = ( ) a A b B (A B) k c C C A,B Γ c C Γ c = ( a A b B (A B) k ) c C C (distributivity from right) A,B Γ c C Γ c = a A b B c C (A B) C A,B Γ c C Γ c = a A b B c C A (B C) A Γ c B,C Γ c OCTOBER
4 MISSOURI JOURNAL OF MATHEMATICAL SCIENCES = [( ) ] a A A k b B c C (B C) B,C Γ c A Γ c ( ) = a A A k b B c C B C (distributivity from left) A Γ c B,C Γ c ( ) [( ) ( )] = a A A k b A A k c A A = G k (H k K). A Γ c A Γ c A Γ c From this it follows that G k is a commutative ring with zero element O. It is mediate from the definition of k that K 1 k G = G for all ring elements G, so G k has identity K 1. Notice that there is an injective homomorphism φ: Z k G k defined as φ(n) = nk 1. Additionally, observe that if G is connected then ng = (nk 1 ) k G. Thus, A Γ c a A A = A Γ c (a A K 1 ) k A, and this sum is O if and only if each a A is zero. The remainder of this paper hinges on the following construction. Let P 1, P 2, P 3,... be an enumeration of all connected pre graphs indexed so that V (P 1 ) V (P 2 ) V (P 3 ). (Thus P 1 = K 2, P 2 is the path on three vertices, P 3 = K 3, etc.) For each positive integer m, construct a map φ m : Z k [x 1, x 2,..., x m ] G k (ai1i2 i m K 1 ) k P i1 i2 1 k P2 ( defined as φ m ai1i2 i m x i1 1 xi2 2 ) x m =, where the sums are taken over all m- k k P m tuples (i 1, i 2,..., i m ) N m. This is easily seen to be a ring homomorphism. (Apply Theorem 4.3 of [1] with φ as defined in the previous paragraph.) Observe that the homomorphism φ m is injective. Suppose ) = (ai1i 2 i m K 1 ) k P i1 1 ( φ m ai1i2 i m x i1 1 xi2 2 x i2 m k P2 k k P O. Recall that k = for connected graphs, so by unique factorization of m = connected graphs P i1 i2 1 k P2 k k Pm P j1 j2 jm 1 k P2 k k Pm for distinct m-tuples (i 1, i 2,..., i m ) and (j 1, j 2,..., j m ), and therefore all coefficients a i1i 2 i m are zero. Lemma 1. For any pre number k, the ring G k is an integral domain. Proof. Suppose G k H = O for two elements G, H G k. Choose m large enough so that every component of both G and H has a pre factorization of form P i1 i2 1 P2 Pm. (The powers, of course, are allowed to be zero.) By letting a i1i 2 i m be the number of components of G that are isomorphic to P i1 i2 1 P2 Pm, it follows that G = φ ( m ai1i2 i m x i1 1 xi2 2 ) x m. Silarly, H is also in the age of φ m, so G = φ m (g) and H = φ m (h) for appropriate polynomials g and h. From G k H = O, it follows that φ m (gh) = φ m (g) k φ m (h) = O. Then gh = 0 since φ m is injective, hence, g = 0 or h = 0 since Z[x 1, x 2,..., x m ] is an integral domain. Consequently, G = O or H = O, hence G k is an integral domain. 152 VOLUME 21, NUMBER 3
5 UNIQUE FACTORIZATION OF GRAPHS OVER FIELDS It will be useful to examine the units in G k. If G k H = K 1, then, as in the above proof, we may take m large enough so that G = φ m (g) and H = φ m (h). Then φ m (gh) = φ m (g) k φ m (h) = K 1, so gh = 1 by injectivity of φ m. Consequently, g and h are constant polynomials, so G and H are of the form φ m (n) = nk 1 for some nonzero n Z k. Thus the units of G k are K 1, 2K 1, 3K 1,..., (k 1)K 1. Recall that an element a of a ring is irreducible if a = bc plies either b or c is a unit (i.e. invertible). Element a is pre if a bc plies a b or a c for all b, c in the ring. Every pre is irreducible, but in general the converse is not true. We take the approach of Grove [1] in defining a unique factorization domain (UFD) to be an integral domain in which every nonunit is a product of irreducible elements, and every irreducible is pre. By Theorem 5.11 of [1], every nonzero non-unit element of a UFD has a unique pre factorization, that is if a = b 1 b 2 b p = c 1 c 2 c q where each b i and c i is pre, then p = q and (after relabeling if necessary) b i = u i c i for units u i, 1 i p. Proposition 2. For any pre number k, the ring G k is a UFD. Proof. By Lemma 1, G k is an integral domain. By the above remarks, showing it is a UFD entails showing any G G k is a product of irreducibles, and if G is irreducible then G (H k K) plies G H or G K for all H, K G k. Suppose G G k. Observe G is a product of irreducibles: If G is irreducible, we are done. Otherwise suppose G = H k K for non-units H and K. As before, take m large enough so G = φ m (g), H = φ m (h) and K = φ m (κ), and argue g = hκ. Since H and K are non-units, h and κ are nonconstant polynomials and their degrees must be strictly lower than the degree of g. This process may be continued to decompose H and K into products of non-units, and in turn the factors of H and K may be silarly decomposed. But since each iteration yields factors that are ages of polynomials of lower degree than those of the previous iteration, the process must eventually terminate. Consequently G is a product of irreducibles. Now suppose G is irreducible and G (H k K), that is G k F = H k K for some graph F. Take m large enough so G = φ m (g), F = φ m (f), H = φ m (h) and K = φ m (κ). Then φ m (gf) = φ m (hκ), so gf = hκ because φ m is injective, and hence g hκ. Now, g is irreducible in Z k [x 1, x 2,..., x m ], for any factorization g = g 1 g 2 into non-units would produce a factorization G = φ m (g 1 ) k φ m (g 2 ) into non-units. Then, since Z k [x 1, x 2,..., x m ] is a UFD ([1], Theorem 5.16), the relation g hκ means g h or g κ, that is gh 1 = h or gκ 1 = κ. Applying φ m, either G k φ m (h 1 ) = H or G k φ m (κ 1 ) = K, so G H or G K. OCTOBER
6 MISSOURI JOURNAL OF MATHEMATICAL SCIENCES The proposition plies that if a graph in G k factors into irreducibles as B 1 k B 2 k k B p and C 1 k C 2 k k C q, then p = q and (after relabeling) B i = (u i K 1 ) k C i for nonzero elements u i Z k. Because k and agree as operators on connected graphs, the usual pre factorization of a connected graph G will be a pre factorization over k. However, a pre factorization of G in G k may differ from the usual one by unit multiples of the factors. For example K 2 5 K 3 5 K 3 and 3K 2 5 3K 3 5 4K 3 are two factorizations of the same graph in G 5. Observe that 3K 2 5 3K 3 5 4K 3 = ((3K 1 ) 5 K 2 ) 5 ((3K 1 ) 5 K 3 ) 5 ((4K 1 ) 5 K 3 ), and it is evident that these two factorizations differ only by unit multiples of the factors. References [1] L. Grove, Algebra, Academic Press Series in Pure and Applied Mathematics, New York, [2] W. Imrich and S. Klavžar, Product Graphs; Structure and Recognition, Wiley Interscience Series in Discrete Mathematics and Optization, New York, [3] G. Sabidussi, Graph Multiplication, Math. Z., 72 (1960), [4] G. V. Vizing, The Cartesian Product of Graphs (Russian), Vyčisl Sistemy, 9 (1963), AMS Classification Numbers: 05C99 Department of Mathematics and Applied Mathematics, Virginia Commonwealth University, Richmond, VA , USA address: rhammack@vcu.edu 154 VOLUME 21, NUMBER 3
Prime Factorization in the Generalized Hierarchical Product
Prime Factorization in the Generalized Hierarchical Product Sarah Anderson and Kirsti Wash Clemson University sarah5,kirstiw@clemson.edu January 18, 2014 Background Definition A graph G = (V, E) is a set
More informationPrime Factorization and Domination in the Hierarchical Product of Graphs
Prime Factorization and Domination in the Hierarchical Product of Graphs S. E. Anderson 1, Y. Guo 2, A. Rubin 2 and K. Wash 2 1 Department of Mathematics, University of St. Thomas, St. Paul, MN 55105 2
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationDiscrete Mathematics
Discrete Mathematics 313 (2013) 1018 1027 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc On uniqueness of prime bipartite factors
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationOn uniqueness of prime bipartite factors of graphs
On uniqueness of prime bipartite factors of graphs Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284, USA Abstract It has long been
More informationA prime factor theorem for bipartite graphs
A prime factor theorem for bipartite graphs Richard Hammack, Owen Puffenberger Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284, USA Abstract It has
More informationDistinguishing Cartesian powers of graphs
Distinguishing Cartesian powers of graphs Wilfried Imrich Sandi Klavžar Abstract The distinguishing number D(G) of a graph is the least integer d such that there is a d-labeling of the vertices of G that
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research education use, including for instruction at the authors institution
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
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 informationCHAPTER 10: POLYNOMIALS (DRAFT)
CHAPTER 10: POLYNOMIALS (DRAFT) LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN The material in this chapter is fairly informal. Unlike earlier chapters, no attempt is made to rigorously
More informationLecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman
Lecture Notes Math 371: Algebra (Fall 2006) by Nathanael Leedom Ackerman October 17, 2006 TALK SLOWLY AND WRITE NEATLY!! 1 0.1 Factorization 0.1.1 Factorization of Integers and Polynomials Now we are going
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationARTICLE IN PRESS European Journal of Combinatorics ( )
European Journal of Combinatorics ( ) Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Proof of a conjecture concerning the direct
More informationNOTES ON THE INDEPENDENCE NUMBER IN THE CARTESIAN PRODUCT OF GRAPHS
Discussiones Mathematicae Graph Theory xx (xxxx ) xxx xxx NOTES ON THE INDEPENDENCE NUMBER IN THE CARTESIAN PRODUCT OF GRAPHS G. Abay-Asmerom, R. Hammack, C.E. Larson and D.T. Taylor Department of Mathematics
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 informationCartesian powers of graphs can be distinguished with two labels
Cartesian powers of graphs can be distinguished with two labels Sandi Klavžar Xuding Zhu Abstract The distinguishing number D(G) of a graph G is the least integer d such that there is a d-labeling of the
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2. Bert L. Hartnell
Discussiones Mathematicae Graph Theory 24 (2004 ) 389 402 ON DOMINATING THE CARTESIAN PRODUCT OF A GRAPH AND K 2 Bert L. Hartnell Saint Mary s University Halifax, Nova Scotia, Canada B3H 3C3 e-mail: bert.hartnell@smu.ca
More informationPart IX. Factorization
IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings Throughout these notes, F denotes a field. 1 Long division with remainder We begin with some basic definitions. Definition 1.1. Let f, g F [x]. We say that f divides g,
More informationFactorization in Polynomial Rings
Factorization in Polynomial Rings These notes are a summary of some of the important points on divisibility in polynomial rings from 17 and 18. PIDs Definition 1 A principal ideal domain (PID) is an integral
More informationCHAPTER I. Rings. Definition A ring R is a set with two binary operations, addition + and
CHAPTER I Rings 1.1 Definitions and Examples Definition 1.1.1. A ring R is a set with two binary operations, addition + and multiplication satisfying the following conditions for all a, b, c in R : (i)
More informationComputations/Applications
Computations/Applications 1. Find the inverse of x + 1 in the ring F 5 [x]/(x 3 1). Solution: We use the Euclidean Algorithm: x 3 1 (x + 1)(x + 4x + 1) + 3 (x + 1) 3(x + ) + 0. Thus 3 (x 3 1) + (x + 1)(4x
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 23, No. 4, pp. 2042 2052 c 2010 Society for Industrial and Applied Mathematics DIRECT PRODUCT FACTORIZATION OF BIPARTITE GRAPHS WITH BIPARTITION-REVERSING INVOLUTIONS GHIDEWON
More informationHowever another possibility is
19. Special Domains Let R be an integral domain. Recall that an element a 0, of R is said to be prime, if the corresponding principal ideal p is prime and a is not a unit. Definition 19.1. Let a and b
More informationUniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs
Virginia Commonwealth University VCU Scholars Compass Theses and Dissertations Graduate School 2013 Uniqueness of Bipartite Factors in Prime Factorizations Over the Direct Product of Graphs Owen Puffenberger
More informationMath 120 HW 9 Solutions
Math 120 HW 9 Solutions June 8, 2018 Question 1 Write down a ring homomorphism (no proof required) f from R = Z[ 11] = {a + b 11 a, b Z} to S = Z/35Z. The main difficulty is to find an element x Z/35Z
More informationMinimum cycle bases for direct products of K 2 with complete graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 43 (2009), Pages 127 131 Minimum cycle bases for direct products of K 2 with complete graphs Zachary Bradshaw Virginia Commonwealth University Department of
More informationOn the connectivity of the direct product of graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 41 (2008), Pages 45 56 On the connectivity of the direct product of graphs Boštjan Brešar University of Maribor, FEECS Smetanova 17, 2000 Maribor Slovenia bostjan.bresar@uni-mb.si
More informationNOTES ON FINITE FIELDS
NOTES ON FINITE FIELDS AARON LANDESMAN CONTENTS 1. Introduction to finite fields 2 2. Definition and constructions of fields 3 2.1. The definition of a field 3 2.2. Constructing field extensions by adjoining
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More informationTotal 100
Math 542 Midterm Exam, Spring 2016 Prof: Paul Terwilliger Your Name (please print) SOLUTIONS NO CALCULATORS/ELECTRONIC DEVICES ALLOWED. MAKE SURE YOUR CELL PHONE IS OFF. Problem Value 1 10 2 10 3 10 4
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More information1 Rings 1 RINGS 1. Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism
1 RINGS 1 1 Rings Theorem 1.1 (Substitution Principle). Let ϕ : R R be a ring homomorphism (a) Given an element α R there is a unique homomorphism Φ : R[x] R which agrees with the map ϕ on constant polynomials
More informationRINGS: SUMMARY OF MATERIAL
RINGS: SUMMARY OF MATERIAL BRIAN OSSERMAN This is a summary of terms used and main results proved in the subject of rings, from Chapters 11-13 of Artin. Definitions not included here may be considered
More informationRecent Developments on the Structure of Cartesian Products of Graphs
Proc. ICDM 2008, RMS-Lecture Notes Series No. 13, 2010, pp. 171 177. Recent Developments on the Structure of Cartesian Products of Graphs Sandi Klavžar Faculty of Mathematics and Physics, University of
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationMATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION
MATH 431 PART 2: POLYNOMIAL RINGS AND FACTORIZATION 1. Polynomial rings (review) Definition 1. A polynomial f(x) with coefficients in a ring R is n f(x) = a i x i = a 0 + a 1 x + a 2 x 2 + + a n x n i=0
More informationThe Outer Automorphism of S 6
Meena Jagadeesan 1 Karthik Karnik 2 Mentor: Akhil Mathew 1 Phillips Exeter Academy 2 Massachusetts Academy of Math and Science PRIMES Conference, May 2016 What is a Group? A group G is a set of elements
More informationDefinition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson
Definition List Modern Algebra, Fall 2011 Anders O.F. Hendrickson On almost every Friday of the semester, we will have a brief quiz to make sure you have memorized the definitions encountered in our studies.
More informationSolutions of exercise sheet 8
D-MATH Algebra I HS 14 Prof. Emmanuel Kowalski Solutions of exercise sheet 8 1. In this exercise, we will give a characterization for solvable groups using commutator subgroups. See last semester s (Algebra
More informationHandout - Algebra Review
Algebraic Geometry Instructor: Mohamed Omar Handout - Algebra Review Sept 9 Math 176 Today will be a thorough review of the algebra prerequisites we will need throughout this course. Get through as much
More informationRings. EE 387, Notes 7, Handout #10
Rings EE 387, Notes 7, Handout #10 Definition: A ring is a set R with binary operations, + and, that satisfy the following axioms: 1. (R, +) is a commutative group (five axioms) 2. Associative law for
More informationMath 210B: Algebra, Homework 1
Math 210B: Algebra, Homework 1 Ian Coley January 15, 201 Problem 1. Show that over any field there exist infinitely many non-associate irreducible polynomials. Recall that by Homework 9, Exercise 8 of
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationMath 145. Codimension
Math 145. Codimension 1. Main result and some interesting examples In class we have seen that the dimension theory of an affine variety (irreducible!) is linked to the structure of the function field in
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationResolution of Singularities in Algebraic Varieties
Resolution of Singularities in Algebraic Varieties Emma Whitten Summer 28 Introduction Recall that algebraic geometry is the study of objects which are or locally resemble solution sets of polynomial equations.
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 information12. Hilbert Polynomials and Bézout s Theorem
12. Hilbert Polynomials and Bézout s Theorem 95 12. Hilbert Polynomials and Bézout s Theorem After our study of smooth cubic surfaces in the last chapter, let us now come back to the general theory of
More informationDISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS
Discussiones Mathematicae Graph Theory 37 (2017) 155 164 doi:10.7151/dmgt.1902 DISTINGUISHING CARTESIAN PRODUCTS OF COUNTABLE GRAPHS Ehsan Estaji Hakim Sabzevari University, Sabzevar, Iran e-mail: ehsan.estaji@hsu.ac.ir
More informationMinimum Cycle Bases of Product Graphs
1 Corresponding author 1 Minimum Cycle Bases of Product Graphs Wilfried Imrich a,1 and Peter F. Stadler b,c a Department of Mathematics and Applied Geometry Montanuniversität Leoben, Franz Josef Straße
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
More informationModern Algebra I. Circle the correct answer; no explanation is required. Each problem in this section counts 5 points.
1 2 3 style total Math 415 Please print your name: Answer Key 1 True/false Circle the correct answer; no explanation is required. Each problem in this section counts 5 points. 1. Every group of order 6
More informationAbstract Algebra Study Sheet
Abstract Algebra Study Sheet This study sheet should serve as a guide to which sections of Artin will be most relevant to the final exam. When you study, you may find it productive to prioritize the definitions,
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationDistinguishing Cartesian Products of Countable Graphs
MATEMATYKA DYSKRETNA www.ii.uj.edu.pl/premd/ Ehsan ESTAJI, Wilfried IMRICH, Rafa l KALINOWSKI, Monika PILŚNIAK Distinguishing Cartesian Products of Countable Graphs Preprint Nr MD 079 (otrzymany dnia 1.09.2015)
More informationD-MATH Algebra II FS18 Prof. Marc Burger. Solution 26. Cyclotomic extensions.
D-MAH Algebra II FS18 Prof. Marc Burger Solution 26 Cyclotomic extensions. In the following, ϕ : Z 1 Z 0 is the Euler function ϕ(n = card ((Z/nZ. For each integer n 1, we consider the n-th cyclotomic polynomial
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 informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More information3. The Sheaf of Regular Functions
24 Andreas Gathmann 3. The Sheaf of Regular Functions After having defined affine varieties, our next goal must be to say what kind of maps between them we want to consider as morphisms, i. e. as nice
More informationwhere c R and the content of f is one. 1
9. Gauss Lemma Obviously it would be nice to have some more general methods of proving that a given polynomial is irreducible. The first is rather beautiful and due to Gauss. The basic idea is as follows.
More informationAlgebra Exam Fall Alexander J. Wertheim Last Updated: October 26, Groups Problem Problem Problem 3...
Algebra Exam Fall 2006 Alexander J. Wertheim Last Updated: October 26, 2017 Contents 1 Groups 2 1.1 Problem 1..................................... 2 1.2 Problem 2..................................... 2
More informationMINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS
MINIMAL GENERATING SETS OF GROUPS, RINGS, AND FIELDS LORENZ HALBEISEN, MARTIN HAMILTON, AND PAVEL RŮŽIČKA Abstract. A subset X of a group (or a ring, or a field) is called generating, if the smallest subgroup
More informationMATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X.
MATH 215 Sets (S) Definition 1 A set is a collection of objects. The objects in a set X are called elements of X. Notation 2 A set can be described using set-builder notation. That is, a set can be described
More informationMath 121 Homework 2 Solutions
Math 121 Homework 2 Solutions Problem 13.2 #16. Let K/F be an algebraic extension and let R be a ring contained in K that contains F. Prove that R is a subfield of K containing F. We will give two proofs.
More informationGEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS
GEOMETRIC CONSTRUCTIONS AND ALGEBRAIC FIELD EXTENSIONS JENNY WANG Abstract. In this paper, we study field extensions obtained by polynomial rings and maximal ideals in order to determine whether solutions
More informationSelected exercises from Abstract Algebra by Dummit and Foote (3rd edition).
Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.
More informationMath 547, Exam 2 Information.
Math 547, Exam 2 Information. 3/19/10, LC 303B, 10:10-11:00. Exam 2 will be based on: Homework and textbook sections covered by lectures 2/3-3/5. (see http://www.math.sc.edu/ boylan/sccourses/547sp10/547.html)
More informationMath 201C Homework. Edward Burkard. g 1 (u) v + f 2(u) g 2 (u) v2 + + f n(u) a 2,k u k v a 1,k u k v + k=0. k=0 d
Math 201C Homework Edward Burkard 5.1. Field Extensions. 5. Fields and Galois Theory Exercise 5.1.7. If v is algebraic over K(u) for some u F and v is transcendental over K, then u is algebraic over K(v).
More informationCHAPTER 1. AFFINE ALGEBRAIC VARIETIES
CHAPTER 1. AFFINE ALGEBRAIC VARIETIES During this first part of the course, we will establish a correspondence between various geometric notions and algebraic ones. Some references for this part of the
More informationDOES XY 2 = Z 2 IMPLY X IS A SQUARE?
DOES XY 2 = Z 2 IMPLY X IS A SQUARE? JACK S. CALCUT 1. Introduction Ordinary integers have the property that if the product of a number and a square is a square, then the number itself is a square. That
More informationCOUNTING SEPARABLE POLYNOMIALS IN Z/n[x]
COUNTING SEPARABLE POLYNOMIALS IN Z/n[x] JASON K.C. POLAK Abstract. For a commutative ring R, a polynomial f R[x] is called separable if R[x]/f is a separable R-algebra. We derive formulae for the number
More informationSome hard families of parameterised counting problems
Some hard families of parameterised counting problems Mark Jerrum and Kitty Meeks School of Mathematical Sciences, Queen Mary University of London {m.jerrum,k.meeks}@qmul.ac.uk September 2014 Abstract
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 informationMath 611 Homework 6. Paul Hacking. November 19, All rings are assumed to be commutative with 1.
Math 611 Homework 6 Paul Hacking November 19, 2015 All rings are assumed to be commutative with 1. (1) Let R be a integral domain. We say an element 0 a R is irreducible if a is not a unit and there does
More informationSection III.6. Factorization in Polynomial Rings
III.6. Factorization in Polynomial Rings 1 Section III.6. Factorization in Polynomial Rings Note. We push several of the results in Section III.3 (such as divisibility, irreducibility, and unique factorization)
More informationSmall Label Classes in 2-Distinguishing Labelings
Also available at http://amc.imfm.si ISSN 1855-3966 (printed ed.), ISSN 1855-3974 (electronic ed.) ARS MATHEMATICA CONTEMPORANEA 1 (2008) 154 164 Small Label Classes in 2-Distinguishing Labelings Debra
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 informationSample algebra qualifying exam
Sample algebra qualifying exam University of Hawai i at Mānoa Spring 2016 2 Part I 1. Group theory In this section, D n and C n denote, respectively, the symmetry group of the regular n-gon (of order 2n)
More informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationMathematical Foundations of Cryptography
Mathematical Foundations of Cryptography Cryptography is based on mathematics In this chapter we study finite fields, the basis of the Advanced Encryption Standard (AES) and elliptical curve cryptography
More informationMath 418 Algebraic Geometry Notes
Math 418 Algebraic Geometry Notes 1 Affine Schemes Let R be a commutative ring with 1. Definition 1.1. The prime spectrum of R, denoted Spec(R), is the set of prime ideals of the ring R. Spec(R) = {P R
More informationAssociativity and Non-Associativity of Some Hypergraph Products
Math.Comput.Sci. DOI 10.1007/s11786-016-0276-y Mathematics in Computer Science Associativity and Non-Associativity of Some Hypergraph Products Richard H. Hammack Marc Hellmuth Lydia Ostermeier Peter F.
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 information12 16 = (12)(16) = 0.
Homework Assignment 5 Homework 5. Due day: 11/6/06 (5A) Do each of the following. (i) Compute the multiplication: (12)(16) in Z 24. (ii) Determine the set of units in Z 5. Can we extend our conclusion
More informationHonors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35
Honors Algebra 4, MATH 371 Winter 2010 Assignment 4 Due Wednesday, February 17 at 08:35 1. Let R be a commutative ring with 1 0. (a) Prove that the nilradical of R is equal to the intersection of the prime
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
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 informationSolutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010.
Solutions, Project on p-adic Numbers, Real Analysis I, Fall, 2010. (24) The p-adic numbers. Let p {2, 3, 5, 7, 11,... } be a prime number. (a) For x Q, define { 0 for x = 0, x p = p n for x = p n (a/b),
More informationRING ELEMENTS AS SUMS OF UNITS
1 RING ELEMENTS AS SUMS OF UNITS CHARLES LANSKI AND ATTILA MARÓTI Abstract. In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand
More informationALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION
ALGEBRA I (LECTURE NOTES 2017/2018) LECTURE 9 - CYCLIC GROUPS AND EULER S FUNCTION PAVEL RŮŽIČKA 9.1. Congruence modulo n. Let us have a closer look at a particular example of a congruence relation on
More informationx = π m (a 0 + a 1 π + a 2 π ) where a i R, a 0 = 0, m Z.
ALGEBRAIC NUMBER THEORY LECTURE 7 NOTES Material covered: Local fields, Hensel s lemma. Remark. The non-archimedean topology: Recall that if K is a field with a valuation, then it also is a metric space
More informationMaximal non-commuting subsets of groups
Maximal non-commuting subsets of groups Umut Işık March 29, 2005 Abstract Given a finite group G, we consider the problem of finding the maximal size nc(g) of subsets of G that have the property that no
More information