Related papers: Almost symmetric numerical semigroups
Let $H$ be a numerical semigroup minimally generated by an almost arithmetic sequence. We give a description of a possible row-factorization $(\RF)$ matrix for each pseudo-Frobenius element of $H.$ Further, when $H$ is symmetric and has…
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.…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
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 notion of almost symmetric numerical semigroup was given by V. Barucci and R. Fr\"oberg. We characterize almost symmetric numerical semigroups by symmetry of pseudo-Frobenius numbers. We give a criterion for $H^*$ (the dual of $M$) to…
We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
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…
We give a criterion for almost Gorenstein property for semigroup rings associated with simplicial semigroups. We extend Nari's theorem for almost symmetric numerical semigroups to simplicial semigroups with higher rank. By this criterion,…
This paper determines almost symmetric numerical semigroups with maximal reduced type completely. In addition, this paper classifies MED-semigroups with maximal reduced type.
The class of good semigroups is a class of subsemigroups of $N^h$, that includes the value semigroups of rings associated to curve singularities and their blowups, and allows to study combinatorically the properties of these rings. In this…
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…
Numerical semigroup rings are investigated from the relative viewpoint. It is known that algebraic properties such as singularities of a numerical semigroup ring are properties of a flat numerical semigroup algebra. In this paper, we show…
In this paper we study numerical semigroups generated by three elements. We give a characterization of pseudo-symmetric numerical semigroups. Also, we will give a simple algorithm to get all the pseudo-symmetric numerical semigroups with…
We study numerical semigroups with the property "multiplicity= embedding dimension+1", generated by concatenation of arithmetic sequences.
We introduce the notion of a quasi-connected reductive group over an arbitrary field to be an almost direct product of a connected semisimple group and a quasi-torus (a smooth group of multiplicative type). We show that a linear algebraic…
We study quasi-semisimple elements of disconnected reductive algebraic groups over an algebraically closed field. We describe their centralizers, define isolated and quasi-isolated quasi-semisimple elements and classify their conjugacy…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
We determine the structure of finitely generated groups which are quasi-isometric to symmetric spaces of noncompact type, allowing Euclidean de Rham factors If $X$ is a symmetric space of noncompact type with no Euclidean de Rham factor,…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…