On Some Monogenic Semigroups with an Associate Subgroup

Let S be any semigroup and a, s ∈ S. If a = asa, then s is an associate of a. A subgroup G of S is an associate subgroup of S if every a ∈ S has a unique associate a* in G. It turns out that G = H _z for some idempotent z, the zenith of S. The mapping a → a* is a unary operation on S. We say that S is monogenic if S is generated, as a unary semigroup, by a single element.

We embark upon the problem of the structure of monogenic semigroups in this sense by characterizing monogenic ones belonging to completely simple semigroups, normal cryptogroups, orthogroups, combinatorial semigroups, cryptic medial semigroups, cryptic orthodox semigroups, and orthodox monoids. In each of these cases, except one, we construct a free object. The general problem remains open.     

Embedding Semigroups with Associate Subgroups into Semidirect Products

A semigroup S is said to have an associate subgroup G if, for each s ∈ S, there is a unique s* ∈ G such that ss*s = s. If the identity 1 _G of G is medial, i.e., c1 _G c = c holds for each c being a product of idempotents, we show that S is isomorphic to a certain subsemigroup of a semidirect product of an idempotent generated semigroup C by G. If additionally S is orthodox, we may choose C to be a band, belonging to the band variety, generated by the band of idempotents of S.     

Semigroups with I-Quasi Length and Syntactic Semigroups

A module M is said to be extending (𝒢-extending) if for each submodule X of M there exists a direct summand D of M such that X is essential in D (X ∩ D is essential in both X and D). It is known that for a nonsingular module the concepts of 𝒢-extending and extending coincide. However, in the not nonsingular case, they are distinct. In this article, we obtain a characterization of the right 𝒢-extending generalized triangular matrix rings. This result and its corollaries improve and generalize the existing results on right extending generalized triangular matrix rings. It is well known that the ring of n-by-n triangular matrices over a right selfinjective ring is not, in general, right extending. One application of our characterization shows that such rings are right 𝒢-extending. Connections to Operator Theory and a characterization of the class of right extending right SI-rings are also obtained. Examples are given to illustrate and delimit the theory.     

R-模糊正规子群

给出了R-模糊正规子群与基于蕴涵的模糊正规子群的定义,得到了R-模糊正规子群的交、并、同态像以及同态原像的相关性质;另外还讨论了它与不同的模糊正规子群的区别与联系,并且给出了具体的蕴涵算子厦它的等价形式.     

关于Clifford半群上的fuzzy同余

利用半群fuzzy同余的概念,讨论一类特殊的完全正则半群,即Clifford半群上的fuzzy同余.研究该类半群上fuzzy同余的性质.在此基础上,给出Clifford半群上fuzzy同余的性质和特征,得到Cllifford半群上fuzzy同余为fuzzy消去同余的充要条件.     

Iterative Characterizations of Computable Unary Functions: A General Method

Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving very nice features.     

Endomorphism Seminear-Rings of Brandt Semigroups

We consider the endomorphisms of a Brandt semigroup B _n and the semigroup of mappings E(B _n ) that they generate under pointwise composition. We describe all the elements of this semigroup, determine Green's relations, consider certain special types of mapping, which we can enumerate for each n, and give complete calculations for the size of E(B _n ) for small n.     

Rigid Unary Functions and the Axiom of Choice

We shall investigate certain statements concerning the rigidity of unary functions which have connections with (weak) forms of the axiom of choice.     

Modified Partial-Update Newton-Type Algorithms for Unary Optimization

In this paper, we propose two modified partial-update algorithms for solving unconstrained unary optimization problems based on trust-region stabilization via indefinite dogleg curves. The two algorithms partially update an approximation to the Hessian matrix in each iteration by utilizing a number of times the rank-one updating of the Bunch–Parlett factorization. In contrast with the original algorithms in Ref. 1, the two algorithms not only converge globally, but possess also a locally quadratic or superlinear convergence rate. Furthermore, our numerical experiments show that the new algorithms outperform the trust-region method which uses the partial update criteria suggested in Ref. 1.     

Smooth正规子群

Mustafa Demirci在文[2]及[3]中分别引入了smooth群与smooth子群的概念，本文在此基础上给出了smooth正规子群及其ε-商群的定义，并通过smooth同余得到smooth正规子群的一个刻画。     

On residual finiteness of direct products of algebraic systems

It is well known that if two algebraic structures A and B are residually finite then so is their direct product. Here we discuss the converse of this statement. It is of course true if A and B contain idempotents, which covers the case of groups, rings, etc. We prove that the converse also holds for semigroups even though they need not have idempotents. We also exhibit three examples which show that the converse does not hold in general.      

由格蕴涵代数诱导的伴随半群

给出由格蕴涵代数诱导出的伴随半群及有关概念 ,详细讨论伴随半群中的元素即格蕴涵代数的左映射的性质 ,得到它们的几个等价条件。最后讨论由格蕴涵代数诱导的两个双格半群与伴随半群之间的关系 ,并证明这些半群是幂等的当且仅当它们是由格 H蕴涵代数所诱导     

Convergent Outer Approximation Algorithms for Solving Unary Programs

Interesting cutting plane approaches for solving certain difficult multiextremal global optimization problems can fail to converge. Examples include the concavity cut method for concave minimization and Ramana's recent outer approximation method for unary programs which are linear programming problems with an additional constraint requiring that an affine mapping becomes unary. For the latter problem class, new convergent outer approximation algorithms are proposed which are based on sufficiently deep l-norm or quadratic cuts. Implementable versions construct optimal simplicial inner approximations of Euclidean balls and of intersections of Euclidean balls with halfspaces, which are of general interest in computational convexity. Computational behavior of the algorithms depends crucially on the matrices involved in the unary condition. Potential applications to the global minimization of indefinite quadratic functions subject to indefinite quadratic constraints are shown to be practical only for very small problem sizes.     

Prime Ideals of Cancellative Semigroups

Abstract

For a class of prime ideals P of a cancellative semigroup S it is shown that the factors S/P have a structure of a monomial semigroup over a group. Consequences for the semigroup algebras K[S] are discussed.     

基于模糊不变子群的上、下近似

研究群中集合的粗糙近似问题。利用分解定理和表现定理,定义了群中集合关于模糊不变子群的上、下近似,并给出了近似算子的性质。证明了子群的上、下近似在同态映射下的不变性质。     

On Lattice-ordered Rees Matrix Semigroups

ＯｎＬａｔｔｉｃｅ－ｏｒｄｅｒｅｄＲｅｅｓＭａｔｒｉｘＳｅｍｉｇｒｏｕｐｓ￥（谢祥云）ＸｉｅＸｉａｎｇｙｕｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＬａｎｚｈｏｕＵｎｉｖｅｒｓｉｔｙ，Ｌａｎｚｈｏｕ，７３００００）Ａｂｓｔｒａｃｔ：Ｔｈｅｐ...     

序半群素模糊理想的刻画

研究序半群S的素模糊理想,通过S的模糊左（右）理想和序模糊点给出了S的素模糊理想的等价刻画。     

半群中的粗模糊理想

将粗糙集的理论方法用于模糊半群的研究。首先，给出上(下)粗模糊子半群及上(下)粗模糊理想等概念，并研究了它们的有关性质。随后，证明了上粗模糊子半群与上粗模糊理想是通常的模糊子半群与模糊理想概念的扩张。特别地，运用粗糙集的思想方法研究半群上的模糊同余及其截关系，给出它们的一些基本性质。     

(∈,∈∨q(λ,μ))-模糊正规子群

给出(∈,∈∨q(λ,μ))-模糊正规子群的定义,讨论模糊正规子群的一些基本性质。