FACTORING ABELIAN GROUPS OF. Department of Mathematics, University of Bahrain, P. O. Box
|
|
- Dorcas Megan Boyd
- 8 years ago
- Views:
Transcription
1 Mathematica Pannonica 7/2 (1996), 197 { 207 FACTORING ABELIAN GROUPS OF ORDER p 4 Sandor Szabo Department of Mathematics, University of Bahrain, P. O. Box Isa Town, State of Bahrain Khalid Amin Department of Mathematics, University of Bahrain, P. O. Box Isa Town, State of Bahrain Received: July 1995 MSC 1991 : 20K01,52C22 Keywords: Factorization of nite abelian groups, Hajos-Redei theory. Abstract: Let G be a nite abelian group of order p 4,where p is a prime. If G is a direct product of three of its subsets A, B, C, where B and C are nonsubgroup cyclic or simulated subsets, then A is a direct product of a subset and a nontrivial subgroup of G. 1. Introduction Let G be a nite abelian group. We will use multiplicative notation in connection with abelian groups. We denote the identity element by e. Let A 1 ::: A n be subsets of G. If the product A 1 :::A n is direct and gives G, then we say that the product A 1 :::A n is a factorization of G. We also call the equation G = A 1 :::A n a factorization of G. Theabove denition is clearly equivalent to the following. Each g in G is uniquely expressible in form g = a 1 :::a n a 1 2 A 1 ::: a n 2 A n : Sometimes another equivalent formulation is useful. The product A 1 ::: :::A n gives G and in addition jgj = ja 1 j :::ja n j holds. Here jaj de-
2 198 S. Szabo and K. Amin notes the cardinality of the subset A of G. We also use the notation jaj to denote the order of the element a of G. The subset A of G is dened to beperiodic if there is an element g 2 G nfeg such that ga = A. Such an element g is called a period of A. All the periods of A together with the identity element e form a subgroup H of G. In fact A is a union of cosets modulo H. Therefore A is a direct product HD, where D is a set of representatives of A modulo H. Clearly D is not necessarily dened uniquely. Beside periodic subsets two other types of subsets play a role in the paper. The subset A of G is called cyclic if it consists of the elements e a a 2 ::: a r;1.inorder to avoid trivial cases we will assume that r 2and jaj r. If jaj = r, then the cyclicsubset A is equal to the cyclic subgroup hai. If jaj > r, then A consists of the \rst" r elements of hai. Let a 2 G such that jaj = r. Thesubset A of G is called simulated if it consists of the elements e a a 2 ::: a r;2 a r;1 u. If u = e, then the simulated subset A is equal to the subgroup hai. If u 6= e, then A diers from the subgroup hai in one element a r;1 u. It is proved in [3] that ifaniteabelian group is a direct product of cyclic subsets, then at least one of the factors must be periodic. By[1] a similar result holds if the factors are simulated instead of being cyclic. Redei [4] proved that if a nite abelian group is a direct product of normed subsets of prime cardinality, then at least one of the factors must be a subgroup. These theorems suggest the following problem. Let G=AB 1 :::B n be a factorization of the niteabelian group G, where each B i is either cyclic or simulated and jaj is a product of two (not necessarily distinct) primes. Does it follow that at least one ofthe factors A B 1 ::: B n is periodic? The main result ofthis paper gives an answer in the armative in a particular case. Namely, let G be a group of order p 4,where p is a prime. If G = ABC is factorization of G, where B and C may be cyclic orsimulated, then at leastoneofthe factors A B C must be periodic. The emphasis is on that jaj is not a prime and nothing is assumed about the structure of A. 2. Preliminaries If A and A 0 are subsets of G such that for every subset B of G, if G = AB is a factorization of G, then G = A 0 B is also a factorization
3 Factoring abelian groups of order p G, then we shall say that A is replaceable by A 0. We will need the next three lemmas on replaceable factors. They can be proved using the ideas of the proofs of Lemma 1and 2 in [2]. Lemma 1. Let G be a nite abelian group and let A = fe a a 2 ::: ::: a r;1 g be a cyclic subset of G. Then A can be replaced by A 0 = = fe a i a 2i ::: a (r;1)i g for each i, whenever i is prime to r. Lemma 2. The simulated subset A = fe a a 2 ::: a r;2 a r;1 ug of a nite abelian group can be replaced by A 0 = fe a a 2 ::: a r;2 a r;1 u i g for each integer i. Lemma 3. The simulated subseta = fe a a 2 ::: a r;2 a r;1 ug of a - nite abelian group can be replaced bya 0 = fe a a 2 ::: a i;1 a i u a i+1 ::: ::: a r;1 g for each i, 1 i r ; 1. At some instances it will be convenient towork in the group ring Z(G). If G is a nite abelian group, then Z(G) consists of all the elements P g2g gg, where g is an integer. Addition and multiplication are dened between such sums in the same fashion as between polynomials. To the subset A of G we assign the element A = P a2a a of Z(G). We willusethe next argument several times. Let G = ABC beafactorization of G, where B = e b b 2 ::: b r;1 C = e c c 2 ::: c s;2 c s;1 v : Replace C by hci in the factorization G = ABC to get the factorization G = ABhci. This can be done by Lemma 2 with the choice of i = = 0. The factorizations G = ABC and G = ABhci correspond tothe equations G = ABC and G = ABhci respectivelyinthe group ring Z(G). Subtracting the rstfromthe second we get 0 = AB(c s;1 ; ; c s;1 v)andso0=ab(e ; v). From this by multiplying by e ; b we get the equation 0 = A(e ; b r )(e ; v). Now usingthe ideas in the proof of Th. 2 of [6] we can conclude that there are subsets U V of G such that A = U hb r i[v hvi, where the union is disjoint andthe products are direct. Analogous results hold when both B and C are cyclic or both are simulated. For easier reference we state them as a lemma. Lemma 4. Let G = ABC be a factorization of the nite abelian group G, where the factors B and C are one of the following B = e b b 2 ::: b r;1 C = e c c 2 ::: c s;1 B = e b b 2 ::: b r;2 b r;1 u C = e c c 2 ::: c s;2 c s;1 v B = e b b 2 ::: b r;1 C = e c c 2 ::: c s;2 c s;1 v : Then there are subsets U V of G such that A can be represented inthe following forms respectively
4 200 S. Szabo and K. Amin A = U hb r i[v hc s i A = U hui [V hvi A = U hb r i[v hvi where the unions are disjoint and the products are direct. 3. Result Now we are ready to prove the main result of the paper. the fundamental theorem of the nite abelian groups each nite abelian group is a direct product of cyclic groups of prime power order. If G is the direct product of cyclic groups of prime power order t 1 ::: t n respectively, then we say that G is of type (t 1 ::: t n ). Theorem 1. Let p be a prime and G be anabelian group of order p 4. Let G = ABC be a factorization of G, where jaj = p 2, jbj = jcj = = p. Further the factors B and C are cyclic or simulated. Then one of A B C is periodic. Proof. The type of G be can be (p 4 ) (p 3 p) (p 2 p 2 ) (p 2 p p) (p p p p): We distinguish 5 cases depending on the type of G. Then we distinguish 3subcases depending onboth B and C are cyclic both B and C are simulated B is cyclic and C is simulated. CASE 1. G is of type (p 4 ). This case is settled by Th. 1 of [5]. If G is a nite cyclic group and G = A 1 :::A n is a factorization of G, where each ja i j is a prime power, then one ofthe factors is periodic. CASE 2. G is of type (p 3 p). Let G = hxihyi, where jxj = p 3, jyj = p. Subcase 2(a). Both B and C are cyclic, that is, B = e b b 2 ::: b p;1 C = e c c 2 ::: c p;1 : If b p = e or c p = e, then we are done andsowe assume that jbj p 2, jcj p 2.ByLemma4,A = U hb p i[v hc p i. Let b = x y and c = x y be the basis representations of b and c. Now b p = x p and c p = x p. The subgroups of hx p i form a chain. Hence hx p2 i hx p i\hx p i = = hb p i\hc p i.thus x p2 is a period of A. Subcase 2(b). Both B and C are simulated, that is, B = e b b 2 ::: b p;2 b p;1 u C = e c c 2 ::: c p;2 c p;1 v : Here jbj = jcj = p. If u = e or v = e, then we are done andsoweassume that juj p, jvj p. By Lemma 2wemay assume that juj = jvj = p. The elements of G of order p generate the subgroup K = hx p2 yi of order p 2. Now K = BC is a factorization of K. By Redei's theorem one of the factors B and C is a subgroup of K. By
5 Factoring abelian groups of order p Subcase 2(c). B is cyclic and C is simulated, that is, B = e b b 2 ::: b p;1 C = e c c 2 ::: c p;2 c p;1 v : Here we may assume that jbj p 2 and jcj = jvj = p. By Lemma4, A = U hb p i[v hvi. If U = or V =, then A is periodic and sowe assume that U 6= and V 6=. If jbj = p 3,then ju jjhb p ij p 2 and hence V =. We assume that jbj = p 2. Therefore hb p i = hx p2 i. If v 2hx p2 i, then hvi = hx p2 i and soa is periodic. Thus we assume that v 62 hx p2 i. Replace C by hci in the factorization G = ABC to get the factorization G = ABhci. Let us compute Ahci. U x p2 [ V hvi hci = U x p2 hci [V hvihci: Ahci = The product ABhci is direct so the products hx p2 ihci and hvihci must be direct. They both must be equal to K. Note that x p2 v form a basis for K. By Lemma 3inC c can be replaced by c i for each i, 1 i p ; 1, so we have p ; 1choices for c. Namely, c may be x p2 v i, 1 i p ; 1. Now C = e x p2 v i x 2p2 v 2i ::: x (p;2)p2 v (p;2)i x (p;1)p2 v (p;1)i+1 : There is a j such that 1 j p ; 2and ji (p ; 1)i + 1 (mod p) since (j +1)i 1 (mod p) is solvable. Let t 2 U. The product thx p2 ic is direct since it is part of ABC. Compute hx p2 ic. Note that the sets x p 2 x jp2 v ji = x p2 v ij and cl x p2 x (p;1)p2 v (p;1)i+1 = x p2 v (p;1)i+1 are parts of hx p2 ic and they have the same elements. This is a contradiction. CASE 3. G is of type (p 2 p 2 ). Let G = hxi hyi, where jxj = p 2, jyj = p 2. Subcase 3(a). Both B and C are cyclic, that is, B = e b b 2 ::: b p;1 C = e c c 2 ::: c p;1 : If b p = e or c p = e, then we are done andsowe assume that jbj = p 2, jcj = p 2. Let L = hbi. If c 2 L, then L = BC is a factorization of L and so by Redei's theorem one of the factors is a subgroup of L. Thus we may assume that c 62 L. Wemay choose x y to beb c respectively. Now B = e x x 2 ::: x p;1 C = e y y 2 ::: y p;1 : We show that if G = ABC is a normed factorization, then A x p y or A x y p : To show this let a 0 a 2 A and a 0 a ;1 = x y. If p - and p -, then
6 202 S. Szabo and K. Amin a 0 = ax y contradicts the factorization G = AB 0 C 0 what we get from the factorization G = ABC by replacing B C by B 0 C 0,where B 0 = e x x 2 ::: x (p;1) C 0 = e y y 2 ::: y (p;1) : This replacement is possible by Lemma 1. Let a = x y 2 A. The previous argument with a 0 = e gives that pj or pj. If pj for each a 2 2 A, then A hx p yi. Similarlyifpj for each a 2 A, then A hx y p i. Thus we may assume that there are a = x y a 0 = x 0 y 0 2 A such that pj, p - and p - 0, pj 0,then p - ( 0 ; ), p - ( 0 ; ). So a 0 a ;1 = x 0 ; y 0 ; leads to a contradiction. Let M = hx p yi and N = hx y p i. If A hx p yi = M, then M = = AC is a factorization and soa(e ; y p )=0shows that y p is a period of A. Similarly ifa hx y p i = N, then N = AB is a factorization and so A(e ; x p )=0shows that x p is a period of A. Subcase 3(b). Both B and C are simulated, that is, B = e b b 2 ::: b p;2 b p;1 u C = e c c 2 ::: c p;2 c p;1 v : Here jbj = jcj = p and wemay assume that juj = p, jvj = p. The elements of G of order p generate the subgroup K = hx p y p i of order p 2. Now K = BC is a factorization of K. By Redei's theorem one of the factors B and C is a subgroup of K. Subcase 3(c). B is cyclicand C is simulated, that is, B = e b b 2 ::: b p;1 C = e c c 2 ::: c p;2 c p;1 v : Here we may assume that jbj p 2 and jcj = jvj = p. By Lemma4, A = U hb p i[v hvi. If U = or V =, then A is periodic and sowe assume that U 6= and V 6=. If v 2hb p i,then hvi = hb p i and soa is periodic. Thus we assume that v 62 hb p i. Now b p v form a basis for K = hx p y p i. In the factorization G = ABC replace C by hci to obtain the factorization G = ABhci. Compute Ahci. Ahci = U b p [ V hvi hci = U b p hci [V hvihci: Both hb p ihci and hvihci must be direct and equal to K. Note that b p v form a basis for K. By Lemma 3inCccan be replaced by c i for each i, 1 i p ; 1, so we have p ; 1choices for c. Namely, c may be b p v i, 1 i p ; 1. Now C = e b p v i b 2p v 2i ::: b (p;2)p v (p;2)i b (p;1)p v (p;1)i+1 : There is a j such that 1 j p ; 2and ji (p ; 1)i + 1 (mod p) since (j +1)i 1 (mod p) is solvable. Let t 2 U. The product thb p ic is direct since it is part of ABC. Compute hb p ic. Note that the sets
7 Factoring abelian groups of order p b p b jp v ji = b p v jp and b p b (p;1)p v (p;1)i+1 = b p v (p;1)i+1 are parts of hb p ic and they have the same elements. Thisisacontradiction. CASE 4. G is of type (p 2 p p). Let G = hxihyihzi, where jxj = p 2, jyj = jzj = p. Subcase 4(a). Both B and C are cyclic, that is, B = e b b 2 ::: b p;1 C = e c c 2 ::: c p;1 : Here we may assume that jbj = p 2, jcj = p 2. By Lemma 4,A = U hb p i[ [ V hc p i. Let b = x y z and c = x y z be the basis representations of b and c. Now b p = x p and c p = x p. Thesubgroups of hx p i form a chain. So hx p i = hb p i = hc p i.thus x p is a period of A. Subcase 4(b). Both B and C are simulated, that is, B = e b b 2 ::: b p;2 b p;1 u C = e c c 2 ::: c p;2 c p;1 v : Here jbj = jcj = p and by Lemma 2wemay assume that juj = p, jvj = = p. Replace B C by hbi hci in the factorization G = ABC to get the factorization G = Ahbihci. This gives that the product hbihci is direct. If u v 2hb ci, then BC = hb ci is a factorization and sobyredei's theorem we are done. We assume that u 62 hb ci and v 2hb c ui, that is, v = b c u Now B = e b b 2 ::: b p;2 b p;1 u C = e c c 2 ::: c p;2 c p;1 b c u A = U hui [V b c u : Here we assume that U 6= and V 6= since otherwise A is periodic. Assume rstthat =0. If =0,then 6= 0. By Lemma 2we may assume that = 1. Let t 2 V. The product thbib is direct since the product ABC is direct. On the other hand b 2hbi and b 2 B. This is a contradiction. If 6= 0,then by Lemma 2wemay assume that =1. If =0, then u is a period of A. Thus we assume that 6= 0. Let t 2 V. The product thb uib is direct. The elements b (p;1)+p;1 e b b 2 ::: p p;2 belong to hb uib. So(p ; 1) + p ; ::: p; 2 (mod p) and hence (p ; 1) + p ; 1 p ; 1(mod p). Thus =0. Butweknowthis is not the case. Secondly assume that 6= 0. By Lemma 2 we may assume that =1. Now C = e c c 2 ::: c p;2 c p;1 b cu = e c c 2 ::: c p;2 b u Let t 2 U. Theproduct thuibc is direct. Clearly huibc = hb uic. But this a contradiction since b u 2hb ui and b u 2 C.
8 204 S. Szabo and K. Amin Subcase 4(c). B is cyclic and C is simulated, that is, B = e b b 2 ::: b p;1 C = e c c 2 ::: c p;2 c p;1 v : We may assume that jbj = p 2 and jcj = jvj = p. By Lemma 4,A = = U hb p i[v hvi. Weassume that U 6= and V 6= since otherwise A is periodic. Let t 2 U. The product thb p ic is direct since it is part of the product ABC. If c 2 hb p i, then c = b pi for some i, 1 i p ; 1. This leads to the contradiction c 2hb p i and c 2 C. Thus we assume that c 62 hb p i. Wedistinguish two cases depending on v 2 hb p ci or v 62 hb p ci. If v 2hb p ci, then v = b p c. If =0,then A is periodic by b p. If 6= 0,then by Lemma2wemay assume that =1. Now C = e c c 2 ::: c p;2 c p;1 b p c = e c c 2 ::: c p;2 b p : Let t 2 U. Theproduct thb p ic is direct since it is part of the product ABC. But b p 2hb p i and b p 2 C is a contradiction. Turn to the case when hb p c vi is of type (p p p). From the factorization G = ABC it follows that 0 = AC(e ; b p ) and so AC is periodic by b p. Consequently V hvic is periodic by b p. Note that hvic = hc vi. If t 2 V,then e 2 t ;1 V hvic = t ;1 V hc vi. Now hb p i t ;1 V hc vi. As t ;1 V hc vi is a union cosets modulo hc vi and the elements of hb p i are incongruent modulo hc vi, it follows that p 3 = = hb p ihc vi t ;1 V hc vi = jv jp 2. This gives that jv jp and sowe get the contradiction that U =. CASE 5. G is of type (p p p p). Each element ofg nfeg is of order p and so a cyclic subset of G is a subgroup of G. Thus the only case we should consider is when both B and C are simulated, that is, B = e b b 2 ::: b p;2 b p;1 u C = e c c 2 ::: c p;2 c p;1 v : Here jbj = jcj = p and wemay assume that juj = p, jvj = p. Replace B C by hbi hci in the factorization G = ABC to get the factorization G = Ahbihci. This gives that the product hbihci is direct. So the group hb c u vi is one ofthe types (p p), (p p p), (p p p p). Turn rst to the case when hb c u vi is of type (p p). Now u v 2 2hb ci. Further BC = hb ci is a factorization andsobyredei's theorem we are done. Secondly consider the case when hb c u vi is of type (p p p). We assume that u 62 hb ci and v 2hb c ui, that is,v = b c u Now B = e b b 2 ::: b p;2 b p;1 u C = e c c 2 ::: c p;2 c p;1 b c u
9 Factoring abelian groups of order p A = U hui [V b c u : Here we assume that U 6= and V 6= otherwise A is periodic. Assume rstthat =0. If =0,then 6= 0. By Lemma 2we may assume that = 1. Let t 2 V. The product thbib is direct since the product ABC is direct. On the other hand b 2hbi and b 2 B. This is a contradiction. If 6= 0,then by Lemma 2wemay assume that =1. If =0, then u is a period of A. Thus we assume that 6= 0. Let t 2 V. The product thb uib is direct. The elements b (p;1)+p;1 e b b 2 ::: p p;2 belong to hb uib. So(p ; 1) + p ; ::: p; 2 (mod p) and hence (p ; 1) + p ; 1 p ; 1(mod p). Thus =0. Butweknowthis is not the case. Secondly assume that 6= 0. By Lemma 2 we may assume that =1. Now C = e c c 2 ::: c p;2 c p;1 b cu = e c c 2 ::: c p;2 b u Let t 2 U. Theproduct thuibc is direct. Clearly huibc = hb uic. But this a contradiction since b u 2hb ui and b u 2 C. Finallyturn to the case when hb c u vi is of type (p p p p). From the factorization G = Ahbihci it follows that A is a complete set of representatives modulo hb ci and so A = u i v j a ij :0 i j p ; 1 a ij 2hb ci : We may assume that e 2 A, that is, a 00 = e. We also know that A = U hui [V hvi. Here we assume that U 6= and V 6= since otherwise A is periodic. As the rolesofu and v are symmetric, wemay assume that e 2 U. Then hui A. Thismeans that a i0 = e for each i, 0 i p ;1. Let u i v j a ij 2 V hvi. Now u i v j a ij hvi A. This gives that a ij 's are equal for each j, 0 j p ; 1. As a i0 = e, wehave a ij = e for each j, 0 j p ; 1. Then u i v j a ij hvi = u i hvi. Therefore u i 2 V hvi. On the other hand u i 2 U hui. This is a contradiction since V hvi and U hui are disjoint. This completes the proof. 4. Examples In this section we exhibit examples to show that the conditions of the problem proposed in the introduction cannot be relaxed in general. Let G = Q 5 i=1 hx ii, where jx i j = r i 3. Set
10 206 S. Szabo and K. Amin T 0 = e x 3 x 2 3 ::: xr 3;2 3 x r 3;1 3 x 4 T 1 = e x 2 x 2 2 ::: xr 2;2 2 x r 2;1 2 x 5 T 2 = = T r 1;1 = hx 2 i: Now wedene A B C by A = T 0 hx 2 i[x 1 T 1 hx 3 i[x 2 1 T 2hx 3 i[:::[ x r 1;1 1 T r 1;1hx 3 i B = e x 4 x 2 4 ::: xr 4;2 4 x r 4;1 4 x 2 C = e x 5 x 2 5 ::: xr 5;2 5 x r 5;1 5 x 3 : We claim that G = ABC is a factorization of G. In order to verify this rst we show that T 0 hx 2 ibc = T 1 hx 3 ibc = = T r 1;1hx 3 ibc = hx 2 x 3 x 4 x 5 i: Indeed, T 0 hx 2 ibc = T 0 hx 2 x 4 ic = hx 2 x 3 x 4 ic = hx 2 x 3 x 4 x 5 i and T 1 hx 3 icb = T 1 hx 3 x 5 ib = hx 2 x 3 x 5 ib = hx 2 x 3 x 4 x 5 i: The remaining cases can be veried in a similar way. Now ABC = ; T 0 hx 2 i[x 1 T 1 hx 3 i[x 2 1 T 2hx 3 i[:::[ x r 1;1 1 T r 1;1hx 3 i BC = = T 0 hx 2 ibc [ x 1 T 1 hx 3 ibc [ x 2 1 T 2hx 3 ibc [ :::[ x r 1;1 1 T r 1;1hx 3 ibc = = e x 1 x 2 1 ::: xr 1;1 1 x2 x 3 x 4 x 5 = x1 x 2 x 3 x 4 x 5 = G: It is clear that B C are not periodic. The subset A is not periodic since it is a disjoint union of periodic subsets which have noperiodin common. To makethe example more concrete let us choose r 1 ::: r 5 to be 3. In this case G is of type ( ), B C are simulated subsets jaj =3 3 and none ofthe factors is periodic. In the special case when r 1 ::: r 5 are pairwise relatively primes G is a cyclic group. In the next example the factors B and C are cyclic. Let G = hxi hyi, where jxj = rst, jyj = uv, and r s t u v 2. Set T 0 = e y u y 2u ::: y (v;2)u y (v;1)u x r T 1 = e x rs x 2rs ::: x (t;2)rs x (t;1)rs y T 2 = = T r;1 = hx rs i: Now dene A B C by A = T 0 hx rs i[xt 1 hy u i[x 2 T 2 hy u i[:::[ x r;1 T r;1 hy u i B = e x r x 2r ::: x (s;1)r C = e y y 2 ::: y u;1 : Clearly B C are not periodic and A is not periodic since it is a disjoint union of periodic subsets without common period. We claim that G = = ABC is a factoring of G. In order to verify this claim we rst show that
11 Factoring abelian groups of order p T 0 hx rs ibc = T 1 hy u ibc = T 2 hy u ibc = = T r;1 hy u ibc = hx r yi: Indeed, T 0 hx rs ibc = T 0 hx r ic = hx r yi and T 1 hy u icb = T 1 hyib = hx r yi: The remaining cases can be veried in a similar way. Using these facts ABC = ; T 0 hx rs i[xt 1 hy u i[x 2 T 2 hy u i[:::[ x r;1 T r;1 hy u i BC = = T 0 hx rs ibc [ xt 1 hy u ibc [ x 2 T 2 hy u ibc [ :::[ x r;1 T r;1 hy u ibc = = e x x 2 ::: x r;1 hx r yi = hx yi = G: If we choose r s t u v to be 2, then G is of type ( ), jaj =2 3, jbj = jcj =2. Ifrst, and uv are relatively primes, then G is a cyclic group. References [1] CORR ADI, K. and SANDS, A. U. and SZAB O, S.: Simulated factorizations, Journal of Alg., 151 (1992), 12{25. [2] CORR ADI, K. and SZAB O, S: Solution to a problem of A. D. Sands, Communications in Algebra, 23 (1995), 1503{1510. [3] HAJ OS, G.: Uber einfache undmehrfache Bedeckung des n-dimensionalen Raumes mit einem Wurfelgitter, Math. Zeitschr. 47 (1941), 427{467. [4] REDEI, L.: Die neue Theorie der endlichen Abelschen Gruppen undverallge- meinerung des Hauptsatzes von Hajos, Acta Math. Acad. Sci. Hungar. 16 (1965), 329{373. [5] SANDS, A. D.: Factorization of cyclic groups, Colloquium on abelian groups, Tihany, Hungary, Sept. 1963, 139{146. [6] SANDS, A. D. and SZAB O, S.: Factorization of periodic subsets, Acta Math. Hungar. 57 (1991), 159{167.
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
More informationHow To Factorize Of Finite Abelian Groups By A Cyclic Subset Of A Finite Group
Comment.Math.Univ.Carolin. 51,1(2010) 1 8 1 A Hajós type result on factoring finite abelian groups by subsets II Keresztély Corrádi, Sándor Szabó Abstract. It is proved that if a finite abelian group is
More informationFactoring 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
More informationGROUPS ACTING ON A SET
GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for
More information26 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
More informationI. 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
More informationSolutions 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
More information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
More informationMathematics 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
More informationChapter 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
More informationON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS
ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More informationApplications 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
More informationAssignment 8: Selected Solutions
Section 4.1 Assignment 8: Selected Solutions 1. and 2. Express each permutation as a product of disjoint cycles, and identify their parity. (1) (1,9,2,3)(1,9,6,5)(1,4,8,7)=(1,4,8,7,2,3)(5,9,6), odd; (2)
More informationComplexity problems over algebraic structures
Complexity problems over algebraic structures Theses of PhD dissertation Created by: Horváth Gábor Mathematical Doctoral School Theor. Mathematical Doctoral Program Dir. of School: Dr. Laczkovich Miklós
More informationIntroduction to Finite Fields (cont.)
Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number
More informationChapter 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
More information4. 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
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationOn 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
More informationON 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
More informationQuotient 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.
More informationElements of Abstract Group Theory
Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for
More informationr + s = i + j (q + t)n; 2 rs = ij (qj + ti)n + qtn.
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 information4. CLASSES OF RINGS 4.1. Classes of Rings class operator A-closed Example 1: product Example 2:
4. CLASSES OF RINGS 4.1. Classes of Rings Normally we associate, with any property, a set of objects that satisfy that property. But problems can arise when we allow sets to be elements of larger sets
More informationCyclotomic Extensions
Chapter 7 Cyclotomic Extensions A cyclotomic extension Q(ζ n ) of the rationals is formed by adjoining a primitive n th root of unity ζ n. In this chapter, we will find an integral basis and calculate
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More informationCOMMUTATIVE 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
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More informationBreaking The Code. Ryan Lowe. Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and
Breaking The Code Ryan Lowe Ryan Lowe is currently a Ball State senior with a double major in Computer Science and Mathematics and a minor in Applied Physics. As a sophomore, he took an independent study
More informationFactoring of Prime Ideals in Extensions
Chapter 4 Factoring of Prime Ideals in Extensions 4. Lifting of Prime Ideals Recall the basic AKLB setup: A is a Dedekind domain with fraction field K, L is a finite, separable extension of K of degree
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationG = G 0 > G 1 > > G k = {e}
Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same
More informationFACTORING 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,
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More information11 Ideals. 11.1 Revisiting Z
11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(
More informationA New Generic Digital Signature Algorithm
Groups Complex. Cryptol.? (????), 1 16 DOI 10.1515/GCC.????.??? de Gruyter???? A New Generic Digital Signature Algorithm Jennifer Seberry, Vinhbuu To and Dongvu Tonien Abstract. In this paper, we study
More informationContinued 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
More informationHow To Solve A Minimum Set Covering Problem (Mcp)
Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix
More informationChapter 2 Remodulization of Congruences Proceedings NCUR VI. è1992è, Vol. II, pp. 1036í1041. Jeærey F. Gold Department of Mathematics, Department of Physics University of Utah Don H. Tucker Department
More informationRINGS WITH A POLYNOMIAL IDENTITY
RINGS WITH A POLYNOMIAL IDENTITY IRVING KAPLANSKY 1. Introduction. In connection with his investigation of projective planes, M. Hall [2, Theorem 6.2]* proved the following theorem: a division ring D in
More informationS on n elements. A good way to think about permutations is the following. Consider the A = 1,2,3, 4 whose elements we permute with the P =
Section 6. 1 Section 6. Groups of Permutations: : The Symmetric Group Purpose of Section: To introduce the idea of a permutation and show how the set of all permutations of a set of n elements, equipped
More informationGroup 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
More informationit 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
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationInvertible 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
More informationADDITIVE 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
More informationk, 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
More informationIdeal Class Group and Units
Chapter 4 Ideal Class Group and Units We are now interested in understanding two aspects of ring of integers of number fields: how principal they are (that is, what is the proportion of principal ideals
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationChapter 8 Vector Products Revisited: A New and Eæcient Method of Proving Vector Identities Proceedings NCUR X. è1996è, Vol. II, pp. 994í998 Jeærey F. Gold Department of Mathematics, Department of Physics
More informationIRREDUCIBLE 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
More informationTwo classes of ternary codes and their weight distributions
Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight
More informationFactorization 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
More informationFALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS. Mateusz Nikodem
Opuscula Mathematica Vol. 32 No. 4 2012 http://dx.doi.org/10.7494/opmath.2012.32.4.751 FALSE ALARMS IN FAULT-TOLERANT DOMINATING SETS IN GRAPHS Mateusz Nikodem Abstract. We develop the problem of fault-tolerant
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationMean Ramsey-Turán numbers
Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average
More informationThe van Hoeij Algorithm for Factoring Polynomials
The van Hoeij Algorithm for Factoring Polynomials Jürgen Klüners Abstract In this survey we report about a new algorithm for factoring polynomials due to Mark van Hoeij. The main idea is that the combinatorial
More informationGENERATING 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
More informationTHE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP
THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationRevised Version of Chapter 23. We learned long ago how to solve linear congruences. ax c (mod m)
Chapter 23 Squares Modulo p Revised Version of Chapter 23 We learned long ago how to solve linear congruences ax c (mod m) (see Chapter 8). It s now time to take the plunge and move on to quadratic equations.
More informationGalois Theory. Richard Koch
Galois Theory Richard Koch April 2, 2015 Contents 1 Preliminaries 4 1.1 The Extension Problem; Simple Groups.................... 4 1.2 An Isomorphism Lemma............................. 5 1.3 Jordan Holder...................................
More informationCollinear Points in Permutations
Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationSome Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.
Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,
More informationThe Structure of Galois Algebras
The Structure of Galois Algebras George Szeto Department of Mathematics, Bradley University Peoria, Illinois 61625 { U.S.A. Email: szeto@hilltop.bradley.edu and Lianyong Xue Department of Mathematics,
More informationThe Australian Journal of Mathematical Analysis and Applications
The Australian Journal of Mathematical Analysis and Applications Volume 7, Issue, Article 11, pp. 1-14, 011 SOME HOMOGENEOUS CYCLIC INEQUALITIES OF THREE VARIABLES OF DEGREE THREE AND FOUR TETSUYA ANDO
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationModule MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013
Module MA3411: Abstract Algebra Galois Theory Appendix Michaelmas Term 2013 D. R. Wilkins Copyright c David R. Wilkins 1997 2013 Contents A Cyclotomic Polynomials 79 A.1 Minimum Polynomials of Roots of
More informationNON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1
NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,
More informationminimal polyonomial Example
Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.
PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationThe Ideal Class Group
Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationTHE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written
More informationT ( a i x i ) = a i T (x i ).
Chapter 2 Defn 1. (p. 65) Let V and W be vector spaces (over F ). We call a function T : V W a linear transformation form V to W if, for all x, y V and c F, we have (a) T (x + y) = T (x) + T (y) and (b)
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 of Gallian s Contemporary Abstract Algebra. Most of the important
More informationLinear Algebra Notes for Marsden and Tromba Vector Calculus
Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of
More informationABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS
ABSTRACT ALGEBRA: A STUDY GUIDE FOR BEGINNERS John A. Beachy Northern Illinois University 2014 ii J.A.Beachy This is a supplement to Abstract Algebra, Third Edition by John A. Beachy and William D. Blair
More informationOn the representability of the bi-uniform matroid
On the representability of the bi-uniform matroid Simeon Ball, Carles Padró, Zsuzsa Weiner and Chaoping Xing August 3, 2012 Abstract Every bi-uniform matroid is representable over all sufficiently large
More informationOn three zero-sum Ramsey-type problems
On three zero-sum Ramsey-type problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationMATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.
MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar
More informationGROUP 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
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationCryptography and Network Security. Prof. D. Mukhopadhyay. Department of Computer Science and Engineering. Indian Institute of Technology, Kharagpur
Cryptography and Network Security Prof. D. Mukhopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Module No. # 01 Lecture No. # 12 Block Cipher Standards
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationGroup Theory. Contents
Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation
More informationSYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me
SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines
More informationNotes on Factoring. MA 206 Kurt Bryan
The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor
More information