On Frobenius numbers for Symmetric (not Complete Intersection)\n Semigroups Generated by Four Elements

2015/06/13 by Leonid G. Fel, Fel, Leonid G.
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Graph theory and applications #Primary -- 20M14 #Secondary -- 11P81 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1506.04337

openalex publication_date 2015/06/13 · openalex created_date 2022/10/01 · openalex updated_date 2026/07/28

Abstract

We derive the lower bound for Frobenius number of symmetric (not complete\nintersection) semigroups generated by four elements.\n

Related

• Symmetric (not Complete Intersection) Semigroups Generated by Five Elements
• Symmetric (not Complete Intersection) Numerical Semigroups Generated by Six Elements
• On Numerical Experiments with Symmetric Semigroups Generated by Three Elements and Their Generalization
• The Frobenius problem for four numerical semigroups
• Almost symmetric numerical semigroups with odd generators