arXiv · 2510.13612
On some affine semigroups characterized by a finite-state automata
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.
Explore related subjects
Keep this discovery
J. I. Farrán, J. C. Rosales, R. Tapia-Ramos, A. Vigneron-Tenorio. 2025-10-15. On some affine semigroups characterized by a finite-state automata. https://arxiv.org/abs/2510.13612
Cite the original work for its findings. Save a collection to share your selection of sources.