F. Hivert, J.D. Mitchell, F.L. Smith , W.A. Wilson
{"title":"Minimal generating sets for matrix monoids","authors":"F. Hivert, J.D. Mitchell, F.L. Smith , W.A. Wilson","doi":"10.1016/j.jsc.2024.102415","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we determine minimal generating sets for several well-known monoids of matrices over certain semirings. In particular, we find minimal generating sets for the monoids consisting of: all <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> boolean matrices when <span><math><mi>n</mi><mo>≤</mo><mn>8</mn></math></span>; the <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> boolean matrices containing the identity matrix (the <em>reflexive</em> boolean matrices) when <span><math><mi>n</mi><mo>≤</mo><mn>7</mn></math></span>; the <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> boolean matrices containing a permutation (the <em>Hall</em> matrices) when <span><math><mi>n</mi><mo>≤</mo><mn>8</mn></math></span>; the upper, and lower, triangular boolean matrices of every dimension; the <span><math><mn>2</mn><mo>×</mo><mn>2</mn></math></span> matrices over the semiring <span><math><mi>N</mi><mo>∪</mo><mo>{</mo><mo>−</mo><mo>∞</mo><mo>}</mo></math></span> with addition ⊕ defined by <span><math><mi>x</mi><mo>⊕</mo><mi>y</mi><mo>=</mo><mi>max</mi><mo></mo><mo>(</mo><mi>x</mi><mo>,</mo><mi>y</mi><mo>)</mo></math></span> and multiplication ⊗ given by <span><math><mi>x</mi><mo>⊗</mo><mi>y</mi><mo>=</mo><mi>x</mi><mo>+</mo><mi>y</mi></math></span> (the <em>max-plus</em> semiring); the <span><math><mn>2</mn><mo>×</mo><mn>2</mn></math></span> matrices over any quotient of the max-plus semiring by the congruence generated by <span><math><mi>t</mi><mo>=</mo><mi>t</mi><mo>+</mo><mn>1</mn></math></span> where <span><math><mi>t</mi><mo>∈</mo><mi>N</mi></math></span>; the <span><math><mn>2</mn><mo>×</mo><mn>2</mn></math></span> matrices over the min-plus semiring and its finite quotients by the congruences generated by <span><math><mi>t</mi><mo>=</mo><mi>t</mi><mo>+</mo><mn>1</mn></math></span> for all <span><math><mi>t</mi><mo>∈</mo><mi>N</mi></math></span>; and the <span><math><mi>n</mi><mo>×</mo><mi>n</mi></math></span> matrices over <span><math><mi>Z</mi><mo>/</mo><mi>n</mi><mi>Z</mi></math></span> relative to their group of units.</div></div>","PeriodicalId":50031,"journal":{"name":"Journal of Symbolic Computation","volume":"129 ","pages":"Article 102415"},"PeriodicalIF":0.6000,"publicationDate":"2024-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Symbolic Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0747717124001196","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we determine minimal generating sets for several well-known monoids of matrices over certain semirings. In particular, we find minimal generating sets for the monoids consisting of: all boolean matrices when ; the boolean matrices containing the identity matrix (the reflexive boolean matrices) when ; the boolean matrices containing a permutation (the Hall matrices) when ; the upper, and lower, triangular boolean matrices of every dimension; the matrices over the semiring with addition ⊕ defined by and multiplication ⊗ given by (the max-plus semiring); the matrices over any quotient of the max-plus semiring by the congruence generated by where ; the matrices over the min-plus semiring and its finite quotients by the congruences generated by for all ; and the matrices over relative to their group of units.
期刊介绍:
An international journal, the Journal of Symbolic Computation, founded by Bruno Buchberger in 1985, is directed to mathematicians and computer scientists who have a particular interest in symbolic computation. The journal provides a forum for research in the algorithmic treatment of all types of symbolic objects: objects in formal languages (terms, formulas, programs); algebraic objects (elements in basic number domains, polynomials, residue classes, etc.); and geometrical objects.
It is the explicit goal of the journal to promote the integration of symbolic computation by establishing one common avenue of communication for researchers working in the different subareas. It is also important that the algorithmic achievements of these areas should be made available to the human problem-solver in integrated software systems for symbolic computation. To help this integration, the journal publishes invited tutorial surveys as well as Applications Letters and System Descriptions.