Automorphisms of Additive Codes
|
|
- Myra Blake
- 5 years ago
- Views:
Transcription
1 Automorphisms of Additive Codes Jay A. Wood Western Michigan University jwood 32nd Ohio State-Denison Mathematics Conference Columbus, Ohio May 9, 2014
2 Acknowledgments/the Question I thank Philippe Langevin for the following question: Let K be a subfield of a finite field L. Like in the classical case, we see that coordinate permutations and component-wise K-linear isomorphisms of L preserve the Hamming weight of L n. Now let C be a K-subspace of L n, and let f be a K-linear isomorphism of C that preserves the Hamming weight. I wonder if it is true that f extends as a map like above? (by , May 9, 2013) JW (WMU) Automorphisms of Additive Codes May 9, / 22
3 Short Answer No. JW (WMU) Automorphisms of Additive Codes May 9, / 22
4 Definitions Let K be a finite field, and let L be a finite dimensional vector space over K. A K-linear code over L of length n is a K-linear subspace C L n. We use the Hamming weight on L. This is a crucial hypothesis. The Hamming weight on L differs from the Hamming weight on K l, where l = dim K L. This can be generalized to finite rings K and finite module alphabets L. JW (WMU) Automorphisms of Additive Codes May 9, / 22
5 Additive Codes Let L = F q, q = p l, and K = F p. Then K-linear codes over L are additive codes over L. Such codes are closed under addition. It follows that they are closed under K-scalar multiplication. Monomial transformations: permutations and component-wise application of K-linear isomorphisms of L (not field automorphisms). Monomial transformations preserve the Hamming weight coming from L. JW (WMU) Automorphisms of Additive Codes May 9, / 22
6 Generator Matrix A K-linear code is often given by a generator matrix G. The rows of G form a K-basis for C L n. If G has size m n, then G defines an injective K-linear map Λ : M = K m L n, whose image is the K-linear code C. (Inputs on the left.) JW (WMU) Automorphisms of Additive Codes May 9, / 22
7 Isometries An isometry of a K-linear code C L n is an invertible K-linear map f : C C that preserves the Hamming weight. In terms of Λ : M L n : an element f GL K (M) such that wt(xf Λ) = wt(xλ) for all x M. All the isometries of C form a group, the isometry group Isom(C) GL K (M). JW (WMU) Automorphisms of Additive Codes May 9, / 22
8 Monomial Transformations A monomial transformation of L n is an invertible K-linear transformation T : L n L n of the form (a 1,..., a n )T = (a σ(1) φ 1,..., a σ(n) φ n ), where σ is a permutation of {1,..., n} and the φ i are invertible K-linear transformations of L. Define the monomial group Monom(C) = {T monomial on L n : CT = C}. JW (WMU) Automorphisms of Additive Codes May 9, / 22
9 Restriction Map Monomial transformations preserve weight. By restricting to C, we have a natural map restr : Monom(C) Isom(C). Langevin s question: is this map onto? In matrix terms, if f Isom(C), is there a T Monom(C) such that fg = GT? If L = K, then the restriction map is always onto. (MacWilliams, 1961) JW (WMU) Automorphisms of Additive Codes May 9, / 22
10 Example Let K = F 2, L = F 4 = F 2 [ω]/(ω 2 + ω + 1). Let C L 3 be the additive code generated by: G = 1 ω 0 ω What are restr(monom(c)) and Isom(C)? JW (WMU) Automorphisms of Additive Codes May 9, / 22
11 Monomial Group restr(monom(c)) is a Klein 4-group, generated by f 1, f 2, below. f 1 = f 2 = e.g. f 1 f 2 G = 1 ω 0 ω 2 ω ω 1 = G 0 ω 0 ω JW (WMU) Automorphisms of Additive Codes May 9, / 22
12 Isometry Group However, Isom(C) is a dihedral group of order 8, generators f 1 and f 3 (below): f1 2 = 1, f 3 4 = 1, f 1 f 3 f 1 = f 1 3. f 3 = JW (WMU) Automorphisms of Additive Codes May 9, / 22
13 Weight Preservation List of codewords and their images under f 3 : ω 0 ω 1 0 ω 2 ω ω 1 ω ω ω ω ω 1 ω 2 ω 2 0 ω 1 0 ω ω 2 1 ω JW (WMU) Automorphisms of Additive Codes May 9, / 22
14 Non-Extendability of f 3 Compare G and f 3 G: G = 1 ω 0 ω 1 0 f 3 G = 1 ω ω 2 ω 2 0 The patterns of the columns are not compatible via a monomial transformation. JW (WMU) Automorphisms of Additive Codes May 9, / 22
15 How Bad Can Things Get? Generalize to linear codes over matrix modules: K = M k k (F q ), L = M k l (F q ), M = M k m (F q ). Theorem Assume k < l < m. Pick any two subgroups G 1 G 2 GL K (M) (subject to a closure condition). Then there exists a K-linear code C L n with underlying module M such that Isom(C) = G 2 and restr(monom(c)) = G 1. (Length n could be very big.) JW (WMU) Automorphisms of Additive Codes May 9, / 22
16 Linear Codes via Functionals (a) Assmus-Mattson (1963). Let K be a finite ring and L, M be finite left K-modules; L is the alphabet, and M is the information space. Given functionals λ 1,..., λ n M := Hom K (M, L), the image of Λ : M L n, x (xλ,..., xλ n ), is a K-linear code in L n. If one fixes a set of generators x 1,..., x k for M, then the matrix with (i, j)-entry x i λ j is a generator matrix for this K-linear code. JW (WMU) Automorphisms of Additive Codes May 9, / 22
17 Linear Codes via Functionals (b) G = GL K (L), the group of K-linear isomorphisms of L, acts on M = Hom K (M, L). Up to monomial equivalence, all that matters is the number of times the G-orbit of a functional λ M appears in the list λ 1,..., λ n : call this number the multiplicity η(λ). Conversely, a multiplicity function η : M G N determines a linear code, up to monomial equivalence. JW (WMU) Automorphisms of Additive Codes May 9, / 22
18 Linear Codes via Functionals (c) For the Hamming weight wt on L, the weight of a codeword is wt(x) = λ M G wt(xλ) η(λ), x M. This defines an additive map of function spaces W : F (M G, N) F (M, N). For linear codes over matrix modules and the Hamming weight, W has a nonzero kernel exactly when k < l. JW (WMU) Automorphisms of Additive Codes May 9, / 22
19 Linear Codes via Functionals (d) Tensor over Q to get a Q-linear transformation W : F (M G, Q) F (M, Q). For linear codes over matrix modules and the Hamming weight, if k < l, then it is possible to write down an explicit basis for ker W. JW (WMU) Automorphisms of Additive Codes May 9, / 22
20 Action by GL K (M) The K-linear isomorphisms GL K (M) act on M = Hom K (M, L), on M G, and on F (M G, Q). A linear code C with underlying module M corresponds, up to monomial equivalence, to a multiplicity function η F (M G, Q). Let f GL K (M). Then f restr(monom(c)) when f η = η, and f Isom(C) when f η η ker W. JW (WMU) Automorphisms of Additive Codes May 9, / 22
21 Sketch of Proof of Theorem By averaging if necessary, find η F (M G, Q) that is invariant under the group G 2 but not invariant under any larger subgroup. (This is where the closure condition plays a role.) So far, restr(monom(c)) = Isom(C) = G 2. By using the explicit basis of ker W, modify η to obtain η such that η η ker W, but η is invariant only under G 1 (and no larger). Then restr(monom(c )) = G 1 and Isom(C ) = Isom(C) = G 2. JW (WMU) Automorphisms of Additive Codes May 9, / 22
22 Corollaries Can choose G 1 = F q id M (minimal) and G 2 = GL K (M) (maximal). Such an example over K = F 2 and L = F 4 has length n = 24. Examples can then be found over any non-frobenius ring R, since the socle contains a matrix module with k < l. JW (WMU) Automorphisms of Additive Codes May 9, / 22
Linear 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 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 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 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 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 informationApplications of Finite Frobenius Rings to Algebraic Coding Theory I. Two Theorems of MacWilliams over Finite Frobenius Rings
Applications of Finite Frobenius Rings to Algebraic Coding Theory I. Two Theorems of MacWilliams over Finite Frobenius Rings Jay A. Wood Western Michigan University http://homepages.wmich.edu/ jwood Symposium
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 informationThe 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 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: 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 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 informationNOTES ON SPLITTING FIELDS
NOTES ON SPLITTING FIELDS CİHAN BAHRAN I will try to define the notion of a splitting field of an algebra over a field using my words, to understand it better. The sources I use are Peter Webb s and T.Y
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 informationNotes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop. Eric Sommers
Notes on nilpotent orbits Computational Theory of Real Reductive Groups Workshop Eric Sommers 17 July 2009 2 Contents 1 Background 5 1.1 Linear algebra......................................... 5 1.1.1
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 informationLECTURE 4: REPRESENTATION THEORY OF SL 2 (F) AND sl 2 (F)
LECTURE 4: REPRESENTATION THEORY OF SL 2 (F) AND sl 2 (F) IVAN LOSEV In this lecture we will discuss the representation theory of the algebraic group SL 2 (F) and of the Lie algebra sl 2 (F), where F is
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 informationMath 594. Solutions 5
Math 594. Solutions 5 Book problems 6.1: 7. Prove that subgroups and quotient groups of nilpotent groups are nilpotent (your proof should work for infinite groups). Give an example of a group G which possesses
More information1 Fields and vector spaces
1 Fields and vector spaces In this section we revise some algebraic preliminaries and establish notation. 1.1 Division rings and fields A division ring, or skew field, is a structure F with two binary
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 information5 Structure of 2-transitive groups
Structure of 2-transitive groups 25 5 Structure of 2-transitive groups Theorem 5.1 (Burnside) Let G be a 2-transitive permutation group on a set Ω. Then G possesses a unique minimal normal subgroup N and
More informationHomework 5 M 373K Mark Lindberg and Travis Schedler
Homework 5 M 373K Mark Lindberg and Travis Schedler 1. Artin, Chapter 3, Exercise.1. Prove that the numbers of the form a + b, where a and b are rational numbers, form a subfield of C. Let F be the numbers
More informationThus, the integral closure A i of A in F i is a finitely generated (and torsion-free) A-module. It is not a priori clear if the A i s are locally
Math 248A. Discriminants and étale algebras Let A be a noetherian domain with fraction field F. Let B be an A-algebra that is finitely generated and torsion-free as an A-module with B also locally free
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 information9. Finite fields. 1. Uniqueness
9. Finite fields 9.1 Uniqueness 9.2 Frobenius automorphisms 9.3 Counting irreducibles 1. Uniqueness Among other things, the following result justifies speaking of the field with p n elements (for prime
More informationMath 250: Higher Algebra Representations of finite groups
Math 250: Higher Algebra Representations of finite groups 1 Basic definitions Representations. A representation of a group G over a field k is a k-vector space V together with an action of G on V by linear
More informationU = 1 b. We fix the identification G a (F ) U sending b to ( 1 b
LECTURE 11: ADMISSIBLE REPRESENTATIONS AND SUPERCUSPIDALS I LECTURE BY CHENG-CHIANG TSAI STANFORD NUMBER THEORY LEARNING SEMINAR JANUARY 10, 2017 NOTES BY DAN DORE AND CHENG-CHIANG TSAI Let L is a global
More informationREPRESENTATIONS OF S n AND GL(n, C)
REPRESENTATIONS OF S n AND GL(n, C) SEAN MCAFEE 1 outline For a given finite group G, we have that the number of irreducible representations of G is equal to the number of conjugacy classes of G Although
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 information12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold.
12. Projective modules The blanket assumptions about the base ring k, the k-algebra A, and A-modules enumerated at the start of 11 continue to hold. 12.1. Indecomposability of M and the localness of End
More informationTC10 / 3. Finite fields S. Xambó
TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the
More informationMath 54. Selected Solutions for Week 5
Math 54. Selected Solutions for Week 5 Section 4. (Page 94) 8. Consider the following two systems of equations: 5x + x 3x 3 = 5x + x 3x 3 = 9x + x + 5x 3 = 4x + x 6x 3 = 9 9x + x + 5x 3 = 5 4x + x 6x 3
More informationExercises on chapter 0
Exercises on chapter 0 1. A partially ordered set (poset) is a set X together with a relation such that (a) x x for all x X; (b) x y and y x implies that x = y for all x, y X; (c) x y and y z implies that
More informationSymmetries of a q-ary Hamming Code
Symmetries of a q-ary Hamming Code Evgeny V. Gorkunov Novosibirsk State University Algebraic and Combinatorial Coding Theory Akademgorodok, Novosibirsk, Russia September 5 11, 2010
More informationne varieties (continued)
Chapter 2 A ne varieties (continued) 2.1 Products For some problems its not very natural to restrict to irreducible varieties. So we broaden the previous story. Given an a ne algebraic set X A n k, we
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 informationRepresentations and Linear Actions
Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category
More informationWhat is the Langlands program all about?
What is the Langlands program all about? Laurent Lafforgue November 13, 2013 Hua Loo-Keng Distinguished Lecture Academy of Mathematics and Systems Science, Chinese Academy of Sciences This talk is mainly
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics PICARD VESSIOT EXTENSIONS WITH SPECIFIED GALOIS GROUP TED CHINBURG, LOURDES JUAN AND ANDY R. MAGID Volume 243 No. 2 December 2009 PACIFIC JOURNAL OF MATHEMATICS Vol. 243,
More informationExtended 1-perfect additive codes
Extended 1-perfect additive codes J.Borges, K.T.Phelps, J.Rifà 7/05/2002 Abstract A binary extended 1-perfect code of length n + 1 = 2 t is additive if it is a subgroup of Z α 2 Zβ 4. The punctured code
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 informationMath 396. An application of Gram-Schmidt to prove connectedness
Math 396. An application of Gram-Schmidt to prove connectedness 1. Motivation and background Let V be an n-dimensional vector space over R, and define GL(V ) to be the set of invertible linear maps V V
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
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 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 information1 Hermitian symmetric spaces: examples and basic properties
Contents 1 Hermitian symmetric spaces: examples and basic properties 1 1.1 Almost complex manifolds............................................ 1 1.2 Hermitian manifolds................................................
More informationInteresting Examples on Maximal Irreducible Goppa Codes
Interesting Examples on Maximal Irreducible Goppa Codes Marta Giorgetti Dipartimento di Fisica e Matematica, Universita dell Insubria Abstract. In this paper a full categorization of irreducible classical
More informationPart II Galois Theory
Part II Galois Theory Theorems Based on lectures by C. Birkar Notes taken by Dexter Chua Michaelmas 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
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 informationChapter 2 Linear Transformations
Chapter 2 Linear Transformations Linear Transformations Loosely speaking, a linear transformation is a function from one vector space to another that preserves the vector space operations. Let us be more
More informationList of topics for the preliminary exam in algebra
List of topics for the preliminary exam in algebra 1 Basic concepts 1. Binary relations. Reflexive, symmetric/antisymmetryc, and transitive relations. Order and equivalence relations. Equivalence classes.
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 information(d) Since we can think of isometries of a regular 2n-gon as invertible linear operators on R 2, we get a 2-dimensional representation of G for
Solutions to Homework #7 0. Prove that [S n, S n ] = A n for every n 2 (where A n is the alternating group). Solution: Since [f, g] = f 1 g 1 fg is an even permutation for all f, g S n and since A n is
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 informationFINITE GROUP THEORY: SOLUTIONS FALL MORNING 5. Stab G (l) =.
FINITE GROUP THEORY: SOLUTIONS TONY FENG These are hints/solutions/commentary on the problems. They are not a model for what to actually write on the quals. 1. 2010 FALL MORNING 5 (i) Note that G acts
More informationPOLYNOMIAL CODES AND FINITE GEOMETRIES
POLYNOMIAL CODES AND FINITE GEOMETRIES E. F. Assmus, Jr and J. D. Key Contents 1 Introduction 2 2 Projective and affine geometries 3 2.1 Projective geometry....................... 3 2.2 Affine geometry..........................
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 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 informationConstructing Critical Indecomposable Codes
Constructing Critical Indecomposable Codes Judy L. Walker 1 Abstract Critical indecomposable codes were introduced by Assmus [1], who also gave a recursive construction for these objects. One of the key
More informationRaynaud on F -vector schemes and prolongation
Raynaud on F -vector schemes and prolongation Melanie Matchett Wood November 7, 2010 1 Introduction and Motivation Given a finite, flat commutative group scheme G killed by p over R of mixed characteristic
More informationComputer construction of the Monster
Computer construction of the Monster Stephen Linton (Department of Computer Science, University of St. Andrews) Richard Parker (UK Online Ltd, Shepton Mallet) Peter Walsh and Robert Wilson (School of Mathematics
More informationGassner Representation of the Pure Braid Group P 4
International Journal of Algebra, Vol. 3, 2009, no. 16, 793-798 Gassner Representation of the Pure Braid Group P 4 Mohammad N. Abdulrahim Department of Mathematics Beirut Arab University P.O. Box 11-5020,
More informationTree-adjoined spaces and the Hawaiian earring
Tree-adjoined spaces and the Hawaiian earring W. Hojka (TU Wien) Workshop on Fractals and Tilings 2009 July 6-10, 2009, Strobl (Austria) W. Hojka (TU Wien) () Tree-adjoined spaces and the Hawaiian earring
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 informationMAT 445/ INTRODUCTION TO REPRESENTATION THEORY
MAT 445/1196 - INTRODUCTION TO REPRESENTATION THEORY CHAPTER 1 Representation Theory of Groups - Algebraic Foundations 1.1 Basic definitions, Schur s Lemma 1.2 Tensor products 1.3 Unitary representations
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 information1. Let r, s, t, v be the homogeneous relations defined on the set M = {2, 3, 4, 5, 6} by
Seminar 1 1. Which ones of the usual symbols of addition, subtraction, multiplication and division define an operation (composition law) on the numerical sets N, Z, Q, R, C? 2. Let A = {a 1, a 2, a 3 }.
More informationRepresentation Theory
Representation Theory Representations Let G be a group and V a vector space over a field k. A representation of G on V is a group homomorphism ρ : G Aut(V ). The degree (or dimension) of ρ is just dim
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).
18.312: Algebraic Combinatorics Lionel Levine Lecture date: May 3, 2011 Lecture 22 Notes by: Lou Odette This lecture: Smith normal form of an integer matrix (linear algebra over Z). 1 Review of Abelian
More informationMath 210C. A non-closed commutator subgroup
Math 210C. A non-closed commutator subgroup 1. Introduction In Exercise 3(i) of HW7 we saw that every element of SU(2) is a commutator (i.e., has the form xyx 1 y 1 for x, y SU(2)), so the same holds for
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 informationOn permutation automorphism groups of q-ary Hamming codes
Eleventh International Workshop on Algebraic and Combinatorial Coding Theory June 16-22, 28, Pamporovo, Bulgaria pp. 119-124 On permutation automorphism groups of q-ary Hamming codes Evgeny V. Gorkunov
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 informationLecture 7.3: Ring homomorphisms
Lecture 7.3: Ring homomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson) Lecture 7.3:
More informationLecture 6: Etale Fundamental Group
Lecture 6: Etale Fundamental Group October 5, 2014 1 Review of the topological fundamental group and covering spaces 1.1 Topological fundamental group Suppose X is a path-connected topological space, and
More informationA Version of the Grothendieck Conjecture for p-adic Local Fields
A Version of the Grothendieck Conjecture for p-adic Local Fields by Shinichi MOCHIZUKI* Section 0: Introduction The purpose of this paper is to prove an absolute version of the Grothendieck Conjecture
More information1.8 Dual Spaces (non-examinable)
2 Theorem 1715 is just a restatement in terms of linear morphisms of a fact that you might have come across before: every m n matrix can be row-reduced to reduced echelon form using row operations Moreover,
More informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationHOMOMORPHISMS OF VECTOR BUNDLES ON CURVES AND PARABOLIC VECTOR BUNDLES ON A SYMMETRIC PRODUCT
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 140, Number 9, September 2012, Pages 3017 3024 S 0002-9939(2012)11227-4 Article electronically published on January 24, 2012 HOMOMORPHISMS OF VECTOR
More informationNon-Standard Coding Theory
Non-Standard Coding Theory Steven T. Dougherty July 3, 2013 Rosenbloom-Tsfasman Metric Codes with the Rosenbloom-Tsfasman Metric Rosenbloom-Tsfasman Metric Mat n,s (F q ) denotes the linear space of all
More informationThe Witt designs, Golay codes and Mathieu groups
The Witt designs, Golay codes and Mathieu groups 1 The Golay codes Let V be a vector space over F q with fixed basis e 1,..., e n. A code C is a subset of V. A linear code is a subspace of V. The vector
More informationINTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS
INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS HANMING ZHANG Abstract. In this paper, we will first build up a background for representation theory. We will then discuss some interesting topics in
More informationThe Ring of Monomial Representations
Mathematical Institute Friedrich Schiller University Jena, Germany Arithmetic of Group Rings and Related Objects Aachen, March 22-26, 2010 References 1 L. Barker, Fibred permutation sets and the idempotents
More informationRepresentations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III
Representations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III Lie algebras. Let K be again an algebraically closed field. For the moment let G be an arbitrary algebraic group
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 informationFUNCTORS AND ADJUNCTIONS. 1. Functors
FUNCTORS AND ADJUNCTIONS Abstract. Graphs, quivers, natural transformations, adjunctions, Galois connections, Galois theory. 1.1. Graph maps. 1. Functors 1.1.1. Quivers. Quivers generalize directed graphs,
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 informationSylow subgroups of GL(3,q)
Jack Schmidt We describe the Sylow p-subgroups of GL(n, q) for n 4. These were described in (Carter & Fong, 1964) and (Weir, 1955). 1 Overview The groups GL(n, q) have three types of Sylow p-subgroups:
More information0.2 Vector spaces. J.A.Beachy 1
J.A.Beachy 1 0.2 Vector spaces I m going to begin this section at a rather basic level, giving the definitions of a field and of a vector space in much that same detail as you would have met them in a
More informationPermutation Groups. John Bamberg, Michael Giudici and Cheryl Praeger. Centre for the Mathematics of Symmetry and Computation
Notation Basics of permutation group theory Arc-transitive graphs Primitivity Normal subgroups of primitive groups Permutation Groups John Bamberg, Michael Giudici and Cheryl Praeger Centre for the Mathematics
More informationCOMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK
Séminaire Lotharingien de Combinatoire 52 (2004), Article B52f COMMUTATIVE/NONCOMMUTATIVE RANK OF LINEAR MATRICES AND SUBSPACES OF MATRICES OF LOW RANK MARC FORTIN AND CHRISTOPHE REUTENAUER Dédié à notre
More informationOn some modules associated with Galois orbits by Victor Alexandru (1), Marian Vâjâitu (2), Alexandru Zaharescu (3)
Bull. Math. Soc. Sci. Math. Roumanie Tome 61 (109) No. 1, 2018, 3 11 On some modules associated with Galois orbits by Victor Alexandru (1), Marian Vâjâitu (2), Alexandru Zaharescu (3) Dedicated to the
More informationReal representations
Real representations 1 Definition of a real representation Definition 1.1. Let V R be a finite dimensional real vector space. A real representation of a group G is a homomorphism ρ VR : G Aut V R, where
More informationPart II Galois Theory
Part II Galois Theory Definitions Based on lectures by C. Birkar Notes taken by Dexter Chua Michaelmas 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationAlgebra Exam Syllabus
Algebra Exam Syllabus The Algebra comprehensive exam covers four broad areas of algebra: (1) Groups; (2) Rings; (3) Modules; and (4) Linear Algebra. These topics are all covered in the first semester graduate
More informationSUPPLEMENT ON THE SYMMETRIC GROUP
SUPPLEMENT ON THE SYMMETRIC GROUP RUSS WOODROOFE I presented a couple of aspects of the theory of the symmetric group S n differently than what is in Herstein. These notes will sketch this material. You
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 informationConstruction of quasi-cyclic self-dual codes
Construction of quasi-cyclic self-dual codes Sunghyu Han, Jon-Lark Kim, Heisook Lee, and Yoonjin Lee December 17, 2011 Abstract There is a one-to-one correspondence between l-quasi-cyclic codes over a
More informationMATRIX LIE GROUPS AND LIE GROUPS
MATRIX LIE GROUPS AND LIE GROUPS Steven Sy December 7, 2005 I MATRIX LIE GROUPS Definition: A matrix Lie group is a closed subgroup of Thus if is any sequence of matrices in, and for some, then either
More informationMathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps
Mathematics Department Stanford University Math 61CM/DM Vector spaces and linear maps We start with the definition of a vector space; you can find this in Section A.8 of the text (over R, but it works
More information