Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless)
|
|
- Jodie Wilkerson
- 5 years ago
- Views:
Transcription
1 Latin square determinants and permanents Ken Johnson Penn State Abington College (Joint work with D. Donovan and I. Wanless)
2 Outline 1)The basic idea 2) Motivation 3) Summary of the group case 4) Results on latin square determinants 5) Ditto for permanents 6) Questions and further ideas
3 Latin square matrices Let L be an n n latin square on the elements {1, 2,..., n} Let {x 1, x 2,..., x n } be commuting variables. For each i replace i by x i in the square wherever it occurs. This is the latin square matrix Its determinant Θ L is the Latin square determinant of L. Example L = Θ L = (x x x 3 3 3x 1 x 2 x 3 ) = (x 1 + x 2 + x 3 )(x 1 + ωx 2 + ω 2 x 3 )(x 1 + ω 2 x 2 + ωx 3 ), where ω = e 2πi 3. In general Θ L is a homogeneous polynomial of degree n in n variables.
4 Motivation The group determinant of a finite group G = {g 1, g 2,..., g n } is the determinant of the latin square L G whose (i, j) th element is x gi g 1. j If G is the cyclic group of order 3, then L G = and Θ G = Θ LG is the negative of the previous polynomial. Group representation theory began when Frobenius invented a way to factorise Θ G for all G (in principle). In practice, the factorisation of Θ G where G is a cyclic group is more or less equivalent to the fast Fourier transform.
5 Summary of results in the group case 1) The irreducible factors of Θ G are in 1 : 1 correspondence with the irreducible representations. 2) Suppose the polynomial f corresponds to the representation ρ. Then the character of ρ can be read off from the coefficient of x1 n 1 in f. 3) G is uniquely determined up to isomorphism by Θ G. 4) G is uniquely determined by the coefficients of x1 n 1, x1 n 2 and x1 n 3 in Θ G. (these coefficients are polynomials). There are connections with random walks on groups, harmonic analysis,...
6 First results on latin square determinants They were first discussed in a paper by KWJ in 1986 (proc. Montreal conference) The motivation was to extend the (combinatorial) character theory for quasigroups developed with Jonathan Smith. Result (Peter Cameron) Almost all quasigroups have a trivial character theory, i.e the P-matrix of the corresponding association scheme is [ 1 n If Q is a quasigroup Q of order n and then corresponding to each basic (i.e. irreducible character) ρ of Q there is a factor ψ of Θ Q. For a group ψ is the m th power of the the irreducible polynomial which corresponds to ρ, where m is the degree of ρ. For an arbitrary quasigroup, the polynomial Θ Q is not so nice. ].
7 The connection with graph theory The latin square matrix can be interpreted as a transition matrix for a random walk on a loop or quasigroup, where the variables are interpreted as probabilities. If the probabilities are non-zero on a generating set, this is a random walk on the Cayley graph.
8 Factorisation There is always the trivial factor n i=1 x i. Example: The Octonion loop O of order 16. The character theory gives eight linear characters (from the homomorphism to the abelian group C 2 C 2 C 2 ) and then one factor of degree 8. This factor decomposes into the 4 th power of a sum of eight squares of terms (x ei x ei ) and therefore can be decomposed into linear factors over the Octonions The smallest Moufang loop of order 12 has four linear characters which give rise to linear factors, the remaining factor of degree 8 corresponding to the non-linear character (of degree 8) This factor decomposes into two factors of degree 4.
9 Results by other authors related to determinants and permanents A transversal in a latin square is a set of n entries in distinct rows and columns which are all distinct. (example of C 3 above) A latin square has an orthogonal mate if and only if it has n non-intersecting transversals Balasubramanian (1990) Relates the numbers of transversals to the permanent. Akhbari and Alireza (2004) Transversals and multicolored matchings. Falcon (2008) Determinants of latin squares of a given pattern
10 First results (continued) A group is determined up to isomorphism by its determinant. For a latin square, define the trisotopy relation T on the set of n n latin squares by LTM if L is either isotopic to M or to the transpose of M. Suppose f (x 1, x 2,..., x n ) and g(x 1, x 2,..., x n ) are polynomials. They are equivalent if there exists a permutation σ S n such that g(x 1, x 2,..., x n ) = ±f (x σ(1), x σ(2),..., x σ(n) ). It is clear that trisotopic squares have equivalent determinants. By direct calculation, squares up to order 7 are determined up to trisotopy by their determinants.
11 However, D. Ford and KWJ calculated that of the trisotopy classes of squares of size 8 all except 37 are determined by their determinants, and these merge into 12 classes with distinct determinants. Each of the exceptional squares has the form [ ] A B C D where A and D are 4 4 latin squares on {1, 2, 3, 4} and B and C are 4 4 latin squares on {5, 6, 7, 8}. (Among other things their character theory is non-trivial)
12 Recent results with Donovan-Wanless (on both det(l) and per(l)) per(l) is obtained by using the permanent instead of the determinant above. Numerical result: Let L be an n n latin square. If the monomial terms in either det(l) or per(l) are collected, there cannot be more than ( ) 2n 1 n(n 1) n such terms. The permanent does distinguish all the trisotopy squares of order 8. For all m 3 there exist pairs (A, B) of nonisotropic latin squares of order 3m with equivalent permanents and determinants. If per(a)=per(b) then A and B have the same number of transversals. (not true for determinants). If per(a)=per(b) then A and B need not have the same number of orthogonal mates
13 Numbers of terms An example of the data produced The number of monomial terms (after collection) for the squares of order 8 can be summarised as follows: For the circulant (cyclic group) 810 in both det and per. mean in det 5174 mean in per 5759 most in det 5491 most in per 6054 bound calculated earlier 6379 Results suggest that the minimum should always occur at the circulant.
14 Questions Are there squares with equal permanents but dissimilar determinants? Are there pairs with equal determinants, but with autotopism groups of different orders? The permanent or determinant determines the number of 2 2 subsquares. Can squares with equal permanents have different numbers of k k subsquares? Is there a square which is not isotopic to a group matrix, but which has the same permanent (or determinant) as that of a group? Among squares of order n, does the circulant minimise the number of monomials in the determinant or permanent?
15 Dickson s results on the mod p case The group determinant mod p of a p-group. Lemma Let H be any p-group of order r = p s. Let P be the upper triangular matrix of the form r (r 1)(r 2)/ r 1 1. Then a suitable ordering of H exists such that, modulo p, PX H P 1 is a lower triangular matrix with identical diagonal entries of the form α = r i=1 x h i. The group determinant Θ H modulo p is thus α r.
Quasigroups and Related Systems 14 (2006), Kenneth W. Johnson. Abstract. 1. Introduction
Quasigroups and Related Systems 14 (2006), 27 41 The construction of loops using right division and Ward quasigroups Kenneth W. Johnson Abstract Constructions are given of families of loops which can be
More informationOn the size of autotopism groups of Latin squares.
On the size of autotopism groups of Latin squares. Douglas Stones and Ian M. Wanless School of Mathematical Sciences Monash University VIC 3800 Australia {douglas.stones, ian.wanless}@sci.monash.edu.au
More informationTransversals in Latin Squares
Transversals in Latin Squares Ian Wanless Monash University Australia Loops 07 workshop, Prague, Aug 2007 A latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each
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 informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationLatin squares: Equivalents and equivalence
Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to
More informationMIT Algebraic techniques and semidefinite optimization May 9, Lecture 21. Lecturer: Pablo A. Parrilo Scribe:???
MIT 6.972 Algebraic techniques and semidefinite optimization May 9, 2006 Lecture 2 Lecturer: Pablo A. Parrilo Scribe:??? In this lecture we study techniques to exploit the symmetry that can be present
More informationA Markov chain for certain triple systems
A Markov chain for certain triple systems Peter J. Cameron Queen Mary, University of London and Gonville & Caius College, Cambridge INI Workshop on Markov Chain Monte Carlo methods March 2008 Latin squares
More informationCycle structure of autotopisms of quasigroups and Latin squares
Cycle structure of autotopisms of quasigroups and Latin squares Douglas S. Stones 1,2, Petr Vojtěchovský 3 and Ian M. Wanless 1 1 School of Mathematical Sciences and 2 Clayton School of Information Technology
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 informationSelf-distributive quasigroups and quandles
Self-distributive quasigroups and quandles David Stanovský Charles University, Prague, Czech Republic Kazakh-British Technical University, Almaty, Kazakhstan stanovsk@karlin.mff.cuni.cz June 2015 David
More informationTriceratopisms of Latin Squares
Triceratopisms of Latin Squares Ian Wanless Joint work with Brendan McKay and Xiande Zhang Latin squares A Latin square of order n is an n n matrix in which each of n symbols occurs exactly once in each
More informationFactorial Designs and Harmonic Analysis on Finite Abelian Groups
Factorial Designs and Harmonic Analysis on Finite Abelian Groups P.M. van de Ven EURANDOM P.O. Box 513, 5600 MB, Eindhoven The Netherlands email: vandeven@eurandom.tue.nl A. Di Bucchianico EURANDOM and
More informationRepresentation Theory. Ricky Roy Math 434 University of Puget Sound
Representation Theory Ricky Roy Math 434 University of Puget Sound May 2, 2010 Introduction In our study of group theory, we set out to classify all distinct groups of a given order up to isomorphism.
More informationOn Snevily s Conjecture and Related Topics
Jiangsu University (Nov. 24, 2017) and Shandong University (Dec. 1, 2017) and Hunan University (Dec. 10, 2017) On Snevily s Conjecture and Related Topics Zhi-Wei Sun Nanjing University Nanjing 210093,
More informationA FAMILY OF FINITE GELFAND PAIRS ASSOCIATED WITH WREATH PRODUCTS
A FAMILY OF FINITE GELFAND PAIRS ASSOCIATED WITH WREATH PRODUCTS CHAL BENSON AND GAIL RATCLIFF Abstract. Consider the wreath product G n = Γ n S n of a finite group Γ with the symmetric group S n. Letting
More informationPermutation Groups and Transformation Semigroups Lecture 2: Semigroups
Permutation Groups and Transformation Semigroups Lecture 2: Semigroups Peter J. Cameron Permutation Groups summer school, Marienheide 18 22 September 2017 I am assuming that you know what a group is, but
More informationMöbius Functions and Semigroup Representation Theory
Möbius Functions and Semigroup Representation Theory December 31, 2007 Inverse Semigroups Just as groups abstract permutations, inverse semigroups abstract partial permutations. A semigroup S is an inverse
More informationClassifying partial Latin rectangles
Raúl Falcón 1, Rebecca Stones 2 rafalgan@us.es 1 Department of Applied Mathematics I. University of Seville. 2 College of Computer and Control Engineering. Nankai University. Bergen. September 4, 2015.
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More information1 Chapter 6 - Exercise 1.8.cf
1 CHAPTER 6 - EXERCISE 1.8.CF 1 1 Chapter 6 - Exercise 1.8.cf Determine 1 The Class Equation of the dihedral group D 5. Note first that D 5 = 10 = 5 2. Hence every conjugacy class will have order 1, 2
More informationPermutation groups/1. 1 Automorphism groups, permutation groups, abstract
Permutation groups Whatever you have to do with a structure-endowed entity Σ try to determine its group of automorphisms... You can expect to gain a deep insight into the constitution of Σ in this way.
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 informationEnumeration of MOLS of small order
Enumeration of MOLS of small order arxiv:1406.3681v2 [math.co] 13 Oct 2014 Judith Egan and Ian M. Wanless School of Mathematical Sciences Monash University VIC 3800 Australia {judith.egan, ian.wanless}@monash.edu
More informationIntegral Bases. 1. Resultants
. Resultants Integral Bases Suppose f and g are polynomials in one or more variables including x) with integer coefficients. Say f = A 0 x m + A x m + + A m, g = B 0 x n + B x n + + B n, with A 0,...,
More informationIntroduction to Group Theory
Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)
More informationCharacter tables for some small groups
Character tables for some small groups P R Hewitt U of Toledo 12 Feb 07 References: 1. P Neumann, On a lemma which is not Burnside s, Mathematical Scientist 4 (1979), 133-141. 2. JH Conway et al., Atlas
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 informationOn the Number of Latin Squares
Annals of Combinatorics 9 (2005) 335-344 0218-0006/05/030335-10 DOI 10.1007/s00026-005-0261-7 c Birkhäuser Verlag, Basel, 2005 Annals of Combinatorics On the Number of Latin Squares Brendan D. McKay and
More informationCayley Graphs and the Discrete Fourier Transform
Cayley Graphs and the Discrete Fourier Transform Alan Mackey Advisor: Klaus Lux May 15, 2008 Abstract Given a group G, we can construct a graph relating the elements of G to each other, called the Cayley
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 informationPlanes and MOLS. Ian Wanless. Monash University
Planes and MOLS Ian Wanless Monash University A few of our favourite things A projective plane of order n. An orthogonal array OA(n + 1, n) (strength 2) A (complete) set of n 1 MOLS(n). A classical result
More informationThe critical group of a graph
The critical group of a graph Peter Sin Texas State U., San Marcos, March th, 4. Critical groups of graphs Outline Laplacian matrix of a graph Chip-firing game Smith normal form Some families of graphs
More informationOrthogonal trades in complete sets of MOLS
Orthogonal trades in complete sets of MOLS Nicholas J. Cavenagh Department of Mathematics and Statistics University of Waikato New Zealand Diane M. Donovan nickc@waikato.ac.nz Centre for Discrete Mathematics
More informationELEMENTARY MATRIX ALGEBRA
ELEMENTARY MATRIX ALGEBRA Third Edition FRANZ E. HOHN DOVER PUBLICATIONS, INC. Mineola, New York CONTENTS CHAPTER \ Introduction to Matrix Algebra 1.1 Matrices 1 1.2 Equality of Matrices 2 13 Addition
More informationRepresentations Associated to the Group Matrix
Brigham Young University BYU ScholarsArchive All Theses and Dissertations 014-0-8 Representations Associated to the Group Matrix Joseph Aaron Keller Brigham Young University - Provo Follow this and additional
More informationREPRESENTATION THEORY. WEEK 4
REPRESENTATION THEORY. WEEK 4 VERA SERANOVA 1. uced modules Let B A be rings and M be a B-module. Then one can construct induced module A B M = A B M as the quotient of a free abelian group with generators
More informationYale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall Midterm Exam Review Solutions
Yale University Department of Mathematics Math 350 Introduction to Abstract Algebra Fall 2015 Midterm Exam Review Solutions Practice exam questions: 1. Let V 1 R 2 be the subset of all vectors whose slope
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 informationMath 215B: Solutions 1
Math 15B: Solutions 1 Due Thursday, January 18, 018 (1) Let π : X X be a covering space. Let Φ be a smooth structure on X. Prove that there is a smooth structure Φ on X so that π : ( X, Φ) (X, Φ) is an
More informationOn the degree of local permutation polynomials
On the degree of local permutation polynomials Wiebke S. Diestelkamp Department of Mathematics University of Dayton Dayton, OH 45469-2316 wiebke@udayton.edu Stephen G. Hartke Department of Mathematics
More informationLiouvillian solutions of third order differential equations
Article Submitted to Journal of Symbolic Computation Liouvillian solutions of third order differential equations Felix Ulmer IRMAR, Université de Rennes, 0 Rennes Cedex, France felix.ulmer@univ-rennes.fr
More informationAn enumeration of equilateral triangle dissections
arxiv:090.599v [math.co] Apr 00 An enumeration of equilateral triangle dissections Aleš Drápal Department of Mathematics Charles University Sokolovská 83 86 75 Praha 8 Czech Republic Carlo Hämäläinen Department
More informationLinear algebra I Homework #1 due Thursday, Oct Show that the diagonals of a square are orthogonal to one another.
Homework # due Thursday, Oct. 0. Show that the diagonals of a square are orthogonal to one another. Hint: Place the vertices of the square along the axes and then introduce coordinates. 2. Find the equation
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationLecture 4.1: Homomorphisms and isomorphisms
Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture
More informationChapter 1. Latin Squares. 1.1 Latin Squares
Chapter Latin Squares. Latin Squares Definition... A latin square of order n is an n n array in which n distinct symbols are arranged so that each symbol occurs exactly once in each row and column. If
More informationFinite Subgroups of Gl 2 (C) and Universal Deformation Rings
Finite Subgroups of Gl 2 (C) and Universal Deformation Rings University of Missouri Conference on Geometric Methods in Representation Theory November 21, 2016 Goal Goal : Find connections between fusion
More informationQ N id β. 2. Let I and J be ideals in a commutative ring A. Give a simple description of
Additional Problems 1. Let A be a commutative ring and let 0 M α N β P 0 be a short exact sequence of A-modules. Let Q be an A-module. i) Show that the naturally induced sequence is exact, but that 0 Hom(P,
More informationConway s group and octonions
Conway s group and octonions Robert A. Wilson School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E 4NS Submitted 7th March 009 Abstract We give a description of the
More informationNon-Extendible Latin Cuboids
Non-Extendible Latin Cuboids Darryn Bryant db@maths.uq.edu.au, Barbara Maenhaut bmm@maths.uq.edu.au Nicholas J. Cavenagh nicholas cavenagh@yahoo.co.uk Ian M. Wanless ian.wanless@monash.edu Kyle Pula jpula@math.du.edu
More informationECS130 Scientific Computing. Lecture 1: Introduction. Monday, January 7, 10:00 10:50 am
ECS130 Scientific Computing Lecture 1: Introduction Monday, January 7, 10:00 10:50 am About Course: ECS130 Scientific Computing Professor: Zhaojun Bai Webpage: http://web.cs.ucdavis.edu/~bai/ecs130/ Today
More informationOrthogonal & Magic Cayley-Sudoku Tables
Orthogonal & Magic Cayley-Sudoku Tables Michael Ward & Rosanna Mersereau 13 Western Oregon University XXXII Ohio State-Denison Mathematics Conference May 2014 1 / 72 Speaker s Qualifications Cayley-Sudoku
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 informationMATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis
MATH HL OPTION - REVISION SETS, RELATIONS AND GROUPS Compiled by: Christos Nikolaidis PART B: GROUPS GROUPS 1. ab The binary operation a * b is defined by a * b = a+ b +. (a) Prove that * is associative.
More informationTHE SYLOW THEOREMS AND THEIR APPLICATIONS
THE SYLOW THEOREMS AND THEIR APPLICATIONS AMIN IDELHAJ Abstract. This paper begins with an introduction into the concept of group actions, along with the associated notions of orbits and stabilizers, culminating
More informationREPRESENTATIONS AND CHARACTERS OF FINITE GROUPS
SUMMER PROJECT REPRESENTATIONS AND CHARACTERS OF FINITE GROUPS September 29, 2017 Miriam Norris School of Mathematics Contents 0.1 Introduction........................................ 2 0.2 Representations
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 informationCombining Association Schemes
Chapter 4 Combining Association Schemes 4.1 Tensor products In this chapter we take an association scheme on Ω 1 and an association scheme on Ω, and combine them to obtain an association scheme on Ω 1
More informationOn the Splitting of MO(2) over the Steenrod Algebra. Maurice Shih
On the Splitting of MO(2) over the Steenrod Algebra Maurice Shih under the direction of John Ullman Massachusetts Institute of Technology Research Science Institute On the Splitting of MO(2) over the Steenrod
More informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationProblem 1A. Use residues to compute. dx x
Problem 1A. A non-empty metric space X is said to be connected if it is not the union of two non-empty disjoint open subsets, and is said to be path-connected if for every two points a, b there is a continuous
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 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 informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More 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 informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationGroups. Chapter 1. If ab = ba for all a, b G we call the group commutative.
Chapter 1 Groups A group G is a set of objects { a, b, c, } (not necessarily countable) together with a binary operation which associates with any ordered pair of elements a, b in G a third element ab
More informationCombinatorial semigroups and induced/deduced operators
Combinatorial semigroups and induced/deduced operators G. Stacey Staples Department of Mathematics and Statistics Southern Illinois University Edwardsville Modified Hypercubes Particular groups & semigroups
More informationLatin Squares with No Small Odd Plexes
Latin Squares with No Small Odd Plexes Judith Egan, Ian M. Wanless School of Mathematical Sciences, Monash University, Victoria 3800, Australia, E-mail: judith.egan@sci.monash.edu.au; ian.wanless@sci.monash.edu.au
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
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 informationRING ELEMENTS AS SUMS OF UNITS
1 RING ELEMENTS AS SUMS OF UNITS CHARLES LANSKI AND ATTILA MARÓTI Abstract. In an Artinian ring R every element of R can be expressed as the sum of two units if and only if R/J(R) does not contain a summand
More informationThe Cayley-Hamilton Theorem and the Jordan Decomposition
LECTURE 19 The Cayley-Hamilton Theorem and the Jordan Decomposition Let me begin by summarizing the main results of the last lecture Suppose T is a endomorphism of a vector space V Then T has a minimal
More informationInjective semigroup-algebras
Injective semigroup-algebras J. J. Green June 5, 2002 Abstract Semigroups S for which the Banach algebra l (S) is injective are investigated and an application to the work of O. Yu. Aristov is described.
More informationClassical simulations of non-abelian quantum Fourier transforms
Classical simulations of non-abelian quantum Fourier transforms Diploma Thesis Juan Bermejo Vega December 7, 2011 Garching First reviewer: Prof. Dr. J. Ignacio Cirac Second reviewer: Prof. Dr. Alejandro
More informationHomework #7 Solutions
Homework #7 Solutions p 132, #4 Since U(8) = {1, 3, 5, 7} and 3 2 mod 8 = 5 2 mod 8 = 7 2 mod 8, every nonidentity element of U(8) has order 2. However, 3 U(10) we have 3 2 mod 10 = 9 3 3 mod 10 = 7 3
More informationMath Exam 1 Solutions October 12, 2010
Math 415.5 Exam 1 Solutions October 1, 1 As can easily be expected, the solutions provided below are not the only ways to solve these problems, and other solutions may be completely valid. If you have
More informationGroup Determinants and k-characters
Group Determinants and k-characters Andy Hammerlindl December 12, 2005 1 Representations as Modules In class, we viewed representations as homomorphisms G GL(V ), but there is another way to regard representations,
More informationCurtis Heberle MTH 189 Final Paper 12/14/2010. Algebraic Groups
Algebraic Groups Curtis Heberle MTH 189 Final Paper 12/14/2010 The primary objects of study in algebraic geometry are varieties. Having become acquainted with these objects, it is interesting to consider
More informationGroups and Representations
Groups and Representations Madeleine Whybrow Imperial College London These notes are based on the course Groups and Representations taught by Prof. A.A. Ivanov at Imperial College London during the Autumn
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
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 informationReal symmetric matrices/1. 1 Eigenvalues and eigenvectors
Real symmetric matrices 1 Eigenvalues and eigenvectors We use the convention that vectors are row vectors and matrices act on the right. Let A be a square matrix with entries in a field F; suppose that
More informationAutoparatopisms of Latin Squares
Autoparatopisms of Latin Squares by Mahamendige Jayama Lalani Mendis, BSc(Special), MSc. M.Phil Thesis Submitted by Mahamendige Jayama Lalani Mendis for fulfilment of the Requirements for the Degree of
More informationA method for construction of Lie group invariants
arxiv:1206.4395v1 [math.rt] 20 Jun 2012 A method for construction of Lie group invariants Yu. Palii Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Russia and Institute
More informationECEN 5682 Theory and Practice of Error Control Codes
ECEN 5682 Theory and Practice of Error Control Codes Introduction to Algebra University of Colorado Spring 2007 Motivation and For convolutional codes it was convenient to express the datawords and the
More informationJanuary 2016 Qualifying Examination
January 2016 Qualifying Examination If you have any difficulty with the wording of the following problems please contact the supervisor immediately. All persons responsible for these problems, in principle,
More informationSelf-distributive quasigroups and quandles II
Self-distributive quasigroups and quandles II David Stanovský Charles University, Prague, Czech Republic Kazakh-British Technical University, Almaty, Kazakhstan stanovsk@karlin.mff.cuni.cz June 2015 David
More informationDichotomy Theorems for Counting Problems. Jin-Yi Cai University of Wisconsin, Madison. Xi Chen Columbia University. Pinyan Lu Microsoft Research Asia
Dichotomy Theorems for Counting Problems Jin-Yi Cai University of Wisconsin, Madison Xi Chen Columbia University Pinyan Lu Microsoft Research Asia 1 Counting Problems Valiant defined the class #P, and
More informationNOTES ON POLYNOMIAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
NOTES ON POLYNOMIAL REPRESENTATIONS OF GENERAL LINEAR GROUPS MARK WILDON Contents 1. Definition of polynomial representations 1 2. Weight spaces 3 3. Definition of the Schur functor 7 4. Appendix: some
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
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 7 Cyclic groups and subgroups
Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Mednykh A. D. (Sobolev Institute of Math) Laplacian for Graphs 27 June - 03 July 2015 1 / 30 Laplacians of Graphs, Spectra and Laplacian polynomials Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk
More informationCover Page. The handle holds various files of this Leiden University dissertation.
Cover Page The handle http://hdl.handle.net/1887/22043 holds various files of this Leiden University dissertation. Author: Anni, Samuele Title: Images of Galois representations Issue Date: 2013-10-24 Chapter
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 informationFrom alternating sign matrices to Painlevé VI
From alternating sign matrices to Painlevé VI Hjalmar Rosengren Chalmers University of Technology and University of Gothenburg Nagoya, July 31, 2012 Hjalmar Rosengren (Chalmers University) Nagoya, July
More information