Numerical semigroups from rational matrices II: matricial dimension does not exceed multiplicity
Arsh Chhabra, Stephan Ramon Garcia, Christopher O'Neill

TL;DR
This paper proves that the matricial dimension of a numerical semigroup is at most its multiplicity, providing a tight bound for many cases including symmetric numerical semigroups, advancing understanding of their algebraic structure.
Contribution
It establishes a new upper bound on the matricial dimension of numerical semigroups, improving previous bounds and characterizing cases where the bound is tight.
Findings
Matricial dimension is at most the multiplicity of the semigroup.
The bound is tight for many numerical semigroups, including all symmetric ones.
The result significantly refines the understanding of the structure of numerical semigroups.
Abstract
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound (the conductor). For many numerical semigroups, including all symmetric numerical semigroups, our upper bound is tight.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Polynomial and algebraic computation · Commutative Algebra and Its Applications
