Related papers: Symmetric and Pseudo-Symmetric Numerical Semigroup…
We generalize the idea of a Schur ring of a group to the category of semigroups. Fundamental results of Schur rings over groups are shown to be true for Schur rings over semigroups. Examples where Schur rings differ between the two…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…
We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…
We explore the connection between ring homomorphisms and semigroup homomorphisms on matrix algebras over rings or $C^*$-algebras.
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
We compute supersymmetric indices which count local operators at certain half-BPS interfaces and quarter-BPS junctions of interfaces in four-dimensional $\mathcal{N}=4$ Super Yang-Mills theory. We use the indices as very stringent tests of…
The present work looks at semiautomatic rings with automatic addition and comparisons which are dense subrings of the real numbers and asks how these can be used to represent geometric objects such that certain operations and…
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 associate a graph ${\mathcal N}_{S}$ with a semigroup $S$ (called the upper non-nilpotent graph of $S$). The vertices of this graph are the elements of $S$ and two vertices are adjacent if they generate a semigroup that is not nilpotent…
Let $G=\Gamma(S)$ be a semigroup graph, i.e., a zero-divisor graph of a semigroup $S$ with zero element 0. For any adjacent vertices $x, y$ in $G$, denote $C(x,y)={z\in V(G) | N(z)={x,y}}$. Assume that in $G$ there exist two adjacent…
The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.
The structure of the defining ideal of the semigroup ring $k[H]$ of a numerical semigroup $H$ over a field $k$ is described, when the pseudo-Frobenius numbers of $H$ are multiples of a fixed integer.
The flag type of a semigroup S of a noncompact semisimple Lie group is an algebraic tool related to the geometry of the invariant control set determined by S on the flag manifolds of G. In the present paper we show that it is possible to…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
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…
This paper determines almost symmetric numerical semigroups with maximal reduced type completely. In addition, this paper classifies MED-semigroups with maximal reduced type.
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…
This paper examines in a new way some known facts about numerical semigroups especially when the number of minimal generators (that is the embedding dimension) is at most three and at least two minimal generators are coprime. For such…
Let $S$ be a semigroup, $\Lambda$ a non-empty set and $P$ a mapping of $\Lambda$ into $S$. The set $S\times \Lambda$ together with the operation $\circ _P$ defined by $(s, \lambda)\circ _P(t, \mu )=(sP(\lambda)t, \mu )$ form a semigroup…
A proper subsemigroup of a semigroup is maximal if it is not contained in any other proper subsemigroup. A maximal subsemigroup of a finite semigroup has one of a small number of forms, as described in a paper of Graham, Graham, and Rhodes.…