On Frobenius numbers for Symmetric (not Complete Intersection) Semigroups Generated by Four Elements
Leonid G. Fel
TL;DR
This paper establishes a lower bound for the Frobenius number in symmetric semigroups generated by four elements, expanding understanding beyond complete intersection cases.
Contribution
It introduces a new lower bound specifically for symmetric, non-complete intersection semigroups generated by four elements.
Findings
Derived a lower bound for Frobenius numbers in the specified semigroups
Extended known results to a broader class of semigroups
Provides a foundation for further research on Frobenius numbers
Abstract
We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.
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
TopicsCommutative Algebra and Its Applications · Graph theory and applications · Advanced Combinatorial Mathematics