Applications of Finite Frobenius Rings to Algebraic Coding Theory I. Two Theorems of MacWilliams over Finite Frobenius Rings
|
|
- Anthony Atkins
- 5 years ago
- Views:
Transcription
1 Applications of Finite Frobenius Rings to Algebraic Coding Theory I. Two Theorems of MacWilliams over Finite Frobenius Rings Jay A. Wood Western Michigan University jwood Symposium on Ring and Representation Theory, Okayama University, September 25, 2011
2 Acknowledgments I am pleased to be visiting the city of Okayama, and I thank the symposium organizers, especially Professor Kunio Yamagata, for the invitation and for their hospitality. I thank the Japan Society for the Promotion of Science for its financial support of the symposium. JW (WMU) Theorems of MacWilliams September 25, / 30
3 For Your Amusement Table: Mathematical Genealogy of Two Speakers Dan Zacharia Jay Wood Maurice Auslander Shoshichi Kobayashi Robert Taylor Carl Allendoerfer JHC Whitehead Tracy Thomas Oswald Veblen EH Moore. Simeon Poisson Pierre-Simon Laplace (and JL Lagrange) Jean Le Rond d Alembert JW (WMU) Theorems of MacWilliams September 25, / 30
4 The Coding Problem How to ensure the integrity of a message transmitted over a noisy channel? Cleverly add redundancy. Encode possible messages (information) as a string of elements in an alphabet. Transmit the string over the channel. Detect errors and decode. JW (WMU) Theorems of MacWilliams September 25, / 30
5 Adding Algebraic Structure Assume the alphabet is a finite field F. Assume the set of messages M is a finite dimensional vector space over F of dimension k. The encoding is a linear embedding M F n, for some n. The image is a linear code of length n. JW (WMU) Theorems of MacWilliams September 25, / 30
6 Objectives for this Talk Some of the language of algebraic coding theory. Two theorems of MacWilliams valid over finite fields. Finite Frobenius rings and their character modules. Generalize the two theorems. JW (WMU) Theorems of MacWilliams September 25, / 30
7 Definitions (a) Let R be a finite associative ring with 1. Let A be a finite unital left R-module; A will be the alphabet. A left linear code over A of length n is a left R-submodule C A n. Special case: when A = R as a left module. JW (WMU) Theorems of MacWilliams September 25, / 30
8 Definitions (b) For x = (x 1,..., x n ) A n, the Hamming weight wt(x) equals the number of nonzero entries of x. For a linear code C A n, the Hamming weight enumerator is the polynomial W C (X, Y ) = x C X n wt(x) Y wt(x). JW (WMU) Theorems of MacWilliams September 25, / 30
9 Definitions (c) When A = R, define a dot product on R n by x y = n x i y i, i=1 for x = (x 1,..., x n ), y = (y 1,..., y n ) R n. When A = R, and C R n is a left linear code, define the right annihilator r(c) by r(c) = {y R n : x y = 0, x C}. JW (WMU) Theorems of MacWilliams September 25, / 30
10 MacWilliams Identities (1962/63) Let C F n q be a linear code over F q. The MacWilliams identities hold: W C (X, Y ) = 1 r(c) W r(c)(x + (q 1)Y, X Y ). JW (WMU) Theorems of MacWilliams September 25, / 30
11 Florence Jessie MacWilliams doctoral dissertation under Andrew Gleason at Harvard. (Mackey, Stone, Ge. Birkhoff, EH Moore.) Combinatorial Problems of Elementary Abelian Groups Three sections: Extension theorem on isometries The MacWilliams identities Coverings JW (WMU) Theorems of MacWilliams September 25, / 30
12 Monomial Transformations A monomial transformation T : R n R n has the form T (x 1,..., x n ) = (x σ(1) u 1,..., x σ(n) u n ), where σ is a permutation of {1,..., n} and u 1,..., u n are units of R. A monomial transformation preserves Hamming weight: wt(t (x)) = wt(x), x R n. JW (WMU) Theorems of MacWilliams September 25, / 30
13 MacWilliams Extension Theorem (1961/62) Assume R = F, a finite field. Assume C 1, C 2 F n are linear codes. If f : C 1 C 2 is a linear isomorphism that preserves Hamming weight, then f extends to a monomial transformation of F n. JW (WMU) Theorems of MacWilliams September 25, / 30
14 Generalizing the Theorems of MacWilliams When A = R, are the MacWilliams identities and the MacWilliams extension theorem still valid? Yes, if R is a finite Frobenius ring. Why Frobenius? There are character-theoretic proofs over finite fields that use the crucial property F = F. Frobenius rings satisfy R = R, and the same proofs will work. JW (WMU) Theorems of MacWilliams September 25, / 30
15 Characters Let (G, +) be a finite abelian group. A character π of G is a group homomorphism π : (G, +) (C, ), the nonzero complexes. The set Ĝ of all characters of G is itself a finite abelian group called the character group. Ĝ = G. As elements of the vector space of all functions from G to C, the characters are linearly independent. If M is a finite left R-module, then M is a right R-module. JW (WMU) Theorems of MacWilliams September 25, / 30
16 Two Useful Formulas π(x) = x G π(x) = π Ĝ { G, π = 1, 0, π 1. { G, x = 0, 0, x 0. JW (WMU) Theorems of MacWilliams September 25, / 30
17 Finite Frobenius Rings Finite ring R with 1. The (Jacobson) radical Rad(R) of R is the intersection of all maximal left ideals of R; Rad(R) is a two-sided ideal of R. The (left/right) socle Soc(R) of R is the ideal of R generated by all the simple left/right ideals of R. R is Frobenius if R/ Rad(R) = Soc(R) as one-sided modules (both left and right). JW (WMU) Theorems of MacWilliams September 25, / 30
18 Two Useful Theorems About Finite Frobenius Rings (Honold, 2001) R/ Rad(R) = Soc( R R) as left modules iff R/ Rad(R) = Soc(R R ) as right modules. R is Frobenius iff R = R as left modules iff R = R as right modules (1999). Corollary: R is Frobenius iff there exists a character π of R such that ker π contains no nonzero left (right) ideal of R. This π is a generating character. JW (WMU) Theorems of MacWilliams September 25, / 30
19 Fourier Transform Given a function f : G V, with V a complex vector space, its Fourier transform is a function ˆf : Ĝ V defined by ˆf (π) = x G π(x)f (x), π Ĝ. Fourier inversion: f (x) = 1 G π( x)ˆf (π), x G. π Ĝ JW (WMU) Theorems of MacWilliams September 25, / 30
20 Poisson Summation Formula For a subgroup H G, define its annihilator (Ĝ : H) = {π Ĝ : π(h) = 1}. (Ĝ : H) = G / H. For a subgroup H G and any a G, 1 f (a + h) = h H (Ĝ : H) π( a)ˆf (π). π (Ĝ:H) In particular, for a subgroup H G, 1 f (h) = ˆf h H (Ĝ : H) (π). π (Ĝ:H) JW (WMU) Theorems of MacWilliams September 25, / 30
21 MacWilliams Identities over Finite Frobenius Rings Theorem (1999) Let R be a finite Frobenius ring. If C R n is a left linear code, then the MacWilliams identities hold: W C (X, Y ) = 1 r(c) W r(c)(x + ( R 1)Y, X Y ). JW (WMU) Theorems of MacWilliams September 25, / 30
22 Proof of the MacWilliams Identities (a) The proof follows a proof due to Gleason (1970). Let R be Frobenius with generating character ρ. Let G = R n, an abelian group under addition. Let H = C, a left linear code. Let V = C[X, Y ], a complex vector space. Let f : G V be f (x) = X n wt(x) Y wt(x). JW (WMU) Theorems of MacWilliams September 25, / 30
23 Proof of the MacWilliams Identities (b) By Frobenius hypothesis, every character of G = R n has the form π a, for some a R n, with π a (x) = ρ(x a), x R n. π a (Ĝ : H) if and only if a r(c). (Ĝ : H) = r(c). JW (WMU) Theorems of MacWilliams September 25, / 30
24 Proof of the MacWilliams Identities (c) For f (x) = X n wt(x) Y wt(x), ˆf (π a ) = (X + ( R 1)Y ) n wt(a) (X Y ) wt(a). This requires some manipulations and use of π(x) formulas. (Next slide.) Recognize ˆf (π a ) as summand of W r(c) (X + ( R 1)Y, X Y ). JW (WMU) Theorems of MacWilliams September 25, / 30
25 Idea of Manipulation Let n = 1, f (x) = X 1 wt(x) Y wt(x). ˆf (π a ) = x R π a (x)x 1 wt(x) Y wt(x) = X + x 0 π a (x)y = { X + ( R 1)Y, a = 0, X Y, a 0, = (X + ( R 1)Y ) 1 wt(a) (X Y ) wt(a) JW (WMU) Theorems of MacWilliams September 25, / 30
26 MacWilliams Extension Theorem over Finite Frobenius Rings Theorem (1999) Let R be a finite Frobenius ring, and suppose C 1, C 2 R n are left linear codes. If f : C 1 C 2 is an R-linear isomorphism that preserves Hamming weight, then f extends to a monomial transformation of R n. JW (WMU) Theorems of MacWilliams September 25, / 30
27 Character-Theoretic Proof (a) The proof follows a proof of Ward and Wood in the finite field case (1996). View C i as the image of λ i : M R n, with λ i = (λ i,1,..., λ i,n ) and λ 2 = f λ 1. Using character sums, express Hamming weight as: wt(λ i (x)) = n n j=1 1 R π(λ i,j (x)), x M. π R JW (WMU) Theorems of MacWilliams September 25, / 30
28 Character-Theoretic Proof (b) Because f preserves Hamming weight, we get n π(λ 1,j (x)) = j=1 π R n ψ(λ 2,k (x)), x M. k=1 ψ R In a Frobenius ring, there is a generating character ρ. Every character of R has the form aρ, a R. (aρ)(r) := ρ(ra), r R. JW (WMU) Theorems of MacWilliams September 25, / 30
29 Character-Theoretic Proof (c) Re-write weight-preservation equation as n (aρ)(λ 1,j (x)) = j=1 a R n (bρ)(λ 2,k (x)), x M. k=1 b R Or as n ρ(λ 1,j (x)a) = j=1 a R n ρ(λ 2,k (x)b), x M. k=1 b R JW (WMU) Theorems of MacWilliams September 25, / 30
30 Character-Theoretic Proof (d) The last equation is an equation of characters on M. Characters are linearly independent, so one can match up terms (carefully). A technical argument involving a preordering given by divisibility in R shows how to match up terms with units as multipliers. This produces a permutation σ and units u i in R such that λ 2,k = λ 1,σ(k) u k, as desired. JW (WMU) Theorems of MacWilliams September 25, / 30
The MacWilliams Identities
The MacWilliams Identities Jay A. Wood Western Michigan University Colloquium March 1, 2012 The Coding Problem How to ensure the integrity of a message transmitted over a noisy channel? Cleverly add redundancy.
More informationFinite Frobenius Rings and the MacWilliams Identities
Finite Frobenius Rings and the MacWilliams Identities Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Algebra and Communications Seminar University
More informationFoundational Aspects of Linear Codes: 1. Characters and Frobenius rings
Foundational Aspects of Linear Codes: 1. Characters and Frobenius rings Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ On the Algebraic and Geometric
More informationAutomorphisms of Additive Codes
Automorphisms of Additive Codes Jay A. Wood Western Michigan University http://homepages.wmich.edu/ jwood 32nd Ohio State-Denison Mathematics Conference Columbus, Ohio May 9, 2014 Acknowledgments/the Question
More informationLinear Codes from the Axiomatic Viewpoint
Linear Codes from the Axiomatic Viewpoint Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ Noncommutative rings and their applications, IV University
More informationFoundational Aspects of Linear Codes: 3. Extension property: sufficient conditions
Foundational Aspects of Linear Codes: 3. Extension property: sufficient conditions Jay A. Wood Department of Mathematics Western Michigan University http://homepages.wmich.edu/ jwood/ On the Algebraic
More informationLECTURE NOTES ON THE MACWILLIAMS IDENTITIES AND THE EXTENSION THEOREM
LECTURE NOTES ON THE MACWILLIAMS IDENTITIES AND THE EXTENSION THEOREM FOR THE CIMAT INTERNATIONAL SCHOOL AND CONFERENCE ON CODING THEORY NOVEMBER 30 DECEMBER 2, 2008 DRAFT VERSION OF NOVEMBER 25, 2008
More informationLECTURE NOTES ON DUAL CODES AND THE MACWILLIAMS IDENTITIES
LECTURE NOTES ON DUAL CODES AND THE MACWILLIAMS IDENTITIES FOR THE WORKSHOP ON CODING THEORY AND GEOMETRY OF RATIONAL SURFACES MORELIA, MICHOACÁN, MÉXICO SEPTEMBER 23 26, 2009 DRAFT VERSION OF SEPTEMBER
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 informationCoding Theory as Pure Mathematics
Coding Theory as Pure Mathematics Steven T. Dougherty July 1, 2013 Origins of Coding Theory How does one communicate electronic information effectively? Namely can one detect and correct errors made in
More informationA Characterization of Modules with Cyclic Socle
A Characterization of Modules with Cyclic Socle arxiv:1505.00466v1 [math.ra] 3 May 2015 Ali Assem Department of Mathematics aassem@sci.cu.edu.eg September 24, 2018 Abstract In 2009, J. Wood [15] proved
More informationMacWilliams Type identities for m-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings
MacWilliams Type identities for m-spotty Rosenbloom-Tsfasman weight enumerators over finite commutative Frobenius rings Minjia Shi School of Mathematical Sciences of Anhui University, 230601 Hefei, Anhui,
More informationOpen Questions in Coding Theory
Open Questions in Coding Theory Steven T. Dougherty July 4, 2013 Open Questions The following questions were posed by: S.T. Dougherty J.L. Kim P. Solé J. Wood Hilbert Style Problems Hilbert Style Problems
More informationTHE EXTENSION THEOREM FOR BI-INVARIANT WEIGHTS OVER FROBENIUS RINGS AND FROBENIUS BIMODULES
THE EXTENSION THEOREM FOR BI-INVARIANT WEIGHTS OVER FROBENIUS RINGS AND FROBENIUS BIMODULES OLIVER W. GNILKE, MARCUS GREFERATH, THOMAS HONOLD, JAY A. WOOD, AND JENS ZUMBRÄGEL In memory of our colleague
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More information4.4 Noetherian Rings
4.4 Noetherian Rings Recall that a ring A is Noetherian if it satisfies the following three equivalent conditions: (1) Every nonempty set of ideals of A has a maximal element (the maximal condition); (2)
More information1 Introduction - Algebraic Coding Theory
RESEARCH STATEMENT Tefjol Pllaha University of Kentucky My current research lies in Algebraic Coding Theory, and it splits in two main directions: Isometries of Codes and Quantum Stabilizer Codes. In the
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics GROUP ACTIONS ON POLYNOMIAL AND POWER SERIES RINGS Peter Symonds Volume 195 No. 1 September 2000 PACIFIC JOURNAL OF MATHEMATICS Vol. 195, No. 1, 2000 GROUP ACTIONS ON POLYNOMIAL
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 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 informationMath 121 Homework 5: Notes on Selected Problems
Math 121 Homework 5: Notes on Selected Problems 12.1.2. Let M be a module over the integral domain R. (a) Assume that M has rank n and that x 1,..., x n is any maximal set of linearly independent elements
More informationMATH Examination for the Module MATH-3152 (May 2009) Coding Theory. Time allowed: 2 hours. S = q
MATH-315201 This question paper consists of 6 printed pages, each of which is identified by the reference MATH-3152 Only approved basic scientific calculators may be used. c UNIVERSITY OF LEEDS Examination
More informationIsometry Groups of Additive Codes over Finite Fields
Isometry Groups of Additive Codes over Finite Fields Jay A. Wood In memoriam: James Wood Jr., 1922 2015 Robert W. Moore, 1933 2016 Abstract. When C F n is a linear code over a finite field F, every linear
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA These are notes for our first unit on the algebraic side of homological algebra. While this is the last topic (Chap XX) in the book, it makes sense to
More informationInjective Modules and Matlis Duality
Appendix A Injective Modules and Matlis Duality Notes on 24 Hours of Local Cohomology William D. Taylor We take R to be a commutative ring, and will discuss the theory of injective R-modules. The following
More informationCoding theory: algebraic geometry of linear algebra David R. Kohel
Coding theory: algebraic geometry of linear algebra David R. Kohel 1. Introduction. Let R be a ring whose underlying set we call the alphabet. A linear code C over R is a free R-module V of rank k, an
More informationMacWilliams Extension Theorem for the Lee Weight
MacWilliams Extension Theorem for the Lee Weight Noncommutative rings and their applications V Lens 12-15 June 2017 Philippe Langevin IMATH, Toulon last revision June 11, 2017. A serie of joint works with
More informationLinear, Cyclic and Constacyclic Codes over S 4 = F 2 + uf 2 + u 2 F 2 + u 3 F 2
Filomat 28:5 (2014), 897 906 DOI 10.2298/FIL1405897O Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Linear, Cyclic and Constacyclic
More informationMATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups.
MATH 433 Applied Algebra Lecture 21: Linear codes (continued). Classification of groups. Binary codes Let us assume that a message to be transmitted is in binary form. That is, it is a word in the alphabet
More informationSAMPLE TEX FILE ZAJJ DAUGHERTY
SAMPLE TEX FILE ZAJJ DAUGHERTY Contents. What is the partition algebra?.. Graphs and equivalence relations.. Diagrams and their compositions.. The partition algebra. Combinatorial representation theory:
More informationREPRESENTATION THEORY WEEK 5. B : V V k
REPRESENTATION THEORY WEEK 5 1. Invariant forms Recall that a bilinear form on a vector space V is a map satisfying B : V V k B (cv, dw) = cdb (v, w), B (v 1 + v, w) = B (v 1, w)+b (v, w), B (v, w 1 +
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 informationx y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2
5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
More informationSEMI-INVARIANTS AND WEIGHTS OF GROUP ALGEBRAS OF FINITE GROUPS. D. S. Passman P. Wauters University of Wisconsin-Madison Limburgs Universitair Centrum
SEMI-INVARIANTS AND WEIGHTS OF GROUP ALGEBRAS OF FINITE GROUPS D. S. Passman P. Wauters University of Wisconsin-Madison Limburgs Universitair Centrum Abstract. We study the semi-invariants and weights
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 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 informationIsometries of Additive Codes
Isometries of Additive Codes Jay A. Wood Abstract. (June 15, 2016.) FIX: June 15, 2016. This needs to be re-written. Monomial transformations of linear codes are linear isometries for the Hamming weight.
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 informationALGEBRA QUALIFYING EXAM PROBLEMS
ALGEBRA QUALIFYING EXAM PROBLEMS Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND MODULES General
More informationREPRESENTATION THEORY WEEK 9
REPRESENTATION THEORY WEEK 9 1. Jordan-Hölder theorem and indecomposable modules Let M be a module satisfying ascending and descending chain conditions (ACC and DCC). In other words every increasing sequence
More informationPresentation 1
18.704 Presentation 1 Jesse Selover March 5, 2015 We re going to try to cover a pretty strange result. It might seem unmotivated if I do a bad job, so I m going to try to do my best. The overarching theme
More informationMinimal free resolutions of analytic D-modules
Minimal free resolutions of analytic D-modules Toshinori Oaku Department of Mathematics, Tokyo Woman s Christian University Suginami-ku, Tokyo 167-8585, Japan November 7, 2002 We introduce the notion of
More informationLecture 2 Some Sources of Lie Algebras
18.745 Introduction to Lie Algebras September 14, 2010 Lecture 2 Some Sources of Lie Algebras Prof. Victor Kac Scribe: Michael Donovan From Associative Algebras We saw in the previous lecture that we can
More informationLecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]
Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j
More informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 1 Error-correcting codes In this section of the notes, we have a quick look at coding theory. After a motivating introduction, we discuss the weight enumerator of a code,
More informationTensor Product of modules. MA499 Project II
Tensor Product of modules A Project Report Submitted for the Course MA499 Project II by Subhash Atal (Roll No. 07012321) to the DEPARTMENT OF MATHEMATICS INDIAN INSTITUTE OF TECHNOLOGY GUWAHATI GUWAHATI
More informationALGEBRA HW 4. M 0 is an exact sequence of R-modules, then M is Noetherian if and only if M and M are.
ALGEBRA HW 4 CLAY SHONKWILER (a): Show that if 0 M f M g M 0 is an exact sequence of R-modules, then M is Noetherian if and only if M and M are. Proof. ( ) Suppose M is Noetherian. Then M injects into
More informationExercises on chapter 4
Exercises on chapter 4 Always R-algebra means associative, unital R-algebra. (There are other sorts of R-algebra but we won t meet them in this course.) 1. Let A and B be algebras over a field F. (i) Explain
More informationA MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ
A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In
More informationFILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS.
FILTERED RINGS AND MODULES. GRADINGS AND COMPLETIONS. Let A be a ring, for simplicity assumed commutative. A filtering, or filtration, of an A module M means a descending sequence of submodules M = M 0
More informationEE 229B ERROR CONTROL CODING Spring 2005
EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with
More informationOn the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem
On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem Bertram Kostant, MIT Conference on Representations of Reductive Groups Salt Lake City, Utah July 10, 2013
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 information2 JAY A.WOOD is the extension theorem of MacWilliams. It is the analogue of the theorems of Witt [40] and Arf [3] on the extension of isometries for n
DUALITY FOR MODULES OVER FINITE RINGS AND APPLICATIONS TO CODING THEORY JAY A. WOOD In memory of Edward F. Assmus, Jr. Abstract. This paper sets a foundation for the study of linear codes over nite rings.
More information5 Dedekind extensions
18.785 Number theory I Fall 2016 Lecture #5 09/22/2016 5 Dedekind extensions In this lecture we prove that the integral closure of a Dedekind domain in a finite extension of its fraction field is also
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 informationRepresentations. 1 Basic definitions
Representations 1 Basic definitions If V is a k-vector space, we denote by Aut V the group of k-linear isomorphisms F : V V and by End V the k-vector space of k-linear maps F : V V. Thus, if V = k n, then
More informationINJECTIVE MODULES: PREPARATORY MATERIAL FOR THE SNOWBIRD SUMMER SCHOOL ON COMMUTATIVE ALGEBRA
INJECTIVE MODULES: PREPARATORY MATERIAL FOR THE SNOWBIRD SUMMER SCHOOL ON COMMUTATIVE ALGEBRA These notes are intended to give the reader an idea what injective modules are, where they show up, and, to
More informationIDEAL CLASSES AND RELATIVE INTEGERS
IDEAL CLASSES AND RELATIVE INTEGERS KEITH CONRAD The ring of integers of a number field is free as a Z-module. It is a module not just over Z, but also over any intermediate ring of integers. That is,
More informationAnd for polynomials with coefficients in F 2 = Z/2 Euclidean algorithm for gcd s Concept of equality mod M(x) Extended Euclid for inverses mod M(x)
Outline Recall: For integers Euclidean algorithm for finding gcd s Extended Euclid for finding multiplicative inverses Extended Euclid for computing Sun-Ze Test for primitive roots And for polynomials
More informationNON-SELF-INJECTIVE INJECTIVE HULLS WITH COMPATIBLE MULTIPLICATION. To Carl Faith on his eightieth birthday.
NON-SELF-INJECTIVE INJECTIVE HULLS WITH COMPATIBLE MULTIPLICATION VICTOR CAMILLO, IVO HERZOG, AND PACE P. NIELSEN Abstract. Let R be a ring, and let S be the injective hull of the right regular module
More informationRepresentation Theory
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section II 19I 93 (a) Define the derived subgroup, G, of a finite group G. Show that if χ is a linear character
More informationRings and groups. Ya. Sysak
Rings and groups. Ya. Sysak 1 Noetherian rings Let R be a ring. A (right) R -module M is called noetherian if it satisfies the maximum condition for its submodules. In other words, if M 1... M i M i+1...
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 informationALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA
ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA Kent State University Department of Mathematical Sciences Compiled and Maintained by Donald L. White Version: August 29, 2017 CONTENTS LINEAR ALGEBRA AND
More information1.5 The Nil and Jacobson Radicals
1.5 The Nil and Jacobson Radicals The idea of a radical of a ring A is an ideal I comprising some nasty piece of A such that A/I is well-behaved or tractable. Two types considered here are the nil and
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 informationCOHEN-MACAULAY RINGS SELECTED EXERCISES. 1. Problem 1.1.9
COHEN-MACAULAY RINGS SELECTED EXERCISES KELLER VANDEBOGERT 1. Problem 1.1.9 Proceed by induction, and suppose x R is a U and N-regular element for the base case. Suppose now that xm = 0 for some m M. We
More informationON REGULARITY OF RINGS 1
ON REGULARITY OF RINGS 1 Jianlong Chen Department of Mathematics, Harbin Institute of Technology Harbin 150001, P. R. China and Department of Applied Mathematics, Southeast University Nanjing 210096, P.
More informationMath 210B:Algebra, Homework 2
Math 210B:Algebra, Homework 2 Ian Coley January 21, 2014 Problem 1. Is f = 2X 5 6X + 6 irreducible in Z[X], (S 1 Z)[X], for S = {2 n, n 0}, Q[X], R[X], C[X]? To begin, note that 2 divides all coefficients
More informationAnswers to Final Exam
Answers to Final Exam MA441: Algebraic Structures I 20 December 2003 1) Definitions (20 points) 1. Given a subgroup H G, define the quotient group G/H. (Describe the set and the group operation.) The quotient
More information4.1. Paths. For definitions see section 2.1 (In particular: path; head, tail, length of a path; concatenation;
4 The path algebra of a quiver 41 Paths For definitions see section 21 (In particular: path; head, tail, length of a path; concatenation; oriented cycle) Lemma Let Q be a quiver If there is a path of length
More informationSome aspects of codes over rings
Some aspects of codes over rings Peter J. Cameron p.j.cameron@qmul.ac.uk Galway, July 2009 This is work by two of my students, Josephine Kusuma and Fatma Al-Kharoosi Summary Codes over rings and orthogonal
More informationCirculant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv: v1 [math.co] 26 Nov 2017
Circulant Hadamard matrices as HFP-codes of type C 4n C 2. arxiv:1711.09373v1 [math.co] 26 Nov 2017 J. Rifà Department of Information and Communications Engineering, Universitat Autònoma de Barcelona October
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
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 information4.5 Hilbert s Nullstellensatz (Zeros Theorem)
4.5 Hilbert s Nullstellensatz (Zeros Theorem) We develop a deep result of Hilbert s, relating solutions of polynomial equations to ideals of polynomial rings in many variables. Notation: Put A = F[x 1,...,x
More informationApplications of the Serre Spectral Sequence
Applications of the Serre Spectral Seuence Floris van Doorn November, 25 Serre Spectral Seuence Definition A Spectral Seuence is a seuence (E r p,, d r ) consisting of An R-module E r p, for p, and r Differentials
More informationLECTURES MATH370-08C
LECTURES MATH370-08C A.A.KIRILLOV 1. Groups 1.1. Abstract groups versus transformation groups. An abstract group is a collection G of elements with a multiplication rule for them, i.e. a map: G G G : (g
More informationMDS Codes over Finite Principal Ideal Rings
MDS Codes over Finite Principal Ideal Rings Steven T. Dougherty Department of Mathematics University of Scranton Scranton, PA 18510, USA Email: doughertys1@scranton.edu Jon-Lark Kim Department of Mathematics,
More informationStructure of rings. Chapter Algebras
Chapter 5 Structure of rings 5.1 Algebras It is time to introduce the notion of an algebra over a commutative ring. So let R be a commutative ring. An R-algebra is a ring A (unital as always) together
More information4.2 Chain Conditions
4.2 Chain Conditions Imposing chain conditions on the or on the poset of submodules of a module, poset of ideals of a ring, makes a module or ring more tractable and facilitates the proofs of deep theorems.
More informationCommunications II Lecture 9: Error Correction Coding. Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved
Communications II Lecture 9: Error Correction Coding Professor Kin K. Leung EEE and Computing Departments Imperial College London Copyright reserved Outline Introduction Linear block codes Decoding Hamming
More informationCodes and Rings: Theory and Practice
Codes and Rings: Theory and Practice Patrick Solé CNRS/LAGA Paris, France, January 2017 Geometry of codes : the music of spheres R = a finite ring with identity. A linear code of length n over a ring R
More informationFinite Fields and Their Applications
Finite Fields and Their Applications 17 2011 205 219 Contents lists available at ScienceDirect Finite Fields and Their Applications www.elsevier.com/locate/ffa Codes over R k, Gray maps and their binary
More informationA PROOF OF BURNSIDE S p a q b THEOREM
A PROOF OF BURNSIDE S p a q b THEOREM OBOB Abstract. We prove that if p and q are prime, then any group of order p a q b is solvable. Throughout this note, denote by A the set of algebraic numbers. We
More informationMATH5735 Modules and Representation Theory Lecture Notes
MATH5735 Modules and Representation Theory Lecture Notes Joel Beeren Semester 1, 2012 Contents 1 Why study modules? 4 1.1 Setup............................................. 4 1.2 How do you study modules?.................................
More informationREPRESENTATIONS OF U(N) CLASSIFICATION BY HIGHEST WEIGHTS NOTES FOR MATH 261, FALL 2001
9 REPRESENTATIONS OF U(N) CLASSIFICATION BY HIGHEST WEIGHTS NOTES FOR MATH 261, FALL 21 ALLEN KNUTSON 1 WEIGHT DIAGRAMS OF -REPRESENTATIONS Let be an -dimensional torus, ie a group isomorphic to The we
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationThus we get. ρj. Nρj i = δ D(i),j.
1.51. The distinguished invertible object. Let C be a finite tensor category with classes of simple objects labeled by a set I. Since duals to projective objects are projective, we can define a map D :
More informationSTABILITY OF FROBENIUS ALGEBRAS WITH POSITIVE GALOIS COVERINGS 1. Kunio Yamagata 2
STABILITY OF FROBENIUS ALGEBRAS WITH POSITIVE GALOIS COVERINGS 1 Kunio Yamagata 2 Abstract. A finite dimensional self-injective algebra will be determined when it is stably equivalent to a positive self-injective
More informationAlgebraically defined graphs and generalized quadrangles
Department of Mathematics Kutztown University of Pennsylvania Combinatorics and Computer Algebra 2015 July 22, 2015 Cages and the Moore bound For given positive integers k and g, find the minimum number
More informationRINGS WITH RESTRICTED MINIMUM CONDITION
RINGS WITH RESTRICTED MINIMUM CONDITION AVRAHAM J. ORNSTEIN1 In what follows, a ring will always mean an associative ring with unit element. Definition. A ring R is said to satisfy the restricted minimum
More informationA Primer on Homological Algebra
A Primer on Homological Algebra Henry Y Chan July 12, 213 1 Modules For people who have taken the algebra sequence, you can pretty much skip the first section Before telling you what a module is, you probably
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationClassifying Camina groups: A theorem of Dark and Scoppola
Classifying Camina groups: A theorem of Dark and Scoppola arxiv:0807.0167v5 [math.gr] 28 Sep 2011 Mark L. Lewis Department of Mathematical Sciences, Kent State University Kent, Ohio 44242 E-mail: lewis@math.kent.edu
More information11. Finitely-generated modules
11. Finitely-generated modules 11.1 Free modules 11.2 Finitely-generated modules over domains 11.3 PIDs are UFDs 11.4 Structure theorem, again 11.5 Recovering the earlier structure theorem 11.6 Submodules
More informationContradiction. Theorem 1.9. (Artin) Let G be a finite group of automorphisms of E and F = E G the fixed field of G. Then [E : F ] G.
1. Galois Theory 1.1. A homomorphism of fields F F is simply a homomorphism of rings. Such a homomorphism is always injective, because its kernel is a proper ideal (it doesnt contain 1), which must therefore
More information