Related papers: Constructing the set of complete intersection nume…
A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…
We generalize the notion of symmetric semigroups, pseudo symmetric semigroups, and row factorization matrices for pseudo Frobenius elements of numerical semigroups to the case of semigroups with maximal projective dimension (MPD…
Commutative Hilbertian Frobenius algebras are those commutative semi-group objects in the monoidal category of Hilbert spaces, for which the Hilbert adjoint of the multiplication satisfies the Frobenius compatibility relation, that is, this…
A numerical semigroup $S$ is coated with odd elements (Coe-semigroup), if $\left\{x-1, x+1\right\}\subseteq S$ for all odd element $x$ in $S$. In this note, we will study this kind of numerical semigroups. In particular, we are interested…
A set of vertices in a hypergraph is called an independent set if no hyperedge is completely contained inside the set. Given a hypergraph, computing its largest size independent set is an NP-hard problem. In this work, we study the…
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…
Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…
We compute the Frobenius number for sequences of triangular and tetrahedral numbers. In addition, we study some properties of the numerical semigroups associated to those sequences.
Let $\mathbb{N}^{d}$ be the $d$-dimensional monoid of non-negative integers. A generalized numerical semigroup is a submonoid $ S\subseteq \mathbb{N}^d$ such that $H(S)=\mathbb{N}^d \setminus S$ is a finite set. We introduce irreducible…
In this paper, we explore affine semigroup versions of the convex geometry theorems of Helly, Tverberg, and Caratheodory. Additionally, we develop a new theory of colored affine semigroups, where the semigroup generators each receive a…
A numerical set is a co-finite subset of the natural numbers that contains zero. Its Frobenius number is the largest number in its complement. Each numerical set has an associated semigroup $A(T)=\{t\mid t+T\subseteq T\}$, which has the…
We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by…
Oriented closed curves on an orientable surface with boundary are described up to continuous deformation by reduced cyclic words in the generators of the fundamental group and their inverses. By self-intersection number one means the…
This paper addresses the problem of decomposing a numerical semigroup into m-irreducible numerical semigroups. The problem originally stated in algebraic terms is translated, introducing the so called Kunz-coordinates, to resolve a series…
We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…
We give several algorithms addressing computations of intersections of conjugate subgroups.
We introduce the notion of numerical semigroups generated by concatenation of arithmetic sequences and show that this class of numerical semigroups exhibit multiple interesting behaviours.
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
A free numerical semigroup is a submonoid of the non-negative integers with finite complement that is additively generated by the terms in a telescopic sequence with gcd 1. However, such a sequence need not be minimal, which is to say that…
A numerical semigroup is a subset of N containing 0, closed under addition and with finite complement in N. An important example of numerical semigroup is given by the Weierstrass semigroup at one point of a curve. In the theory of…