Related papers: Almost symmetric numerical semigroups with odd gen…
We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties interms of "forbidden" semigroups.
We introduce the concept of homogeneous numerical semigroups and show that all homogeneous numerical semigroups with Cohen-Macaulay tangent cones are of homogeneous type. In embedding dimension three, we classify all numerical semigroups of…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
Consider a sequence of positive integers of the form $ca^n-d$, $n\geq 1$, where $a, c$ and $d$ are positive integers, $a>1$. For each $n\geq 1$, let $S_n$ be the submonoid of $\mathbb N$ generated by $\mathbf s_j=ca^{n+j}-d$, with…
We define a pseudo quasi-3 design as a symmetric design with the property that the derived and residual designs with respect to at least one block are quasi-symmetric. Quasi-symmetric designs can be used to construct optimal self…
Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…
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,…
The symmetry dimension of a geometric structure is the dimension of its symmetry algebra. We investigate symmetries of almost quaternionic structures of quaternionic dimension $n$. The maximal possible symmetry is realized by the…
For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
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 characterize semigroups in $\{0,1,2,\ldots\}$ of matricial dimension $2$ and produce a counterexample to the conjecture that a numerical semigroup whose small elements are lonely has matricial dimension at most $2$.
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…
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 \emph{numerical semigroup} is a subset $\Lambda$ of the nonnegative integers that is closed under addition, contains $0$, and omits only finitely many nonnegative integers (called the \emph{gaps} of $\Lambda$). The collection of all…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
We introduce the quasi-ordinarization transform of a numerical semigroup. This transform will allow to organize all the semigroups of a given genus in a forest rooted at all quasi-ordinary semigroups with the given genus. This construction…
Every numerical semigroup can be expressed as an intersection of irreducible numerical semigroups. We show that the unions of sets of lengths of factorizations of numerical semigroups into irreducible numerical semigroups are all equal to…
A homogeneous symmetric structure on an associative superalgebra A is a non-degenerate, supersymmetric, homogeneous (i.e. even or odd) and associative bilinear form on A. In this paper, we show that any associative superalgebra with non…