On some affine semigroups characterized by a finite-state automata
Preprint
Abstract
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal C$-semigroup is a $P$-semigroup, which represents a bridge between affine semigroups and Discrete Mathematics. Furthermore, some algorithms for computing all the $P$-semigroups with a fixed Frobenius element, genus, or multiplicity are provided.Keywords
All Related Versions
This publication has 3 references indexed in Scilit:
- A computational Approach to the Study of Finite-Complement Submonids of an Affine ConeResults in Mathematics, 2025
- An extension of Wilf’s conjecture to affine semigroupsSemigroup Forum, 2017
- On Cohen-Macaulay subsemigroups of N2Communications in Algebra, 1998