Constructing Almost Symmetric Numerical Semigroups from Irreducible Numerical Semigroups

Every almost symmetric numerical semigroup can be constructed by removing some minimal generators from an irreducible numerical semigroup with its same Frobenius number.     

Numerical Semigroups on Compound Sequences

We generalize the geometric sequence {a^p, a^p?1b, a^p?2b²,…, b^p} to allow the p copies of a (resp. b) to all be different. We call the sequence {a₁a₂a₃… a_p, b₁a₂a₃…a_p, b₁b₂a₃…a_p,…, b₁b₂b₃…b_p} a compound sequence. We consider numerical semigroups whose minimal set of generators form a compound sequence, and compute various semigroup and arithmetical invariants, including the Frobenius number, Apéry sets, Betti elements, and catenary degree. We compute bounds on the delta set and the tame degree.     

Apery Sets of Numerical Semigroups #

Let S be a numerical semigroup. We examine a particular subset of the Apery set of S and establish a correspondence between this subset and the holes of S . This correspondence allows us to establish conditions for S to be almost symmetric.     

Two-dimensional Irreducible Algebraic Semigroups

We study two-dimensional irreducible projective smooth algebraic semigroups. Minimal surface semigroups with Kodaira dimension at most one are partially classified. We also calculate the local dimension of the moduli scheme parameterizing all algebraic semigroup laws on a fixed minimal surface.     

Unitary Numerical Semigroups and Perfect Bricks

This article completes a previous investigation of balanced and unitary numerical semigroups. The main result establishes the equivalence of unitary numerical semigroups and perfect 2 × 2 bricks.     

Fundamental Gaps in Numerical Semigroups with Respect to Their Multiplicity

For a numerical semigroup, we introduce the concept of a fundamental gap with respect to the multiplicity of the semigroup. The semigroup is fully determined by its multiplicity and these gaps.We study the case when a set of non-negative integers is the set of fundamental gaps with respect to the multiplicity of a numerical semigroup, Numerical semigroups with maximum and minimum number of this kind of gaps are described.     

Fundamental Gaps in Numerical Semigroups with Respect to Their Multiplicity

For a numerical semigroup, we introduce the concept of a fundamental gap with respect tothe multiplicity of the semigroup.The semigroup is fully determined by its multiplicity and these gaps.We study the case when a set of non-negative integers is the set of fundamental gaps with respect to themultiplicity of a numerical semigroup.Numerical semigroups with maximum and mininmm number ofthis kind of gaps are described.     

Perfect Pairs of Ideals and Duals in Numerical Semigroups

This article considers numerical semigroups S that have a nonprincipal relative ideal I such that μ _S (I)μ _S (S ? I) = μ _S (I + (S ? I)). We show the existence of an infinite family of such pairs (S, I) in which I + (S ? I) = S\{0}. We also show examples of such pairs that are not members of this family. We discuss the computational process used to find these examples and present some open questions pertaining to them.     

Minimal Generating Sets for Relative Ideals in Numerical Semigroups of Multiplicity Eight

Abstract

Let S be a numerical semigroup and let I be a relative ideal of S. Let S ? I denote the dual of I and let μ _S (?) represent the size of a minimal generating set. We investigate the inequality μ _S (I)μ _S (S ? I) ≥ μ _S (I + (S ? I)) under the assumption that S has multiplicity 8. We will show that if I is non-principal, then the strict inequality μ _S (I)μ _S (S ? I) > μ _S (I + (S ? I)) always holds.     

Decomposition of Exponential Distributions on Positive Semigroups

Let (S,·) be a positive semigroup and T a sub-semigroup of S. In many natural cases, an element can be factored uniquely as x=yz, where and where z is in an associated “quotient space” S/T. If X has an exponential distribution on S, we show that Y and Z are independent and that Y has an exponential distribution on T. We prove a converse when the sub-semigroup is for . Specifically, we show that if Y _t and Z _t are independent and Y _t has an exponential distribution on S _t for each , then X has an exponential distribution on S. When applied to ([0,∞), +) and , these results unify and extend known results on the quotient and remainder when X is divided by t.     

Star Operations on Numerical Semigroups

It is proved that the number of numerical semigroups with a fixed number n of star operations is finite if n > 1. The result is then extended to the class of analytically irreducible residually rational one-dimensional Noetherian rings with finite residue field and integral closure equal to a fixed discrete valuation domain.     

严格循环与强不可约分解

Let W be an injective unilateral weighted shift, and let W(n) be the orthogonal direct sum of n copies of W. In this paper, we prove that, if the commutant of W is strictly cyclic, then W(n) has a unique (SI) decomposition with respect to similarity for every natural number n.     

Regular F-Abundant Semigroups

ABSTRACT

The investigation of regular F-abundant semigroups is initiated. In fact, F-abundant semigroups are generalizations of regular cryptogroups in the class of abundant semigroups. After obtaining some properties of such semigroups, the construction theorem of the class of regular F-abundant semigroups is obtained. In addition, we also prove that a regular F-abundant semigroup is embeddable into a semidirect product of a regular band by a cancellative monoid. Our result is an analogue of that of Gomes and Gould on weakly ample semigroups, and also extends an earlier result of O'Carroll on F-inverse semigroups.     

右Clifford左商半群

本文讨论了右Ｃｌｉｆｆｏｒｄ左商半群．利用所谓的可适对刻划了右Ｃｌｉｆｆｏｒｄ半群中的左次半群,因此扩展了商半群的研究范围．     

Automatic Completely-Simple Semigroups

The notion of automaticity has been widely studied in groups and some progress has been made in understanding the notion in the wider context of semigroups. The purpose of this paper is to study automatic completely-simple semigroups. We show that, if is a completely-simple semigroup (with and finite), then is automatic if and only if the group is automatic. As a consequence, we deduce that automatic completely-simple semigroups are finitely presented. We also show that automatic completely-simple semigroups are characterized by the fellow traveller property and also that the existence of an automatic structure is independent of the choice of generating set.     

矩阵逆半群

讨论矩阵逆半群的一些基本性质, 证明矩阵逆半群的幂等元集是有限布尔格的子半格, 从而证明等秩矩阵逆半群是群, 然后完全确定二级矩阵逆半群的结构：一个二级矩阵逆半群或者同构于二级线性群,或者同构于二级线性群添加一个零元素,或者是交换线性群的有限半格, 或者满足其他一些性质; 对于由某些二级矩阵构成的集合, 我们给出了它们成为矩阵逆半群的充分必要条件.     

Globals of Idempotent Semigroups

If S is a semigroup, the global (or the power semigroup) of S is the set P(S) of all nonempty subsets of S equipped with a naturally defined multiplication. A class K of semigroups is globally determined if any two semigroups of K with isomorphic globals are themselves isomorphic. We study properties of globals of idempotent semigroups and show, in particular, that the class of normal bands is globally determined.     

E-酉正则半群

本文定义了PO-六元组的概念,给出了E-酉正则半群的一种结构.     

完全单半群及完全正则半群的逆断面

指出完全单半群Ｓ的任何一个Ｆ－类是逆断面,且为Ｑ－逆断面,而Ｓ的任何一个逆断面必是一个Ｆ－类,因而所有逆断面同构。并且给出完全正则半群的逆断面存在的充要条件。