Loading [MathJax]/jax/output/CommonHTML/jax.js
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    On the Ranks of Semigroups of Transformations on a Finite Set with Restricted Range

    Let formula be the semigroup of all partial transformations on X, formula and formula be the subsemigroups of formula of all full transformations on X and of all injective partial transformations on X, respectively. Given a non-empty subset Y of X, let formula, formula and formula. In 2008, Sanwong and Sommanee described the largest regular subsemigroup and determined Green's relations of formula. In this paper, we present analogous results for both formula and formula. For a finite set X with |X| ≥ 3, the ranks of formula, formula and formula are well known to be 4, 3 and 3, respectively. In this paper, we also compute the ranks of formula, formula and formula for any proper non-empty subset Y of X.

  • articleNo Access

    On the Semigroups of Order-preserving and A-Decreasing Finite Transformations

    For n ∈ ℕ, let On be the semigroup of all singular order-preserving mappings on [n]= {1,2,…,n}. For each nonempty subset A of [n], let On(A) = {α ∈ On: (∀ k ∈A) kα ≤ k} be the semigroup of all order-preserving and A-decreasing mappings on [n]. In this paper it is shown that On(A) is an abundant semigroup with n-1𝒟*-classes. Moreover, On(A) is idempotent-generated and its idempotent rank is 2n-2- |A\ {n}|. Further, it is shown that the rank of On(A) is equal to n-1 if 1 ∈ A, and it is equal to n otherwise.

  • articleNo Access

    A System of Periodic Discrete-time Coupled Sylvester Quaternion Matrix Equations

    We in this paper derive necessary and sufficient conditions for the system of the periodic discrete-time coupled Sylvester matrix equations AkXk + YkBk = Mk, CkXk+1 + YkDk = Nk (k = 1, 2) over the quaternion algebra to be consistent in terms of ranks and generalized inverses of the coefficient matrices. We also give an expression of the general solution to the system when it is solvable. The findings of this paper generalize some known results in the literature.

  • articleNo Access

    A Note on the Rank of a Restricted Lie Algebra

    In this short note, we study the rank of a restricted Lie algebra (𝔤, [p]), and give some applications which concern the dimensions of non-trivial irreducible modules. We also compute the rank of the restricted contact algebra.