scholarly journals Algebras of right ample semigroups

2018 ◽  
Vol 16 (1) ◽  
pp. 842-861 ◽  
Author(s):  
Junying Guo ◽  
Xiaojiang Guo

AbstractStrict RA semigroups are common generalizations of ample semigroups and inverse semigroups. The aim of this paper is to study algebras of strict RA semigroups. It is proved that any algebra of strict RA semigroups with finite idempotents has a generalized matrix representation whose degree is equal to the number of non-zero regular 𝓓-classes. In particular, it is proved that any algebra of finite right ample semigroups has a generalized upper triangular matrix representation whose degree is equal to the number of non-zero regular 𝓓-classes. As its application, we determine when an algebra of strict RA semigroups (right ample monoids) is semiprimitive. Moreover, we prove that an algebra of strict RA semigroups (right ample monoids) is left self-injective iff it is right self-injective, iff it is Frobenius, and iff the semigroup is a finite inverse semigroup.

Axioms ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 256
Author(s):  
Bhagwati Prashad Duggal ◽  
In-Hyoun Kim

For a Hilbert space operator T∈B(H), let LT and RT∈B(B(H)) denote, respectively, the operators of left multiplication and right multiplication by T. For positive integers m and n, let ▵T∗,Tm(I)=(LT∗RT−I)m(I) and δT∗,Tn(I)=(LT∗−RT)m(I). The operator T is said to be (m,n)-isosymmetric if ▵T∗,TmδT∗,Tn(I)=0. Power bounded (m,n)-isosymmetric operators T∈B(H) have an upper triangular matrix representation T=T1T30T2∈B(H1⊕H2) such that T1∈B(H1) is a C0.-operator which satisfies δT1∗,T1n(I|H1)=0 and T2∈B(H2) is a C1.-operator which satisfies AT2=(Vu⊕Vb)|H2A, A=limt→∞T2∗tT2t, Vu is a unitary and Vb is a bilateral shift. If, in particular, T is cohyponormal, then T is the direct sum of a unitary with a C00-contraction.


Computation ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 61
Author(s):  
Oscar Danilo Montoya ◽  
Juan S. Giraldo ◽  
Luis Fernando Grisales-Noreña ◽  
Harold R. Chamorro ◽  
Lazaro Alvarado-Barrios

The power flow problem in three-phase unbalanced distribution networks is addressed in this research using a derivative-free numerical method based on the upper-triangular matrix. The upper-triangular matrix is obtained from the topological connection among nodes of the network (i.e., through a graph-based method). The main advantage of the proposed three-phase power flow method is the possibility of working with single-, two-, and three-phase loads, including Δ- and Y-connections. The Banach fixed-point theorem for loads with Y-connection helps ensure the convergence of the upper-triangular power flow method based an impedance-like equivalent matrix. Numerical results in three-phase systems with 8, 25, and 37 nodes demonstrate the effectiveness and computational efficiency of the proposed three-phase power flow formulation compared to the classical three-phase backward/forward method and the implementation of the power flow problem in the DigSILENT software. Comparisons with the backward/forward method demonstrate that the proposed approach is 47.01%, 47.98%, and 36.96% faster in terms of processing times by employing the same number of iterations as when evaluated in the 8-, 25-, and 37-bus systems, respectively. An application of the Chu-Beasley genetic algorithm using a leader–follower optimization approach is applied to the phase-balancing problem utilizing the proposed power flow in the follower stage. Numerical results present optimal solutions with processing times lower than 5 s, which confirms its applicability in large-scale optimization problems employing embedding master–slave optimization structures.


2020 ◽  
Vol 18 (1) ◽  
pp. 182-193
Author(s):  
He Yuan ◽  
Liangyun Chen

Abstract Let R be a subset of a unital ring Q such that 0 ∈ R. Let us fix an element t ∈ Q. If R is a (t; d)-free subset of Q, then Tn(R) is a (t′; d)-free subset of Tn(Q), where t′ ∈ Tn(Q), $\begin{array}{} t_{ll}' \end{array} $ = t, l = 1, 2, …, n, for any n ∈ N.


2016 ◽  
Vol 94 (3) ◽  
pp. 457-463 ◽  
Author(s):  
PETER R. JONES

An algebra has the Howson property if the intersection of any two finitely generated subalgebras is again finitely generated. A simple necessary and sufficient condition is given for the Howson property to hold on an inverse semigroup with finitely many idempotents. In addition, it is shown that any monogenic inverse semigroup has the Howson property.


2021 ◽  
Vol 28 (01) ◽  
pp. 143-154
Author(s):  
Yiyu Li ◽  
Ming Lu

For any positive integer [Formula: see text], we clearly describe all finite-dimensional algebras [Formula: see text] such that the upper triangular matrix algebras [Formula: see text] are piecewise hereditary. Consequently, we describe all finite-dimensional algebras [Formula: see text] such that their derived categories of [Formula: see text]-complexes are triangulated equivalent to derived categories of hereditary abelian categories, and we describe the tensor algebras [Formula: see text] for which their singularity categories are triangulated orbit categories of the derived categories of hereditary abelian categories.


1978 ◽  
Vol 19 (1) ◽  
pp. 59-65 ◽  
Author(s):  
H. Mitsch

The natural order of an inverse semigroup defined by a ≤ b ⇔ a′b = a′a has turned out to be of great importance in describing the structure of it. In this paper an order-theoretical point of view is adopted to characterise inverse semigroups. A complete description is given according to the type of partial order an arbitrary inverse semigroup S can possibly admit: a least element of (S, ≤) is shown to be the zero of (S, ·); the existence of a greatest element is equivalent to the fact, that (S, ·) is a semilattice; (S, ≤) is directed downwards, if and only if S admits only the trivial group-homomorphic image; (S, ≤) is totally ordered, if and only if for all a, b ∈ S, either ab = ba = a or ab = ba = b; a finite inverse semigroup is a lattice, if and only if it admits a greatest element. Finally formulas concerning the inverse of a supremum or an infimum, if it exists, are derived, and right-distributivity and left-distributivity of multiplication with respect to union and intersection are shown to be equivalent.


Sign in / Sign up

Export Citation Format

Share Document