Related papers: Generalized Numerical semigroups up to isomorphism

There has been significant recent interest in studying how the number of numerical semigroups of genus $g$ behaves as a function of $g$. Bras-Amor\'os has shown how to organize the collection of numerical semigroups of genus $g$ into a…

This paper introduces new structural decompositions for almost symmetric numerical semigroups through the combinatorial lens of Young diagrams. To do that, we use the foundational correspondence between numerical sets and Young diagrams,…

We classify by numerical invariants the finite subgroups $H$ of a primary abelian group $G$ for which every homomorphism or monomorphism of $H$ into $G$, or every endomorphism of $H$, extends to an endomorphism of $G$. We apply these…

A semigroupoid is a set equipped with a partially defined associative operation. Given a semigroupoid \Lambda we construct a C*-algebra C*(\Lambda) from it. We then present two main examples of semigroupoids, namely the Markov semigroupoid…

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…

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…

Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…

Given two numerical semigroups $S$ and $T$ we say that $T$ is a multiple of $S$ if there exists an integer $d \in \mathbb{N} \setminus \{0\}$ such that $S = \{x \in \mathbb{N} \mid d x \in T\}$. In this paper we study the family of…

Let $H$ be a numerical semigroup. We give effective bounds for the multiplicity $e(H)$ when the associated graded ring $\operatorname{gr}_\mathfrak{m} K[H]$ is defined by quadrics. We classify Koszul complete intersection semigroups in…

We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…

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.…

We are interested in formulas for the number of elements in certain classes of numerical semigroups

For a unital ring $S$, an $S$-linear quasigroup is a unital $S$-module, with automorphisms $\rho$ and $\lambda$ giving a (nonassociative) multiplication $x\cdot y=x^\rho+y^\lambda$. If $S$ is the field of complex numbers, then ordinary…

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers,…

An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…

In this short note, we show that the number of monogenic submonoids of the full transformation monoid of degree $n$ for $n > 0$, equals the sum of the number of cyclic subgroups of the symmetric groups on $1$ to $n$ points. We also prove an…

A proportionally modular affine semigroup is the set of nonnegative integer solutions of a modular Diophantine inequality $f_1x_1+\cdots +f_nx_n \mod b \le g_1x_1+\cdots +g_nx_n$ where $g_1,\dots,g_n,$ $f_1,\ldots ,f_n\in \mathbb{Z}$ and…

Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…

We construct a category equivalent to the category $\mathbf{Mon}$ of monoids and monoid homomorphisms, based on categories with strict factorization systems. This equivalence is then extended to the category $\mathbf{Mon_s}$ of unital…