DOCSLIB.ORG

Modular Invariant Theory of Graded Lie Algebras

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Modular Invariant Theory of Graded Lie Algebras MODULAR INVARIANT THEORY OF GRADED LIE ALGEBRAS A dissertation submitted to the University of Manchester for the degree of Doctor of Philosophy in the Faculty of Science and Engineering 2019 Floriana Amicone School of Mathematics Contents Abstract 4 Declaration 5 Copyright Statement 6 Acknowledgements 7 1 Introduction 8 1.1 Classification of balanced toral elements . 9 1.2 Modular invariants of graded Lie algebras . 12 1.3 Notation . 17 2 Preliminaries 19 2.1 General setting . 19 2.2 Induced nilpotent orbits and sheets . 21 2.3 Kac coodinates and finite order automorphisms of simple Lie algebras . 27 2.4 Elements of Geometric Invariant Theory . 32 2.5 The Kempf-Rousseau theory . 34 2.6 The cone associated with a variety . 36 2.7 Structure of classical Lie algebras . 36 3 Classification of balanced toral elements 43 3.1 Preliminary discussion and outline of method . 43 3.2 The Tables . 49 3.3 Conjugacy of balanced toral elements up to scalar multiples . 53 3.4 Summary of results . 57 2 3.5 Alternative computational methods . 58 4 Modular invariants: structure of orbits and p-cyclic subspaces 63 4.1 Preliminaries . 63 4.2 Regular elements . 66 4.3 p-cyclic subspaces . 73 4.4 Closed orbits . 76 5 Modular invariants: the little Weyl group and the invariant ring 83 5.1 An isomorphism of rings of invariants . 83 5.2 The little Weyl group . 87 5.3 Polynomiality of the ring of invariants . 96 6 Consequences of polynomiality 100 6.1 Flatness of the quotient morphism . 100 6.2 Sections for the action of G(0) on g(1) . 102 A Example of code (type F4) 120 Bibliography 126 Word count 36599 3 The University of Manchester Floriana Amicone Doctor of Philosophy Modular Invariant Theory of Graded Lie Algebras August 3, 2019 Let G be a connected reductive algebraic group with Lie algebra g, defined over an algebraically closed field k of positive characteristic p > 0. The group G acts on g via the adjoint action. Two distinct problems are considered in this thesis. To begin with, assume that g is a Lie algebra of exceptional type. We present a complete classification of the G-conjugacy classes of balanced toral elements of g. As a result, we also obtain the classification of conjugacy classes of balanced inner torsion automorphisms of g of order p when char k = 0. Secondly, we look at the invariant theory of periodically graded Lie algebras. As- sume the group G satisfies the standard hypothesis, and let the Lie algebra g admit an Fp-grading g = ⊕i2Fp g(i) given by the adjoint action of a toral element h 2 g, in ◦ other words g(i) = fx 2 g j [h; x] = ixg for each i 2 Fp. Denote by G(0) = CG(h) the connected centralizer of h in G; the group G(0) acts on each subspace g(i). We prove that for i 6= 0 the ring of invariant functions k[g(i)]G(0) ⊆ k[g(i)] is a polyno- mial ring generated by s homogeneous polynomials, where sp is the dimension of a p-cyclic subspace. We show moreover that the quotient morphism g(i) ! g(i)==G(0) induced by the inclusion k[g(i)]G(0) ,! k[g(i)] is a flat morphism, that k[g(i)] is a free k[g(i)]G(0)-module and that there exists a Kostant-Weierstrass section for the action of G(0) on g(i). 4 Declaration No portion of the work referred to in the dissertation has been submitted in support of an application for another degree or qualification of this or any other university or other institute of learning. 5 Copyright Statement i. The author of this dissertation (including any appendices and/or schedules to this dissertation) owns certain copyright or related rights in it (the “Copyright”) and s/he has given The University of Manchester certain rights to use such Copyright, including for administrative purposes. ii. Copies of this dissertation, either in full or in extracts and whether in hard or elec- tronic copy, may be made only in accordance with the Copyright, Designs and Patents Act 1988 (as amended) and regulations issued under it or, where appropri- ate, in accordance with licensing agreements which the University has from time to time. This page must form part of any such copies made. iii. The ownership of certain Copyright, patents, designs, trade marks and other in- tellectual property (the “Intellectual Property”) and any reproductions of copyright works in the dissertation, for example graphs and tables (“Reproductions”), which may be described in this dissertation, may not be owned by the author and may be owned by third parties. Such Intellectual Property and Reproductions cannot and must not be made available for use without the prior written permission of the owner(s) of the relevant Intellectual Property and/or Reproductions. iv. Further information on the conditions under which disclosure, publication and com- mercialisation of this dissertation, the Copyright and any Intellectual Property and/or Reproductions described in it may take place is available in the University IP Policy (see http://documents.manchester.ac.uk/DocuInfo.aspx?DocID=487), in any relevant Thesis restriction declarations deposited in the University Library, The University Library’s regulations (see http://www.manchester.ac.uk/library/ab- outus/regulations) and in The University’s Policy on Presentation of Theses. 6 Acknowledgements First and foremost, I would like to thank my supervisor Alexander Premet for the guidance and advice I received over the years that lead to writing this thesis. I have greatly benefited from our meetings and conversations, and the results in this work would never have been obtained without his mastery of the subject. I am really grateful to Paul Levy for taking interest in my work and giving precious suggestions on a preliminary version. Thanks also to James Montaldi for raising a question that lead to the results in Section 6.1. I would like to thank my family for standing by me under any circumstances, and for being always supportive whenever I need them. Finally, thanks to Dominic for brightening my years in Manchester, and for being always present and encouraging, especially during the darkest times. 7 Chapter 1 Introduction The present work has the purpose of outlining our approach to two distinct problems arising in the theory of modular algebraic groups and Lie algebras. We shall assume that the reader is familiar with the general theory on these topics, we refer in particular to expositions such as [Bo], [Hu1] and [Sp1]. This introduction provides a summary of the strategies applied and the results obtained, along with some literature review. Yet, it is by no means self-contained or exhaustive: more rigorous definitions, terminology and arguments will be given in subsequent chapters. 1.0.1 Let G be a reductive algebraic group, g its Lie algebra, and assume they are defined over an algebraically closed field k of positive characteristic p > 0. We shall be interested in the case where g admits a periodic grading given by a toral element, as described hereafter. For all x 2 g the derivation (ad x)p is an inner endomorphism of g that coincides with ad x[p] for a certain x[p] 2 g. The Lie algebra g is canonically endowed with a G-equivariant p-semilinear p-th power map (see [Bo, I.3], for example): x 2 g 7−! x[p] 2 g: Definition 1.0.1. An element h 2 g is said to be toral if it satisfies h[p] = h. A toral element is semisimple and acts on g with eigenvalues belonging to the finite p field Fp ⊆ k, since the minimal polynomial of ad h divides the polynomial X − X. 8 1.1. CLASSIFICATION OF BALANCED TORAL ELEMENTS 9 We will call g(i) = fx 2 g j [h; x] = ixg the eigenspace relative to the eigenvalue i 2 Fp. A toral element h is called balanced if the eigenspaces g(i) corresponding to nonzero eigenvalues are all of the same dimension. If in addition their dimension is divisible by a certain d 2 N, the element is called d-balanced (see Definition 3.0.1 for explicit notation). We stress that for a toral element h to be balanced we require that × dim g(i) 6= 0 for all i 2 Fp The first problem we consider, treated in Chapter 3, is the classification of G-conjugacy classes of balanced toral elements when the Lie algebra g is assumed to be of exceptional type. If h is a toral element of g, the vector space decomposition g = L g(i) is in i2Fp fact a Lie algebra grading. The subspace g(0) is a subalgebra, which moreover is the Lie algebra of the identity component of the centralizer CG(h) of h in G; we will call ◦ G(0) = CG(h) this connected closed subgroup. It acts on each graded subspace g(i), thus inducing an action of G(0) on the ring of polynomial functions, without loss of generality say on k[g(1)]. Chapters 4 and 5 are concerned with finding a description of the ring of invariant polynomials k[g(1)]G(0) ⊆ k[g(1)] for this action. Due to these two problems being unrelated in nature, we saw fit to divide this introduction into two parts dealing specifically with each of them. 1.1 Classification of balanced toral elements The question of classifying orbits of balanced toral elements stems from work of Premet ([Pr2]), where he gives a complete account of p-balanced toral elements of exceptional Lie algebras.
Load more

Recommended publications
  • Paper We Shall Assume That All Logs Are Base 2
    Maximally Recoverable Codes: the Bounded Case Venkata Gandikota ∗ Elena Grigorescu y Clayton Thomas z Minshen Zhu x Abstract Modern distributed storage systems employ Maximally Recoverable codes that aim to bal- ance failure recovery capabilities with encoding/decoding efficiency tradeoffs. Recent works of Gopalan et al [SODA 2017] and Kane et al [FOCS 2017] show that the alphabet size of grid-like topologies of practical interest must be large, a feature that hampers decoding efficiency. To bypass such shortcomings, in this work we initiate the study of a weaker version of recoverability, where instead of being able to correct all correctable erasure patterns (as is the case for maximal recoverability), we only require to correct all erasure patterns of bounded size. The study of this notion reduces to a variant of a combinatorial problem studied in the literature, which is interesting in its own right. We study the alphabet size of codes withstanding all erasure patterns of small (constant) size. We believe the questions we propose are relevant to both real storage systems and combinatorial analysis, and merit further study. 1 Introduction Modern distributed storage systems need to address the challenge of storing large amounts of data, with small overhead, while providing reliable recovery in the face of failures. Unlike in com- munication settings, if a failure occurs in a storage system, it is typically easy to detect where it occurs (e.g., rack or data center failure are obvious to the system). Hence, recent trends in practical systems adopt erasure coding schemes with fast encoding and decoding capabilities [BHH13, HSX+12, SLR+14].
    [Show full text]
  • The Transfer in Modular Invariant Theory1
    Journal of Pure and Applied Algebra 142 (1999) 63–77 www.elsevier.com/locate/jpaa The transfer in modular invariant theory1 R. James Shank a;∗, David L. Wehlau a;b aDepartment of Mathematics and Statistics, Queen’s University, Kingston, Ont., Canada K7L 3N6 bDepartment of Mathematics and Computer Science, Royal Military College, Kingston, Ont., Canada K7K 7B4 Communicated by A.V. Geramita; received 8 July 1997; received in revised form 29 November 1997 Abstract We study the transfer homomorphism in modular invariant theory paying particular attention to the image of the transfer which is a proper non-zero ideal in the ring of invariants. We prove that, for a p-group over Fp whose ring of invariants is a polynomial algebra, the image of the transfer is a principal ideal. We compute the image of the transfer for SLn(Fq) and GLn(Fq) showing that both ideals are principal. We prove that, for a permutation group, the image of the transfer is a radical ideal and for a cyclic permutation group the image of the transfer is a prime ideal. c 1999 Elsevier Science B.V. All rights reserved. MSC: 13A50 1. Introduction We let V be a vector space of dimension n over a ÿeld k and we choose a basis, ∗ {x1;:::;xn}, for the dual, V ,ofV . Consider a ÿnite subgroup G of GL(V ). The action of G on V induces an action on V ∗ which extends to an action by algebra ∗ automorphisms on the symmetric algebra of V , k[V ]=k[x1;:::;xn]. Speciÿcally, for g ∈ G; f ∈ k[V ] and v ∈ V ,(g·f)(v)=f(g−1 ·v).
    [Show full text]
  • Hermitian, Symmetric and Symplectic Random Ensembles
    Annals of Mathematics, 153 (2001), 149–189 Hermitian, symmetric and symplectic random ensembles: PDEs for the distribution of the spectrum By M. Adler and P. van Moerbeke* Abstract Given the Hermitian, symmetric and symplectic ensembles, it is shown that the probability that the spectrum belongs to one or several intervals sat- isfies a nonlinear PDE. This is done for the three classical ensembles: Gaussian, Laguerre and Jacobi. For the Hermitian ensemble, the PDE (in the boundary points of the intervals) is related to the Toda lattice and the KP equation, whereas for the symmetric and symplectic ensembles the PDE is an inductive equation, related to the so-called Pfaff-KP equation and the Pfaff lattice. The method consists of inserting time-variables in the integral and showing that this integral satisfies integrable lattice equations and Virasoro constraints. Contents 0. Introduction 0.1. Hermitian, symmetric and symplectic Gaussian ensembles 0.2. Hermitian, symmetric and symplectic Laguerre ensembles 0.3. Hermitian, symmetric and symplectic Jacobi ensembles 0.4. ODEs, when E has one boundary point 1. Beta-integrals 1.1. Virasoro constraints for β-integrals 1.2. Proof: β-integrals as fixed points of vertex operators 1.3. Examples arXiv:math-ph/0009001v2 14 Aug 2001 2. Matrix integrals and associated integrable systems 2.1. Hermitian matrix integrals and the Toda lattice 2.2. Symmetric/symplectic matrix integrals and the Pfaff lattice 3. Expressing t-partials in terms of boundary-partials 3.1. Gaussian and Laguerre ensembles 3.2. Jacobi ensemble 3.3. Evaluating the matrix integrals on the full range ∗The support of a National Science Foundation grant #DMS-98-4-50790 is gratefully acknowl- edged.
    [Show full text]
  • On Decoding Additive Generalized Twisted Gabidulin Codes
    Cryptography and Communications (2020) 12:987–1009 https://doi.org/10.1007/s12095-020-00449-9 On decoding additive generalized twisted Gabidulin codes Wrya K. Kadir1 · Chunlei Li1 Received: 20 September 2019 / Accepted: 30 June 2020 /Published online: 23 July 2020 © The Author(s) 2020 Abstract In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field Fqn for any prime power q. This paper extends the work of the con- ference paper Li and Kadir (2019) presented at the International Workshop on Coding and Cryptography 2019, which decoded these codes over finite fields in characteristic two. Keywords Rank metric · Maximum rank distance codes · Gabidulin codes · Twisted Gabidulin codes · Generalized twisted Gabidulin codes Mathematics Subject Classification (2010) 94B35 · 68P30 · 11T71 · 11T06 1 Introduction Error correction codes with the rank metric have found applications in space-time coding [27], random network coding [44] and cryptography [12]. Many important properties of rank metric codes including the Singleton like bound were independently studied by Del- sarte [9] , Gabidulin [13] and Roth [38]. Codes that achieve this bound were called maximum rank distance (MRD) codes. The most famous sub-family of MRD codes are Gabidulin codes which is the rank metric analog of Reed-Solomon codes. They have been extensively studied in the literature [9, 12, 13, 25, 36, 38]. Finding new families of MRD codes has been an interesting research topic since the invention of Gabidulin codes. In [20, 39], the Frobenious automorphism in the Gabidulin codes were generalized to arbitrary automorphism and generalized Gabidulin (GG) codes Chunlei Li [email protected] Wrya K.
    [Show full text]
  • The Geometry of Rank Decompositions of Matrix Multiplication Ii: 3 3 Matrices
    THE GEOMETRY OF RANK DECOMPOSITIONS OF MATRIX MULTIPLICATION II: 3 3 MATRICES × GREY BALLARD, CHRISTIAN IKENMEYER, J.M. LANDSBERG, AND NICK RYDER Abstract. This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank 23 decompositions for the 3×3 matrix multiplication tensor M⟨3⟩. All our decompositions have symmetry groups that include the standard cyclic permutation of factors but otherwise exhibit a range of behavior. One of them has 11 cubes as summands and admits an unexpected symmetry group of order 12. We establish basic information regarding symmetry groups of decompositions and outline two approaches for finding new rank decompositions of M⟨n⟩ for larger n. 1. Introduction This is the second in a planned series of papers on the geometry of rank decompositions n2 n2 n2 of the matrix multiplication tensor M n C C C . Our goal is to obtain new rank m m m decompositions of M n by exploiting symmetry. For a tensor T C C C , the rank of r ⟨ ⟩ m T is the smallest r such that T j 1 aj ∈bj cj⊗, with⊗ aj; bj; cj C . The rank of M n is a standard complexity measure⟨ ⟩ of matrix multiplication, in particular,∈ it governs⊗ ⊗ the total number of arithmetic operations needed to= multiply∑ = ⊗ two⊗ matrices. ∈ ⟨ ⟩ In this paper we present rank 23 decompositions of M 3 that have large symmetry groups, in particular all admit the standard cyclic Z3-symmetry of permuting the three tensor factors. ⟨ ⟩ Although many rank 23 decompositions of M 3 are known [15, 13], none of them was known to admit the standard cyclic Z3-symmetry.
    [Show full text]
  • Birds and Frogs Equation
    Notices of the American Mathematical Society ISSN 0002-9920 ABCD springer.com New and Noteworthy from Springer Quadratic Diophantine Multiscale Principles of Equations Finite Harmonic of the American Mathematical Society T. Andreescu, University of Texas at Element Analysis February 2009 Volume 56, Number 2 Dallas, Richardson, TX, USA; D. Andrica, Methods A. Deitmar, University Cluj-Napoca, Romania Theory and University of This text treats the classical theory of Applications Tübingen, quadratic diophantine equations and Germany; guides readers through the last two Y. Efendiev, Texas S. Echterhoff, decades of computational techniques A & M University, University of and progress in the area. The presenta- College Station, Texas, USA; T. Y. Hou, Münster, Germany California Institute of Technology, tion features two basic methods to This gently-paced book includes a full Pasadena, CA, USA investigate and motivate the study of proof of Pontryagin Duality and the quadratic diophantine equations: the This text on the main concepts and Plancherel Theorem. The authors theories of continued fractions and recent advances in multiscale finite emphasize Banach algebras as the quadratic fields. It also discusses Pell’s element methods is written for a broad cleanest way to get many fundamental Birds and Frogs equation. audience. Each chapter contains a results in harmonic analysis. simple introduction, a description of page 212 2009. Approx. 250 p. 20 illus. (Springer proposed methods, and numerical 2009. Approx. 345 p. (Universitext) Monographs in Mathematics) Softcover examples of those methods. Softcover ISBN 978-0-387-35156-8 ISBN 978-0-387-85468-7 $49.95 approx. $59.95 2009. X, 234 p. (Surveys and Tutorials in The Strong Free Will the Applied Mathematical Sciences) Solving Softcover Theorem Introduction to Siegel the Pell Modular Forms and ISBN: 978-0-387-09495-3 $44.95 Equation page 226 Dirichlet Series Intro- M.
    [Show full text]
  • If You Have Passion and Focus You Can Accomplish Anything
    The UK’s European university UNIVERSITY OF KENT OPEN DAYS IN 2013/14 Postgraduate events Wed 27 November 2013 Sat 1 February 2014 General Open Days / Canterbury Medway GRADUATE PROSPECTUS Wed 18 September 2013 Sat 12 October 2013 Sat 5 October 2013 Sat 21 June 2014 Sat 12 July 2014 www.kent.ac.uk/opendays University of Kent, The Registry, Canterbury, Kent CT2 7NZ T: +44 (0)1227 764000 E: [email protected] / 2014 IF YOU HAVE PASSION AND FOCUS YOU CAN ACCOMPLISH ANYTHING Graduate 2014 Prospectus By rail The nearest train station to the AUR campus is Trastevere Station on the Pisa-Livorno-Rome, Rome- NOW IT GETS Capranica-Viterbo and Rome-Fiumicino lines. By bus and tram On leaving Trastevere station, take tram 8 towards Largo Argentina. Get off at Via E Morosini and INTERESTING catch bus 44 (in the direction of Montalcini) or bus 75 (in the direction of Poerio/Marino). The campus is located between two stops: Via Our postgraduate programmes are informed Dandolo/Calandrelli and Via Giacinto Carini; both by a commitment to research excellence. As a stops are less than 100 metres from the AUR campus. highly ranked UK university, Kent provides a Campus map dynamic and challenging academic environment. www.kent.ac.uk/maps/rome The University offers students a wide choice of well-structured and ambitious postgraduate programmes. At every stage, students are supported by inspirational teaching and supervision, first-class library and IT facilities and a diverse schedule of seminars, workshops and events. www.kent.ac.uk 1 2 University of Kent / Graduate Prospectus 2014 WELCOME FROM THE DEAN This is an exciting time to be a postgraduate student at the University of Kent.
    [Show full text]
  • MODULAR COVARIANTS of CYCLIC GROUPS of ORDER P 11
    MODULAR COVARIANTS OF CYCLIC GROUPS OF ORDER p JONATHAN ELMER Abstract. Let G be a cyclic group of order p and let V; W be |G-modules. G ∗ G We study the modules of covariants |[V ] (W ) = (S(V ) ⊗ W ) . For V indecomposable with dimension 2, and W an arbitrary indecomposable mod- G G ule, we show |[V ] (W ) is a free |[V ] -module (recovering a result of Broer G and Chuai [1]) and we give an explicit set of covariants generating |[V ] (W ) G freely over |[V ] . For V indecomposable with dimension 3 and W an arbi- G trary indecomposable module, we show that |[V ] (W ) is a Cohen-Macaulay G |[V ] -module (again recovering a result of Broer and Chuai) and we give an G explicit set of covariants which generate |[V ] (W ) freely over a homogeneous G set of parameters for |[V ] . 1. Introduction Let G be a group, | a field, and V and W |G-modules. Then G acts on the set of functions V ! W according to the formula g · φ(v) = gφ(g−1v) for all g 2 G and v 2 V . Classically, a covariant is a G-equivariant polynomial map V ! W . An invariant is the name given to a covariant V ! | where | denotes the trivial indecomposable |G-module. If the field | is infinite, then the set of polynomial maps V ! W can be identified with S(V ∗) ⊗ W , where the action on the tensor product is diagonal and the action on S(V ∗) is the natural extension of the action on V ∗ by algebra automorphisms.
    [Show full text]
  • Invariants of Gln(Fq) in Polynomials Modulo Frobenius Powers
    Proceedings of the Royal Society of Edinburgh, 147A, 831–873, 2017 DOI:10.1017/S0308210516000366 Invariants of GLn(Fq) in polynomials modulo Frobenius powers J. Lewis, V. Reiner and D. Stanton School of Mathematics, University of Minnesota, Minneapolis, MN 55455, USA ([email protected]; [email protected]; [email protected]) (MS received 15 May 2014; accepted 12 February 2016) Conjectures are given for Hilbert series related to polynomial invariants of finite general linear groups: one for invariants mod Frobenius powers of the irrelevant ideal and one for cofixed spaces of polynomials. Keywords: finite general linear group; Frobenius power; Dickson invariants; cofixed; divided power invariants; cyclic sieving 2010 Mathematics subject classification: Primary 13A50 1. Introduction This paper proposes two related conjectures in the invariant theory of GLn(Fq), motivated by the following celebrated result of Dickson [8] (see also [5, theo- rem 8.1.1] and [30, theorem 8.1.5]). Theorem 1.1 (Dickson [8]). When G := GLn(Fq) acts via invertible linear substi- tutions of variables on the polynomial algebra S = Fq[x1,...,xn], the G-invariants G form a polynomial subalgebra S = Fq[Dn,0,Dn,1,...,Dn,n 1]. − Here the Dickson polynomials Dn,i are the coefficients in the expansion n qi (t + ℓ(x)) = Dn,it , i=0 ℓ!(x) " where the product runs over all Fq-linear forms ℓ(x) in the variables x1,...,xn. In n i particular, Dn,i is homogeneous of degree q q , so that Dickson’s theorem implies the Hilbert series formula: − n 1 − 1 Hilb(SG,t) := dim (SG) td = .
    [Show full text]
  • Conformal Field Theory Techniques in Random Matrix Models
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by CERN Document Server . SPHT/t98/112 Conformal Field Theory Techniques in Random Matrix models Ivan K. Kostov ∗† C.E.A. - Saclay, Service de Physique Th´eorique F-91191 Gif-sur-Yvette, France In these notes we explain how the CFT description of random matrix models can be used to perform actual calculations. Our basic example is the hermitian matrix model, reformulated as a conformal invariant theory of free fermions. We give an explicit operator construction of the corre- sponding collective field theory in terms of a bosonic field on a hyperel- liptic Riemann surface, with special operators associated with the branch points. The quasiclassical expressions for the spectral kernel and the joint eigenvalue probabilities are then easily obtained as correlation functions of current, fermionic and twist operators. The result for the spectral kernel is valid both in macroscopic and microscopic scales. At the end we briefly consider generalizations in different directions. Based on the talk of the author at the Third Claude Itzykson- Meet- ing, ”Integrable Models and Applications to Statistical Mechanics ”, Paris, July 27-29, 1998, and at the workshop “Random matrices and integrable systems”, Univ. of Warwick, November 2-4 1998. July 1999 ∗ Member of CNRS † [email protected] 1. Introduction The random matrix models have various applications in rather different domains, and sometimes language barriers prevents the flow of ideas and knowledge from one field to another. For example, such powerful techniques as the conformal field theory (CFT) description of the random matrix models and their relation with the integrable hierarchies, which were developped extensively by the string theorists in the early 90’s, are practically unknown to the mesoscopic physicists.
    [Show full text]
  • Generalized Skew Reed-Solomon Codes and Other Applications of Skew Polynomial Evaluation
    Generalized Skew Reed-Solomon Codes and Other Applications of Skew Polynomial Evaluation by Siyu Liu A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Electrical and Computer Engineering University of Toronto © Copyright 2016 by Siyu Liu Abstract Generalized Skew Reed-Solomon Codes and Other Applications of Skew Polynomial Evaluation Siyu Liu Doctor of Philosophy Graduate Department of Electrical and Computer Engineering University of Toronto 2016 This thesis studies the theory of error-correcting codes based on evaluation of skew poly- nomials. Skew polynomials are a noncommutative generalization of ordinary polynomials that, in recent years, have found applications in coding theory and cryptography. The evaluation of skew polynomials is significantly different from that of ordinary polyno- mials. Using skew polynomial evaluation, we define a class of codes called Generalized Skew-Evaluation codes. This class contains a special subclass that we call Generalized Skew Reed-Solomon codes. Generalized Skew Reed-Solomon codes are intimately con- nected to both regular Reed-Solomon codes and Gabidulin codes. These connections allow us to design interesting codes for both the Hamming metric and the rank met- ric. In addition, we prove a duality theory that exists within a subclass of Generalized Skew Reed-Solomon codes. This duality theory can be viewed as an extension to the well-known duality theory of Generalized Reed-Solomon codes. The decoding of Gener- alized Skew Reed-Solomon codes can be done using a Berlekamp-Welch style decoder. We design such a decoder by studying the general polynomial interpolation problem for skew polynomials.
    [Show full text]
  • On the Q-Analogue of Cauchy Matrices Alessandro Neri
    I am a friend of Finite Geometry! On the q-Analogue of Cauchy Matrices Alessandro Neri 17-21 June 2019 - VUB Alessandro Neri 19 June 2019 1 / 19 On the q-Analogue of Cauchy Matrices Alessandro Neri I am a friend of Finite Geometry! 17-21 June 2019 - VUB Alessandro Neri 19 June 2019 1 / 19 q-Analogues Model Finite set Finite dim vector space over Fq Element 1-dim subspace ; f0g Cardinality Dimension Intersection Intersection Union Sum Alessandro Neri 19 June 2019 1 / 19 Examples 1. Binomials and q-binomials: k−1 k−1 n Y n − i n Y 1 − qn−i = ; = : k k − i k 1 − qk−i i=0 q i=0 2. (Chu)-Vandermonde and q-Vandermonde identity: k k m + n X m n m + n X m n = ; = qj(m−k+j): k j k − j k k − j j j=0 q j=0 q q 3. Polynomials and q-polynomials: k q qk a0 + a1x + ::: + ak x ; a0x + a1x + ::: + ak x : 4. Gamma and q-Gamma functions: 1 − qx Γ(z + 1) = zΓ(z); Γ (x + 1) = Γ (x): q 1 − q q Alessandro Neri 19 June 2019 2 / 19 For n = k, det(V ) 6= 0 if and only if the αi 's are all distinct. jfα1; : : : ; αngj = n: In particular, all the k × k minors of V are non-zero. Vandermonde Matrix Let k ≤ n. 0 1 1 ::: 1 1 B α1 α2 : : : αn C B C B α2 α2 : : : α2 C V = B 1 2 n C B .
    [Show full text]