Related papers: Almost symmetric numerical semigroups
An affine semigroup is a finitely generated subsemigroup of $(\mathbb Z_{\ge 0}^d, +)$, and a numerical semigroup is an affine semigroup with $d = 1$. A growing body of recent work examines shifted families of numerical semigroups, that is,…
A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry.…
The distributive laws of ring theory are fundamental equalities in algebra. However, recently in the study of the Yang-Baxter equation, many algebraic structures with alternative "distributive" laws were defined. In an effort to study these…
We give two algorithmic procedures to compute the whole set of almost symmetric numerical semigroups with fixed Frobenius number and type, and the whole set of almost symmetric numerical semigroups with fixed Frobenius number. Our…
We generalize the notion of symmetric semigroups, pseudo symmetric semigroups, and row factorization matrices for pseudo Frobenius elements of numerical semigroups to the case of semigroups with maximal projective dimension (MPD…
Let $S,T$ be two numerical semigroups. We study when $S$ is one half of $T$, with $T$ almost symmetric. If we assume that the type of $T$, $t(T)$, is odd, then for any $S$ there exist infinitely many such $T$ and we prove that $1 \leq t(T)…
We develop a structure theory of connected solvable spherical subgroups in semisimple algebraic groups. Based on this theory, we obtain an explicit classification of all such subgroups up to conjugation.
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…
We establish a one-to-one correspondence between numerical semigroups of genus $g$ and almost symmetric numerical semigroups with Frobenius number $F$ and type $F-2g$, provided that $F$ is greater than $4g-1$.
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…
In this paper, we provide a complete description of congruence-semisimple semirings and introduce the pre-ordered abelian Grothendieck groups $K_0(S)$ and $SK_0(S)$ of the isomorphism classes of the finitely generated projective and…
In this note, we announce the first results on quasi-isometric rigidity of non-nilpotent polycyclic groups. In particular, we prove that any group quasi-isometric to the three dimenionsional solvable Lie group Sol is virtually a lattice in…
In this paper, we investigate the row-factorization matrices of Arf numerical semigroups, and we provide the full list of such matrices of certain Arf numerical semigroups. We use the information of row-factorization matrices to detect the…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
We study statistical properties of random numerical semigroups of a given genus. We analyze the graph of a typical numerical semigroup, understood as a function from $\mathbb{N}$ to $\mathbb{N}$. If $S$ is a numerical semigroup of genus…
The aim of this paper is to present the main constructions of the substructures of an almost groupoid and to discuss their basic properties. The definitions and properties concerning these new algebraic constructions extend to almost…
Finite quasi semimetrics on $n$ can be thought of as nonnegative valuations on the edges of a complete directed graph on $n$ vertices satisfying all possible triangle inequalities. They comprise a polyhedral cone whose symmetry groups were…
Given the integers $0<r_1<\dots<r_k$, we consider the shifted family of semigroups $M_n=\langle n, n+r_1,\dots, n+r_k\rangle$, where $n>0$. For sufficiently large $n$, we prove that if $M_n$ is nearly Gorenstein or almost symmetric, then so…
Let $H=\langle n_1, \ldots ,n_4\rangle$ be a numerical semigroup generated by $4$ elements, which is symmetric and let $k[H]$ be the semigroup ring of $H$ over a field $k$. H. Bresinski proved that the defining ideal of $k[H]$ is minimally…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…