{"title":"$${\\textsf{E}}_{6}$$和$$}\\textsf{E}}_","authors":"Robert G. Donnelly, Molly W. Dunkum, Austin White","doi":"10.1007/s00200-023-00603-9","DOIUrl":null,"url":null,"abstract":"<div><p>We construct every finite-dimensional irreducible representation of the simple Lie algebra of type <span>\\({\\textsf {E}}_{7}\\)</span> whose highest weight is a nonnegative integer multiple of the dominant minuscule weight associated with the type <span>\\({\\textsf {E}}_{7}\\)</span> root system. As a consequence, we obtain constructions of each finite-dimensional irreducible representation of the simple Lie algebra of type <span>\\({\\textsf {E}}_{6}\\)</span> whose highest weight is a nonnegative integer linear combination of the two dominant minuscule <span>\\({\\textsf {E}}_{6}\\)</span>-weights. Our constructions are explicit in the sense that, if the representing space is <i>d</i>-dimensional, then a weight basis is provided such that all entries of the <span>\\(d \\times d\\)</span> representing matrices of the Chevalley generators are obtained via explicit, non-recursive formulas. To effect this work, we introduce what we call <span>\\({\\textsf {E}}_{6}\\)</span>- and <span>\\({\\textsf {E}}_{7}\\)</span>-polyminuscule lattices that analogize certain lattices associated with the famous special linear Lie algebra representation constructions obtained by Gelfand and Tsetlin.</p></div>","PeriodicalId":50742,"journal":{"name":"Applicable Algebra in Engineering Communication and Computing","volume":"36 3","pages":"387 - 413"},"PeriodicalIF":0.6000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Explicit constructions of some infinite families of finite-dimensional irreducible representations of the type \\\\({\\\\textsf {E}}_{6}\\\\) and \\\\({\\\\textsf {E}}_{7}\\\\) simple Lie algebras\",\"authors\":\"Robert G. Donnelly, Molly W. Dunkum, Austin White\",\"doi\":\"10.1007/s00200-023-00603-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We construct every finite-dimensional irreducible representation of the simple Lie algebra of type <span>\\\\({\\\\textsf {E}}_{7}\\\\)</span> whose highest weight is a nonnegative integer multiple of the dominant minuscule weight associated with the type <span>\\\\({\\\\textsf {E}}_{7}\\\\)</span> root system. As a consequence, we obtain constructions of each finite-dimensional irreducible representation of the simple Lie algebra of type <span>\\\\({\\\\textsf {E}}_{6}\\\\)</span> whose highest weight is a nonnegative integer linear combination of the two dominant minuscule <span>\\\\({\\\\textsf {E}}_{6}\\\\)</span>-weights. Our constructions are explicit in the sense that, if the representing space is <i>d</i>-dimensional, then a weight basis is provided such that all entries of the <span>\\\\(d \\\\times d\\\\)</span> representing matrices of the Chevalley generators are obtained via explicit, non-recursive formulas. To effect this work, we introduce what we call <span>\\\\({\\\\textsf {E}}_{6}\\\\)</span>- and <span>\\\\({\\\\textsf {E}}_{7}\\\\)</span>-polyminuscule lattices that analogize certain lattices associated with the famous special linear Lie algebra representation constructions obtained by Gelfand and Tsetlin.</p></div>\",\"PeriodicalId\":50742,\"journal\":{\"name\":\"Applicable Algebra in Engineering Communication and Computing\",\"volume\":\"36 3\",\"pages\":\"387 - 413\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2023-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applicable Algebra in Engineering Communication and Computing\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00200-023-00603-9\",\"RegionNum\":4,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applicable Algebra in Engineering Communication and Computing","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s00200-023-00603-9","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
Explicit constructions of some infinite families of finite-dimensional irreducible representations of the type \({\textsf {E}}_{6}\) and \({\textsf {E}}_{7}\) simple Lie algebras
We construct every finite-dimensional irreducible representation of the simple Lie algebra of type \({\textsf {E}}_{7}\) whose highest weight is a nonnegative integer multiple of the dominant minuscule weight associated with the type \({\textsf {E}}_{7}\) root system. As a consequence, we obtain constructions of each finite-dimensional irreducible representation of the simple Lie algebra of type \({\textsf {E}}_{6}\) whose highest weight is a nonnegative integer linear combination of the two dominant minuscule \({\textsf {E}}_{6}\)-weights. Our constructions are explicit in the sense that, if the representing space is d-dimensional, then a weight basis is provided such that all entries of the \(d \times d\) representing matrices of the Chevalley generators are obtained via explicit, non-recursive formulas. To effect this work, we introduce what we call \({\textsf {E}}_{6}\)- and \({\textsf {E}}_{7}\)-polyminuscule lattices that analogize certain lattices associated with the famous special linear Lie algebra representation constructions obtained by Gelfand and Tsetlin.
期刊介绍:
Algebra is a common language for many scientific domains. In developing this language mathematicians prove theorems and design methods which demonstrate the applicability of algebra. Using this language scientists in many fields find algebra indispensable to create methods, techniques and tools to solve their specific problems.
Applicable Algebra in Engineering, Communication and Computing will publish mathematically rigorous, original research papers reporting on algebraic methods and techniques relevant to all domains concerned with computers, intelligent systems and communications. Its scope includes, but is not limited to, vision, robotics, system design, fault tolerance and dependability of systems, VLSI technology, signal processing, signal theory, coding, error control techniques, cryptography, protocol specification, networks, software engineering, arithmetics, algorithms, complexity, computer algebra, programming languages, logic and functional programming, algebraic specification, term rewriting systems, theorem proving, graphics, modeling, knowledge engineering, expert systems, and artificial intelligence methodology.
Purely theoretical papers will not primarily be sought, but papers dealing with problems in such domains as commutative or non-commutative algebra, group theory, field theory, or real algebraic geometry, which are of interest for applications in the above mentioned fields are relevant for this journal.
On the practical side, technology and know-how transfer papers from engineering which either stimulate or illustrate research in applicable algebra are within the scope of the journal.