Finite dihedral group algebras and coding theory
|
|
- Charlotte Mosley
- 5 years ago
- Views:
Transcription
1 Finite dihedral group algebras and coding theory César Polcino Milies Universidade de São Paulo
2 Basic FActs The basic elements to build a code are the following:
3 Basic FActs The basic elements to build a code are the following: A finite set, A called the alphabet. We shall denote by q = A the number of elements in A.
4 Basic FActs The basic elements to build a code are the following: A finite set, A called the alphabet. We shall denote by q = A the number of elements in A. Finite sequences of elements of the alphabet, that are called words. The number of elements in a word is called its length. We shall only consider codes in which all the words have the same length n.
5 Basic FActs The basic elements to build a code are the following: A finite set, A called the alphabet. We shall denote by q = A the number of elements in A. Finite sequences of elements of the alphabet, that are called words. The number of elements in a word is called its length. We shall only consider codes in which all the words have the same length n. A q-ary block code of length n is any subset of the set of all words of length n, i.e., the code C is a subset: C A n = A } A {{ A }. n veces
6 A classical scheme due to Shannon Information codification signal channel noise signal decodification receiver
7 A classical scheme due to Shannon Information codification signal channel noise signal decodification receiver The basic idea in coding theory, is to add information to the message, called redundancy, in such a way that it will turn possible to detect errors and correct them.
8 Definition Given two elements x = (x 1, x 2,..., x n ) and y = (y 1, y 2,..., y n ) in A n, the number of coordinates in which the two elements differ is called the Hamming distance from x to y; i.e.: d(x, y) = {i x i y i, 1 i n}
9 Definition Given two elements x = (x 1, x 2,..., x n ) and y = (y 1, y 2,..., y n ) in A n, the number of coordinates in which the two elements differ is called the Hamming distance from x to y; i.e.: d(x, y) = {i x i y i, 1 i n} Definición Given a code C A n the minimum distance of C is the number: d = min{d(x, y) x, y C, x y }.
10 Theorem Let C be a code with minimum distance d and set [ ] d 1 κ = 2 where [x] denotes the integral part of the real number x; i.e., the greatest integer smaller than or equal to x. Then C is capable of detecting n 1 errors and correcting κ errores.
11 Theorem Let C be a code with minimum distance d and set [ ] d 1 κ = 2 where [x] denotes the integral part of the real number x; i.e., the greatest integer smaller than or equal to x. Then C is capable of detecting n 1 errors and correcting κ errores. Definition The number κ is called the capacity of the code C.
12 Linear Codes Basic Facts We shall take, as an alphabet A, a finite field F.
13 Linear Codes Basic Facts We shall take, as an alphabet A, a finite field F. In this case, F n is an n-dimensional vector space over F.
14 Linear Codes Basic Facts We shall take, as an alphabet A, a finite field F. In this case, F n is an n-dimensional vector space over F. We shall take, as codes, subespaces of F n of dimensión m < n.
15 Linear Codes Basic Facts We shall take, as an alphabet A, a finite field F. In this case, F n is an n-dimensional vector space over F. We shall take, as codes, subespaces of F n of dimensión m < n. Definition A code C as above is called a linear code over F. If d the minimum distance of C, we shall call it a (n,m,d)-code.
16 Definition A linear code C F n is called a cyclic code if for every vector (a 0, a 1,..., a n 2, a n 1 ) in the code, we have that also the vector (a n 1, a 0, a 1,..., a n 2 ) is in the code.
17 Definition A linear code C F n is called a cyclic code if for every vector (a 0, a 1,..., a n 2, a n 1 ) in the code, we have that also the vector (a n 1, a 0, a 1,..., a n 2 ) is in the code. Notice that the definition implies that if (a 0, a 1,..., a n 2, a n 1 ) is in the code, then all the vectors obtained from this one by a cyclic permutation of its coordinates are also in the code.
18 Let R n = F[X ] X n 1 ; We shall denote by [f ] the class of the polynomial f F[X ] in R n.
19 Let R n = F[X ] X n 1 ; We shall denote by [f ] the class of the polynomial f F[X ] in R n. The mapping: ϕ : F n F[X ] X n 1 (a 0, a 1,..., a n 2, a n 1 ) F[X ] [a 0 + a 1 X a n 2 X n 2 + a n 1 X n 1 ].
20 Let R n = F[X ] X n 1 ; We shall denote by [f ] the class of the polynomial f F[X ] in R n. The mapping: ϕ : F n F[X ] X n 1 (a 0, a 1,..., a n 2, a n 1 ) F[X ] [a 0 + a 1 X a n 2 X n 2 + a n 1 X n 1 ]. ϕ is an isomorphism of F-vector spaces. Hence A code C F n is cyclic if and only if ϕ(c) is an ideal of R n.
21 In the case when C n = a a n = 1 = {1, a, a 2,..., a n 1 } is a cyclic group of order n, and F is a field, the elements of FC n are of the form: α = α 0 + α 1 a + α 2 a α n 1 a n 1.
22 In the case when C n = a a n = 1 = {1, a, a 2,..., a n 1 } is a cyclic group of order n, and F is a field, the elements of FC n are of the form: It is easy to show that α = α 0 + α 1 a + α 2 a α n 1 a n 1. FC n = Rn = F[X ] X n 1 ;
23 In the case when C n = a a n = 1 = {1, a, a 2,..., a n 1 } is a cyclic group of order n, and F is a field, the elements of FC n are of the form: It is easy to show that α = α 0 + α 1 a + α 2 a α n 1 a n 1. FC n = Rn = F[X ] X n 1 ; Hence, to study cyclic codes is equivalent to study ideals of a group algebra of the form FC n.
24 Definition A group code is an ideal of a finite group algebra.
25 Definition A group code is an ideal of a finite group algebra. If we assume that char(f) G, then to study group codes is equivalent to study ideals in group algebras, generated by idempotent elements
26 Idempotents from subgroups Let H be a subgroup of a finite group G and let F be a field such that car(f) G. The element e H = 1 H h h H is an idempotent of the group algebra FG, called the idempotent determined by H.
27 Idempotents from subgroups Let H be a subgroup of a finite group G and let F be a field such that car(f) G. The element e H = 1 H h h H is an idempotent of the group algebra FG, called the idempotent determined by H. e H is central if and only if H is normal in G.
28 If H is a normal subgroup of a group G, we have that FG Ĥ = F[G/H].
29 If H is a normal subgroup of a group G, we have that FG Ĥ = F[G/H]. so ) dim F ((FG) Ĥ = G H = [G : H].
30 If H is a normal subgroup of a group G, we have that FG Ĥ = F[G/H]. so ) dim F ((FG) Ĥ = G H = [G : H]. Set τ = {t 1, t 2,..., t k } a transversal of K in G (where k = [G : H] and we choose t 1 = 1),
31 If H is a normal subgroup of a group G, we have that FG Ĥ = F[G/H]. so ) dim F ((FG) Ĥ = G H = [G : H]. Set τ = {t 1, t 2,..., t k } a transversal of K in G (where k = [G : H] and we choose t 1 = 1), then is a a basis of (FG) Ĥ. {t i Ĥ 1 i k}
32 Is it possible to determine the primitive central idempotents from the idempotents determined by subgroups?
33 Theorem (Arora-Pruthi (1997), Ferraz-P.M. (2007)) Let F be a field with q elements and A a cyclic group of order p n such that o(q) = ϕ(p n ) in U(Z p n) (where ϕ denots Euler s Totient function). Let A = A 0 A 1 A n = {1} be the descending chain of all subgroups of A. Then, the set of primitive idempotents of FA is given by: ) e 0 = 1 p n ( a A a e i = Âi Âi 1, 1 i n.
34 Theorem (Arora and Pruthi (2002), Ferraz-PM (2007)) Let F be a field with q elements and A a cyclic group of order 2p n, p an odd prime, such that o(q) = ϕ(p n ) in U(Z 2p n). Write G = C A where A denotes the p-sylow subgroup of G and C = {1, t} is the 2-Sylow subgroup. If e i, 0 i n denotes the set of primitive idempotents of FA, then the primitive idempotents of FG are (1 + t) 2 e i and (1 t) 2 e i 0 i n.
35 Let A be an abelian p-group. For each subgroup H of A such that A/H {1} is cyclic, we shall construct an idempotent of FA. Since A/H is a cyclic subgroup of order a power of p, there exists a unique subgroup H of A, containing H, such that H /H = p.
36 Let A be an abelian p-group. For each subgroup H of A such that A/H {1} is cyclic, we shall construct an idempotent of FA. Since A/H is a cyclic subgroup of order a power of p, there exists a unique subgroup H of A, containing H, such that H /H = p. We set e H = Ĥ Ĥ. and also e G = 1 g. G g G
37 Theorem (Ferraz-PM (2007)) Let p be an odd prime and let A be an Abelian p-group of exponent p r. Then, the set of idemponts above is the set of primitive idempotents of FA if and only if one of the following holds: (i) p r = 2, and q is odd. (ii) p r = 4 and q 3 (mod 4). (iii) o(q) = ϕ(p n ) in U(Z p n).
38 Theorem (Ferraz-PM (2007)) Let p be an odd prime and let A be an Abelian p-group of exponent p r. Then, the set of idemponts above is the set of primitive idempotents of FA if and only if one of the following holds: (i) p r = 2, and q is odd. (ii) p r = 4 and q 3 (mod 4). (iii) o(q) = ϕ(p n ) in U(Z p n). Theorem (Ferraz-PM (2007)) Let p be an odd prime and let A be an abelian p-group of exponent 2p r. Write A = E B, where E is an elementary abelian 2-group and B a p-group. Then the primitive idempotents of FA are products of the form e.f, where e is a primitive idempotent of FE and f a primitive idempotent of FB.
39 Theorem (Ferraz-PM (2007)) Let F be a finite field with F = q, and let A be a finite abelian group, of exponent e. Then the primitive central idempotents can be constructed as above if and only if one of the following holds: (i) e = 2 and q is odd. (ii) e = 4 and q 3 (mod 4). (iii) e = p n and o(q) = ϕ(p n ) in U(Z p n). (iv) e = 2p n and o(q) = ϕ(p n ) in U(Z 2p n).
40 Let F be a finite field with q elements and let D n be the dihedral group of order 2n, i.e. D n = a, b a n = b 2 = 1, bab = a 1.
41 Let F be a finite field with q elements and let D n be the dihedral group of order 2n, i.e. D n = a, b a n = b 2 = 1, bab = a 1. We shall assume throughout that char(f) does not divide 2n.
42 Lemma Let F be a finite field and let ζ be an e th -root of unity, where e is the exponent of D n. Then, the number of simple components of FD n equals the number of simple components of QD n if and only if denoting by q the residue class of q in Z n, we have that either q = U(Z n ) or q is a subgroup of index 2 in U(Z n ) and 1 q.
43 Theorem (Ferraz, Dutra, PM) The idempotents of FD n can be written from idempotents determined by subgroups (in a way similar to that of the abelian case) if and only if one of the following holds: (i) n = 2 or 4 and q is odd. (ii) n = 2 m, with m 3 and q is congruent to either 3 or 5, modulo 8. (iii) n = p m with p an odd prime and the class q is a generator of the group U(Z p m). (iv) n = p m with p an odd prime, the class q is a generator of the group U 2 (Z p m) = {x 2 x U(Z p m}) and 1 is not a square modulo p m.
44 (v) n = 2p m with p an odd prime and the class q is a generator of the group U(Z 2p m). (vi) n = 2p m with p an odd prime, the class q is a generator of the group U 2 (Z p m) = {x 2 x U(Z 2p m}) and 1 is not a square modulo 2p m. (vii) n = 4p m with p an odd prime and both q and q have order ϕ(p m ) modulo 4p m. (viii) n = p m 1 1 pm 2 2 with p 1, p 2 odd primes, (ϕ(p m 1 1 ), ϕ(pm 2 2 )) = 2 and both q and q have order ϕ(p m 1 1 )ϕ(pm 2 2 )/2 modulo pm 1 1 pm 2 2. (ix) n = 2p m 1 1 pm 2 2 with p 1, p 2 odd primes, (ϕ(p m 1 1 ), ϕ(pm 2 2 )) = 2 and both q and q have order ϕ(p m 1 1 )ϕ(pm 2 2 )/2 modulo p m 1 1 pm 2 2.
45 Let Q n with n even be a generalized quaternion group; i.e, a group given by the presentation: with m 2. Q n = α, β α n = 1 β 2 = α n/2, β 1 αβ = α 1
46 Let Q n with n even be a generalized quaternion group; i.e, a group given by the presentation: with m 2. Q n = α, β α n = 1 β 2 = α n/2, β 1 αβ = α 1 Theorem The group algebras FD n and FQ n are isomorphic if and only if 4 n or q 1 (mod 4).
47 Code Parameters Theorem Let G be a finite group and let F be a field such that char(f) G. Let H and H be normal subgroups of G such that H H and set e = Ĥ Ĥ. Then, dim F (FG)e = G/H G/H = G ( 1 H ) H H and w((fg)e) = 2 H where w((fg)e) denotes the minimal distance of (FG)e.
48 Theorem Let G be a finite group and let F be a field such that char(f) G. Let H and H be normal subgroups of G such that H H and set e = Ĥ Ĥ. Let A be a transversal of H in G and τ a transversal of H in H containing 1. Then is a basis of (FG)e over F. B = {a(1 t)ĥ a A, t τ \ {1}}
49 Theorem Let H i Hi, be normal subgroups of a group G, 1 i k, such that Hi Ni = {1}, where N i denotes the subgroup generated by all Hj with j i. Set e = (Ĥ1 Ĥ 1 )(Ĥ2 Ĥ 2 ) (Ĥk Ĥ k ). Then, ( G dim F (FG)e = 1 H ) ( 1 H 1 H 2 H k H1 1 H ) ( 2 H2 1 H ) k Hk and w ((FG)e) = 2 k H 1 H 2 H k.
50 Theorem Let H i Hi, be normal subgroups of a group G, 1 i k, such that Hi Ni = {1}, where N i denotes the subgroup generated by all Hj with j i. Set e = (Ĥ1 Ĥ 1 )(Ĥ2 Ĥ 2 ) (Ĥk Ĥ k ). Let A be a transversal of H in G and τ i a transversal of H i in Hi containing 1, 1 i k. Then B = {a(1 t 1 )(1 t 2 ) (1 t k )Ĥ a A, t i τ i, t i 1, 1 i k} is a basis of (FG)e over F.
51 Dimensions and weights when n involves only one prime. n e dim[(fd n )e] w[(fd n )e] 4 1 a m e 2 i = Ĉ2 i Ĉ 2 i+1 2 m i 2 i+1 p m e p i = Ĉp i Ĉ p i+1 2ϕ(p i i ) 2p i
52 Dimensions and weights when n involves two primes. n dim[i] w[i] 2p m e 2 = Ĉ2 e p i = Ĉp i Ĉ p i+1 2ϕ(p m i ) 4p i e 2 = 1 Ĉ2 e p = Ĉpm 2 2pi e 2 = 1 Ĉ2 e p i = Ĉp i Ĉ p i+1 2ϕ(p m i ) 4p i 4p m e = Ĉ4 e i p = Ĉp i Ĉ p i+1 2ϕ(p m i ) 8p i e 2 i = Ĉ2 i Ĉ 2 i+1, e p = Ĉp m ϕ(2i ) 2. 2 i p m e 2 i = Ĉ2 i Ĉ 2 i+1, e p i = Ĉp i Ĉ p i+1 2ϕ(2 i )ϕ(p j ) 4. 2 i p j p m 1 1 p m 2 2 e p1 = Ĉ m p 1 1 e p i = Ĉp i Ĉ 1 1 p i+1 1 e p i = Ĉp i Ĉ 1 1 p i+1 1 e j = Ĉp j Ĉ j+1 p p e p2 = Ĉ m p 2 2 e j = Ĉp j Ĉ j+1 p p ϕ(p m 2 j 2 ) 2p m 1 1 p j 2 2ϕ(p m 1 i 1 ) 2p1 i pm 2 2 2ϕ(p m 1 i 1 )ϕ(p m 2 j 2 ) 4p1 i pj 2
53 Dimensions and weights when n = 2p m 1 1 pm 2 2. e e 1 e 2 dim[fd n)ee 1 e 2 ] w[(fd n)ee 1 e 2 ] Ĉ 2 Ĉ m 1 p 1 Ĉ 2 Ĉ p i Ĉ 1 p i Ĉ2 Ĉ m p Ĉ2 Ĉ p i Ĉ j+i 1 p 1 Ĉ 2 Ĉ p i Ĉ j+i 1 p 1 1 Ĉ2 Ĉ p i Ĉ j+i 1 p 1 Ĉ j Ĉ j+1 p p 2 2 C m 2 p 2 Ĉ j Ĉ j+1 p p 2 2 Ĉ m p 2 2 Ĉ j Ĉ j+1 p p 2 2 Ĉ p j 2 Ĉ p j+1 2 2ϕ(p m 2 j 2 ) 4p m 1 1 p j 2 2ϕ(p m 1 i 1 ) 4p1 i pm 2 2 2ϕ(p m 2 j 2 ) 4p m 1 1 p j 2 2ϕ(p m 1 i 1 ) 4p1 i pm 2 2 2ϕ(p m 1 i 1 ϕ(p m 2 j 2 ) 8p i 1 pj 2 2ϕ(p m 1 i 1 ϕ(p m 2 j 2 ) 8p i 1 pj 2
54 THANK YOU!!
Essential idempotents in group algebras and in Coding Theory
in group algebras and in Coding Theory César Polcino Milies Universidade de São Paulo and Universidade Federal do ABC NON COMMUTATIVE RINGS AND APPLICATIONS IV, LENS, 2015 Definition A linear code C F
More informationLeft Metacyclic Ideals
Centro Universiário da FEI Joint work with César Polcino Milies samir.assuena@fei.edu.br CIMPA RESEARCH SCHOOL ALGEBRAIC METHODS IN CODING THEORY Metacyclic Groups Definition A group G is metacyclic if
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationMath 451, 01, Exam #2 Answer Key
Math 451, 01, Exam #2 Answer Key 1. (25 points): If the statement is always true, circle True and prove it. If the statement is never true, circle False and prove that it can never be true. If the statement
More informationCourse 2316 Sample Paper 1
Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
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 informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More information7. Let K = 15 be the subgroup of G = Z generated by 15. (a) List the elements of K = 15. Answer: K = 15 = {15k k Z} (b) Prove that K is normal subgroup of G. Proof: (Z +) is Abelian group and any subgroup
More informationFIELD THEORY. Contents
FIELD THEORY MATH 552 Contents 1. Algebraic Extensions 1 1.1. Finite and Algebraic Extensions 1 1.2. Algebraic Closure 5 1.3. Splitting Fields 7 1.4. Separable Extensions 8 1.5. Inseparable Extensions
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 informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
More informationAN INTRINSICAL DESCRIPTION OF GROUP CODES
AN INTRINSICAL DESCRIPTION OF GROUP CODES JOSÉ JOAQUÍN BERNAL, ÁNGEL DEL RÍO, AND JUAN JACOBO SIMÓN Abstract. A (left) group code of length n is a linear code which is the image of a (left) ideal of a
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 informationStab(t) = {h G h t = t} = {h G h (g s) = g s} = {h G (g 1 hg) s = s} = g{k G k s = s} g 1 = g Stab(s)g 1.
1. Group Theory II In this section we consider groups operating on sets. This is not particularly new. For example, the permutation group S n acts on the subset N n = {1, 2,...,n} of N. Also the group
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 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 informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
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 informationGalois Theory TCU Graduate Student Seminar George Gilbert October 2015
Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s
More informationCyclotomic Cosets, Codes and Secret Sharing
Malaysian Journal of Mathematical Sciences 11(S) August: 59-73 (017) Special Issue: The 5th International Cryptology and Information Security Conference (New Ideas in Cryptology) MALAYSIAN JOURNAL OF MATHEMATICAL
More informationAbstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications
1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the
More informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
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 informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationProblem 4 (Wed Jan 29) Let G be a finite abelian group. Prove that the following are equivalent
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Problem 1 (Fri Jan 24) (a) Find an integer x such that x = 6 mod 10 and x = 15 mod 21 and 0 x 210. (b) Find the smallest positive integer
More informationSection 33 Finite fields
Section 33 Finite fields Instructor: Yifan Yang Spring 2007 Review Corollary (23.6) Let G be a finite subgroup of the multiplicative group of nonzero elements in a field F, then G is cyclic. Theorem (27.19)
More informationALGEBRA PH.D. QUALIFYING EXAM September 27, 2008
ALGEBRA PH.D. QUALIFYING EXAM September 27, 2008 A passing paper consists of four problems solved completely plus significant progress on two other problems; moreover, the set of problems solved completely
More informationA. Algebra and Number Theory
A. Algebra and Number Theory Public-key cryptosystems are based on modular arithmetic. In this section, we summarize the concepts and results from algebra and number theory which are necessary for an understanding
More informationAlgebra Exam, Spring 2017
Algebra Exam, Spring 2017 There are 5 problems, some with several parts. Easier parts count for less than harder ones, but each part counts. Each part may be assumed in later parts and problems. Unjustified
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 informationField Theory Qual Review
Field Theory Qual Review Robert Won Prof. Rogalski 1 (Some) qual problems ˆ (Fall 2007, 5) Let F be a field of characteristic p and f F [x] a polynomial f(x) = i f ix i. Give necessary and sufficient conditions
More informationThe Radicans. James B. Wilson. April 13, 2002
The Radicans James B. Wilson April 13, 2002 1 Radices of Integers Computational mathematics has brought awareness to the use of various bases in representing integers. The standard for most number systems
More informationElementary 2-Group Character Codes. Abstract. In this correspondence we describe a class of codes over GF (q),
Elementary 2-Group Character Codes Cunsheng Ding 1, David Kohel 2, and San Ling Abstract In this correspondence we describe a class of codes over GF (q), where q is a power of an odd prime. These codes
More informationSchool of Mathematics and Statistics. MT5824 Topics in Groups. Problem Sheet I: Revision and Re-Activation
MRQ 2009 School of Mathematics and Statistics MT5824 Topics in Groups Problem Sheet I: Revision and Re-Activation 1. Let H and K be subgroups of a group G. Define HK = {hk h H, k K }. (a) Show that HK
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 informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationFinite Fields. Saravanan Vijayakumaran Department of Electrical Engineering Indian Institute of Technology Bombay
1 / 25 Finite Fields Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay September 25, 2014 2 / 25 Fields Definition A set F together
More informationNotes on Primitive Roots Dan Klain
Notes on Primitive Roots Dan Klain last updated March 22, 2013 Comments and corrections are welcome These supplementary notes summarize the presentation on primitive roots given in class, which differed
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 informationFIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS
FIXED-POINT FREE ENDOMORPHISMS OF GROUPS RELATED TO FINITE FIELDS LINDSAY N. CHILDS Abstract. Let G = F q β be the semidirect product of the additive group of the field of q = p n elements and the cyclic
More informationGRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory.
GRE Subject test preparation Spring 2016 Topic: Abstract Algebra, Linear Algebra, Number Theory. Linear Algebra Standard matrix manipulation to compute the kernel, intersection of subspaces, column spaces,
More informationOn metacyclic extensions
On metacyclic extensions Masanari Kida 1 Introduction A group G is called metacyclic if it contains a normal cyclic subgroup N such that the quotient group G/N is also cyclic. The category of metacyclic
More informationS11MTH 3175 Group Theory (Prof.Todorov) Quiz 6 (PracticeSolutions) Name: 1. Let G and H be two groups and G H the external direct product of G and H.
Some of the problems are very easy, some are harder. 1. Let G and H be two groups and G H the external direct product of G and H. (a) Prove that the map f : G H H G defined as f(g, h) = (h, g) is a group
More informationHomework Problems, Math 200, Fall 2011 (Robert Boltje)
Homework Problems, Math 200, Fall 2011 (Robert Boltje) Due Friday, September 30: ( ) 0 a 1. Let S be the set of all matrices with entries a, b Z. Show 0 b that S is a semigroup under matrix multiplication
More informationNONLINEAR CONGRUENCES IN THE THEORY OF NUMBERS
Bulletin of the Marathwada Mathematical Society Vol. 12, No. 2, December 2011, Pages 24-31 NONLINEAR CONGRUENCES IN THE THEORY OF NUMBERS S.R.Joshi 8, Karmayog, Tarak Housing Society, Opp to Ramkrishna
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationAlgebra Exercises in group theory
Algebra 3 2010 Exercises in group theory February 2010 Exercise 1*: Discuss the Exercises in the sections 1.1-1.3 in Chapter I of the notes. Exercise 2: Show that an infinite group G has to contain a non-trivial
More informationGalois fields/1. (M3) There is an element 1 (not equal to 0) such that a 1 = a for all a.
Galois fields 1 Fields A field is an algebraic structure in which the operations of addition, subtraction, multiplication, and division (except by zero) can be performed, and satisfy the usual rules. More
More informationMAS309 Coding theory
MAS309 Coding theory Matthew Fayers January March 2008 This is a set of notes which is supposed to augment your own notes for the Coding Theory course They were written by Matthew Fayers, and very lightly
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 informationHOMEWORK Graduate Abstract Algebra I May 2, 2004
Math 5331 Sec 121 Spring 2004, UT Arlington HOMEWORK Graduate Abstract Algebra I May 2, 2004 The required text is Algebra, by Thomas W. Hungerford, Graduate Texts in Mathematics, Vol 73, Springer. (it
More informationPublic-key Cryptography: Theory and Practice
Public-key Cryptography Theory and Practice Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Chapter 2: Mathematical Concepts Divisibility Congruence Quadratic Residues
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 informationNumber Axioms. P. Danziger. A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b. a b S.
Appendix A Number Axioms P. Danziger 1 Number Axioms 1.1 Groups Definition 1 A Group is a set S together with a binary operation (*) on S, denoted a b such that for all a, b and c S 0. (Closure) 1. (Associativity)
More informationAlgebra Qualifying Exam, Fall 2018
Algebra Qualifying Exam, Fall 2018 Name: Student ID: Instructions: Show all work clearly and in order. Use full sentences in your proofs and solutions. All answers count. In this exam, you may use the
More informationTheory of Numbers Problems
Theory of Numbers Problems Antonios-Alexandros Robotis Robotis October 2018 1 First Set 1. Find values of x and y so that 71x 50y = 1. 2. Prove that if n is odd, then n 2 1 is divisible by 8. 3. Define
More informationLecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG)
Lecture 20 FUNDAMENTAL Theorem of Finitely Generated Abelian Groups (FTFGAG) Warm up: 1. Let n 1500. Find all sequences n 1 n 2... n s 2 satisfying n i 1 and n 1 n s n (where s can vary from sequence to
More informationThe 70th William Lowell Putnam Mathematical Competition Saturday, December 5, 2009
The 7th William Lowell Putnam Mathematical Competition Saturday, December 5, 9 A1 Let f be a real-valued function on the plane such that for every square ABCD in the plane, f(a) + f(b) + f(c) + f(d) =.
More informationAlgebra Homework, Edition 2 9 September 2010
Algebra Homework, Edition 2 9 September 2010 Problem 6. (1) Let I and J be ideals of a commutative ring R with I + J = R. Prove that IJ = I J. (2) Let I, J, and K be ideals of a principal ideal domain.
More information1 Finite abelian groups
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room
More informationThe Galois group of a polynomial f(x) K[x] is the Galois group of E over K where E is a splitting field for f(x) over K.
The third exam will be on Monday, April 9, 013. The syllabus for Exam III is sections 1 3 of Chapter 10. Some of the main examples and facts from this material are listed below. If F is an extension field
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More informationSUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT
SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.
More informationALGEBRA EXERCISES, PhD EXAMINATION LEVEL
ALGEBRA EXERCISES, PhD EXAMINATION LEVEL 1. Suppose that G is a finite group. (a) Prove that if G is nilpotent, and H is any proper subgroup, then H is a proper subgroup of its normalizer. (b) Use (a)
More informationNON-NILPOTENT GROUPS WITH THREE CONJUGACY CLASSES OF NON-NORMAL SUBGROUPS. Communicated by Alireza Abdollahi. 1. Introduction
International Journal of Group Theory ISSN (print): 2251-7650, ISSN (on-line): 2251-7669 Vol. 3 No. 2 (2014), pp. 1-7. c 2014 University of Isfahan www.theoryofgroups.ir www.ui.ac.ir NON-NILPOTENT GROUPS
More informationSOLVING SOLVABLE QUINTICS. D. S. Dummit
D. S. Dummit Abstract. Let f(x) = x 5 + px 3 + qx + rx + s be an irreducible polynomial of degree 5 with rational coefficients. An explicit resolvent sextic is constructed which has a rational root if
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 informationConstruction and Encoding of QC-LDPC Codes Using Group Rings
1 Construction and Encoding of QC-LDPC Codes Using Group Rings Hassan Khodaiemehr and Dariush Kiani arxiv:1701.00210v1 [cs.it] 1 Jan 2017 Abstract Quasi-cyclic (QC) low-density parity-check (LDPC) codes
More informationQuasi-cyclic codes. Jay A. Wood. Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico October 12, 2012
Quasi-cyclic codes Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra for Secure and Reliable Communications Modeling Morelia, Michoacán, Mexico
More informationMATH 433 Applied Algebra Lecture 19: Subgroups (continued). Error-detecting and error-correcting codes.
MATH 433 Applied Algebra Lecture 19: Subgroups (continued). Error-detecting and error-correcting codes. Subgroups Definition. A group H is a called a subgroup of a group G if H is a subset of G and the
More informationCONSTRUCTING GALOIS 2-EXTENSIONS OF THE 2-ADIC NUMBERS
CONSTRUCTING GALOIS 2-EXTENSIONS OF THE 2-ADIC NUMBERS CHAD AWTREY, JIM BEUERLE, AND JADE SCHRADER Abstract. Let Q 2 denote the field of 2-adic numbers, and let G be a group of order 2 n for some positive
More informationDISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3. Contents
DISCRETE MATH (A LITTLE) & BASIC GROUP THEORY - PART 3/3 T.K.SUBRAHMONIAN MOOTHATHU Contents 1. Cayley s Theorem 1 2. The permutation group S n 2 3. Center of a group, and centralizers 4 4. Group actions
More informationPROBLEMS FROM GROUP THEORY
PROBLEMS FROM GROUP THEORY Page 1 of 12 In the problems below, G, H, K, and N generally denote groups. We use p to stand for a positive prime integer. Aut( G ) denotes the group of automorphisms of G.
More informationAlgebra Ph.D. Preliminary Exam
RETURN THIS COVER SHEET WITH YOUR EXAM AND SOLUTIONS! Algebra Ph.D. Preliminary Exam August 18, 2008 INSTRUCTIONS: 1. Answer each question on a separate page. Turn in a page for each problem even if you
More informationA. (Groups of order 8.) (a) Which of the five groups G (as specified in the question) have the following property: G has a normal subgroup N such that
MATH 402A - Solutions for the suggested problems. A. (Groups of order 8. (a Which of the five groups G (as specified in the question have the following property: G has a normal subgroup N such that N =
More informationp-class Groups of Cyclic Number Fields of Odd Prime Degree
International Journal of Algebra, Vol. 10, 2016, no. 9, 429-435 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2016.6753 p-class Groups of Cyclic Number Fields of Odd Prime Degree Jose Valter
More information(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G.
(1) Let G be a finite group and let P be a normal p-subgroup of G. Show that P is contained in every Sylow p-subgroup of G. (2) Determine all groups of order 21 up to isomorphism. (3) Let P be s Sylow
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 informationGroup rings of finite strongly monomial groups: central units and primitive idempotents
Group rings of finite strongly monomial groups: central units and primitive idempotents joint work with E. Jespers, G. Olteanu and Á. del Río Inneke Van Gelder Vrije Universiteit Brussel Recend Trends
More informationSection VI.33. Finite Fields
VI.33 Finite Fields 1 Section VI.33. Finite Fields Note. In this section, finite fields are completely classified. For every prime p and n N, there is exactly one (up to isomorphism) field of order p n,
More informationALGEBRA QUALIFYING EXAM SPRING 2012
ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationPermutation Polynomials over Finite Fields
Permutation Polynomials over Finite Fields Omar Kihel Brock University 1 Finite Fields 2 How to Construct a Finite Field 3 Permutation Polynomials 4 Characterization of PP Finite Fields Let p be a prime.
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationMTH Abstract Algebra II S17. Review for the Final Exam. Part I
MTH 411-1 Abstract Algebra II S17 Review for the Final Exam Part I You will be allowed to use the textbook (Hungerford) and a print-out of my online lecture notes during the exam. Nevertheless, I recommend
More informationCLASS GROUPS, TOTALLY POSITIVE UNITS, AND SQUARES
proceedings of the american mathematical society Volume 98, Number 1. September 1986 CLASS GROUPS, TOTALLY POSITIVE UNITS, AND SQUARES H. M. EDGAR, R. A. MOLLIN1 AND B. L. PETERSON Abstract. Given a totally
More informationSolutions to Assignment 4
1. Let G be a finite, abelian group written additively. Let x = g G g, and let G 2 be the subgroup of G defined by G 2 = {g G 2g = 0}. (a) Show that x = g G 2 g. (b) Show that x = 0 if G 2 = 2. If G 2
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 informationSolutions for Problem Set 6
Solutions for Problem Set 6 A: Find all subfields of Q(ζ 8 ). SOLUTION. All subfields of K must automatically contain Q. Thus, this problem concerns the intermediate fields for the extension K/Q. In a
More informationGalois Theory, summary
Galois Theory, summary Chapter 11 11.1. UFD, definition. Any two elements have gcd 11.2 PID. Every PID is a UFD. There are UFD s which are not PID s (example F [x, y]). 11.3 ED. Every ED is a PID (and
More informationChief factors. Jack Schmidt. University of Kentucky
Chief factors Jack Schmidt University of Kentucky 2008-03-05 Chief factors allow a group to be studied by its representation theory on particularly natural irreducible modules. Outline What is a chief
More informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationMidterm Exam. There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of your work! Best 5
Department of Mathematical Sciences Instructor: Daiva Pucinskaite Modern Algebra June 22, 2017 Midterm Exam There are 6 problems. Your 5 best answers count. Please pay attention to the presentation of
More informationCSC 474 Information Systems Security
CSC Information Systems Security Topic. Basic Number Theory CSC Dr. Peng Ning Basic Number Theory We are talking about integers! Divisor We say that b divides a if a = mb for some m, denoted b a. b is
More informationGraduate Preliminary Examination
Graduate Preliminary Examination Algebra II 18.2.2005: 3 hours Problem 1. Prove or give a counter-example to the following statement: If M/L and L/K are algebraic extensions of fields, then M/K is algebraic.
More informationA strongly rigid binary relation
A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
More informationAlgebra Qualifying Exam August 2001 Do all 5 problems. 1. Let G be afinite group of order 504 = 23 32 7. a. Show that G cannot be isomorphic to a subgroup of the alternating group Alt 7. (5 points) b.
More information