Related papers: The Realization Problem for Delta Sets of Numerica…
A semitotal dominating set of a graph $G$ with no isolated vertex is a dominating set $D$ of $G$ such that every vertex in $D$ is within distance two of another vertex in $D$. The minimum size $\gamma_{t2}(G)$ of a semitotal dominating set…
We study the cyclotomic exponent sequence of a numerical semigroup $S,$ and we compute its values at the gaps of $S,$ the elements of $S$ with unique representations in terms of minimal generators, and the Betti elements $b\in S$ for which…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of…
A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…
In most cases the semigroup at infinity $S$ of a curve $C$ with only one place at infinity is generated by a $\delta$-sequence. This sequence provides geometrical information on $C$ such as the dual graph of the resolution of the…
In this paper we present the set of saturated numerical semigroups with prime multiplicity. We also characterize the catenary degree of these semigroups that we acquire. The catenary degree of a numerical semigroup is the variant which…
The so--called subgroup commutativity degree $sd(G)$ of a finite group $G$ is the number of permuting subgroups $(H,K) \in \mathrm{L}(G) \times \mathrm{L}(G)$, where $\mathrm{L}(G)$ is the subgroup lattice of $G$, divided by…
Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…
Semigroup theory is a branch of abstract algebra, and it provides mathematical tools for the theory of computation. Finite semigroups can describe state transition systems and thus they model physically realizable computers. Engineering…
We consider a certain convolution semigroup $\Theta$ of probability distributions on the group $\mathbb{R}\times \mathbb{Z}(2)$, where $\mathbb{R}$ is the group of real numbers and $\mathbb{Z}(2)$ is the additive group of the integers…
There exist two different sorts of gaps in the nonsymmetric numerical additive semigroups finitely generated by a minimal set of positive integers {d_1,...,d_m}. The h-gaps are specific only for the nonsymmetric semigroups while the g-gaps…
From any poset isomorphic to the poset of gaps of a numerical semigroup $S$ with the order induced by $S$, one can recover $S$. As an application, we prove that two different numerical semigroups cannot have isomorphic posets (with respect…
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
The Degree Realization problem requires, given a sequence $d$ of $n$ positive integers, to decide whether there exists a graph whose degrees correspond to $d$, and to construct such a graph if it exists. A more challenging variant of the…
A semigroup $S$ is called an equational domain (e.d.) if any finite union of algebraic sets over $S$ is algebraic. For a semigroup $S$ with a finite ideal we find the necessary and sufficient conditions to be an e.d.
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
In this work we will show that if $F$ is a positive integer, then the set ${\mathrm{Arf}}(F)=\{S\mid S \mbox{ is an Arf numerical semigroup with Frobenius number } F\}$ verifies the following conditions: 1) $\Delta(F)=\{0,F+1,\rightarrow\}$…
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…