2025/10/15 by Farrán, J. I., Rosales, J. C., Tapia-Ramos, R. +1
#05C05 #20M14 #20M35 #Combinatorics (math.CO) #Commutative Algebra (math.AC) #FOS: Mathematics
paper · doi:10.48550/arxiv.2510.13612
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.