Let be a semigroup, any is an ideal of if , and an -semigroup is the affine semigroup , with an ideal of . We characterise the -semigroups and the ones that also are -semigroups. Moreover, some algorithms are provided to compute all the -semigroups satisfying some properties. From a family of ideals of , we introduce the affine semigroups with maximal embedding dimension, characterising them and describing some families.
Let $$\mathcal {C}\subseteq \mathbb {N}^p$$ be an integer cone. A $$\mathcal {C}$$ -semigroup $$S\subseteq \mathcal {C}$$ is an affine semigroup such that the set $$\mathcal {C}{\setminus }S$$ is finite. Such $$\mathcal {C}$$ -semigroups are central to our study. We develop new algorithms for computing $$\mathcal {C}$$ -semigroups with specified invariants, including genus, Frobenius element, and their combinations, among other invariants. To achieve this, we introduce a new class of $$\mathcal {C}$$ -semigroups, termed $$\mathcal {B}$$ -semigroups. By fixing the degree lexicographic order, we also research the embedding dimension for both ordinary and mult-embedded $$\mathbb {N}^2$$ -semigroups. These results are applied to test some generalizations of Wilf’s conjecture.
This work delves into the quotient of an affine semigroup by a positive integer, exploring its intricate properties and broader implications. We unveil an associated tree that serves as a valuable tool for further analysis. Moreover, we successfully generalize several key irreducibility results, extending their applicability to the more general class of $$\mathcal {C}$$ -semigroup quotients. To shed light on these concepts, we introduce the novel notion of an arithmetic variety of affine semigroups, accompanied by illuminating examples that showcase its power.
Let be an integer polyhedral cone. An affine semigroup is a -semigroup if . This structure has always been studied using a monomial order. The main issue is that the choice of these orders is arbitrary. In the present work, we choose the order given by the semigroup itself, which is a more natural order. This allows us to generalise some of the definitions and results known from numerical semigroup theory to -semigroups.
Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the ones that also are $\mathcal C$-semigroups. Moreover, some algorithms are provided to compute all the $I(S)$-semigroups satisfying some properties. From a family of ideals of $S$, we introduce the affine semigroups with maximal embedding dimension, characterising them and describing some families.
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.