Related papers: The multiples of a numerical semigroup
Let $t\ge 1$ be a given integer. Let ${\cal F}$ be a family of subsets of $[m]=\{1,2,\ldots,m\}$. Assume that for every pair of disjoint sets $S,T\subset [m]$ with $|S|=|T|=k$, there do not exist $2t$ sets in ${\cal F}$ where $t$ subsets of…
We consider numerical semigroups associated with normal weighted homogeneous surface singularities with rational homology sphere links. We say that a semigroup is representable if it can be realized in this way. In this article, we study…
For a numerical semigroup S $\subseteq$ N with embedding dimension e, conductor c and left part L = S $\cap$ [0, c -- 1], set W (S) = e|L| -- c. In 1978 Wilf asked, in equivalent terms, whether W (S) $\ge$ 0 always holds, a question known…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
We show that every quasitrivial n-ary semigroup is reducible to a binary semigroup, and we provide necessary and sufficient conditions for such a reduction to be unique. These results are then refined in the case of symmetric n-ary…
A semitopological group $G$ is called {\it an $n$-semitopological group}, if for any $g\in G$ with $e\not\in\overline{\{g\}}$ there is a neighborhood $W$ of $e$ such that $g\not\in W^{n}$, where $n\in\mathbb{N}$. The class of…
In this work we will introduce the concept of ratio-covariety, as a nonempty family $\mathscr{R}$ of numerical semigroups verifying certain properties. This concept will allow us to: \begin{enumerate} \item Describe an algorithmic process…
We introduce a class of finite semigroups obtained by considering Rees quotients of numerical semigroups. Several natural questions concerning this class, as well as particular subclasses obtained by considering some special ideals, are…
For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…
Let $S$ be a semiring. An $S$-semimodule $M$ is called a multiplication semimodule if for each subsemimodule $N$ of $M$ there exists an ideal $I$ of $S$ such that $N=IM$. In this paper we investigate some properties of multiplication…
An integer feasibility problem is a fundamental problem in many areas, such as operations research, number theory, and statistics. To study a family of systems with no nonnegative integer solution, we focus on a commutative semigroup…
Let $S$ be a finite semigroup and let $A$ be a finite dimensional $S$-graded algebra. We investigate the exponential rate of growth of the sequence of graded codimensions $c_n^S(A)$ of $A$, i.e $\lim\limits_{n \rightarrow \infty}…
We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…
A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…
In 1995 Grillet defined the concept of a stratified semigroup and a stratified semigroup with zero. The present authors extended that idea to include semigroups with a more general base and proved, amongst other things, that finite…
Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…
An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…
A semigroup amalgam (S; T1, T2) is known to be non-embeddable if T1 and T2 are both groups (completely regular semigroups, Clifford semigroups) but S is not such. We prove some non-embeddability conditions for semigroup amalgams (S; T1, T2)…
We characterize numerical semigroups for which the poset of its ideal class monoid is a lattice, and study the irreducible elements of such a lattice with respect to union, intersection, infimum and supremum.