The generalized Gassert-Shor formula as combinatorial Stokes theorem
Gennadiy Ilyuta
TL;DR
This paper extends the Gassert-Shor formula to a broader class of numerical semigroups, providing a more general combinatorial framework.
Contribution
The authors generalize the Gassert-Shor formula, introducing a new combinatorial approach to numerical semigroups.
Findings
Generalized Gassert-Shor formula for numerical semigroups
New combinatorial methods for semigroup analysis
Potential applications in algebraic combinatorics
Abstract
We generalize Gassert-Shor formula for numerical semigroups.
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
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Advanced Algebra and Logic