Processing math: 100%
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

    Embedding Regular Semigroups into Idempotent Generated Ones

    Any semigroup S can be embedded into a semigroup, denoted by ΨS, having some remarkable properties. For general semigroups there is a close relationship between local submonoids of S and of ΨS. For a number of usual semigroup properties formula, we prove that S and ΨS simultaneously satisfy formula or not. For a regular semigroup S, the relationship of S and ΨS is even closer, especially regarding the natural partial order and Green's relations; in addition, every element of ΨS is a product of at most four idempotents. For completely regular semigroups S, the relationship of S and ΨS is still closer. On the lattice formula of varieties of completely regular semigroups formula regarded as algebras with multiplication and inversion, by means of ΨS, we define an operator, denoted by Ψ. We compare Ψ with some of the standard operators on formula and evaluate it on a small sublattice of formula.

  • articleNo Access

    Symmetric Words in Dihedral Groups

    Let G be a group and let w = w(x1, x2,…, xn) be a word in the absolutely free group Fn on free variables x1, x2,…, xn. The set S(n)(G) of all words w such that the equality w(gσ1, gσ2,…, gσn) = w(g1, g2,…, gn) holds for all g1, g2,…, gn∈G and all permutations σ ∈ Sn is a subgroup of Fn, called the subgroup of n-symmetric words for G. In this paper, the groups S(2)(Dp) and S(3)(Dp) for dihedral groups Dp are determined, where p > 3 is a prime. In particular, it turns out that the groups S(3)(Dp) are not abelian.

  • articleNo Access

    A Note on formula-Testability for Varieties of Bands

    Assume that formula is the variety of bands, and the identities of formula involve n variables (n ≥ 2). In this paper, we show that formula is formula-testable and is not formula-testable.

  • articleNo Access

    The Number of Rational Points of a Family of Algebraic Varieties over Finite Fields

    Let 𝔽q stand for the finite field of odd characteristic p with q elements (q = pn, n ∈ ℕ) and F*q denote the set of all the nonzero elements of 𝔽q. Let m and t be positive integers. By using the Smith normal form of the exponent matrix, we obtain a formula for the number of rational points on the variety defined by the following system of equations over Fq:t1j=0rj+1rji=1ak,rj+ix1e(k)rj+i,1xe(k)rj+i,nj+1nj+1=bk,k=1,,m, where the integers t > 0, r0 = 0 < r1 < r2 < ⋯ < rt, 1 ≤ n1 < n2 <, ⋯ < nt and 0 ≤ jt − 1, bk ∊ 𝔽q, ak,iF*q (k = 1, …, m, i = 1, …, rt), and the exponent of each variable is a positive integer. Further, under some natural conditions, we arrive at an explicit formula for the number of 𝔽q-rational points on the above variety. It extends the results obtained previously by Wolfmann, Sun, Wang, Hong et al. Our result gives a partial answer to an open problem raised in [The number of rational points of a family of hypersurfaces over finite fields, J. Number Theory156 (2015) 135–153].

  • articleNo Access

    Varieties of Involution J-Trivial Monoids with Continuum Many Subvarieties

    In this paper, we give a sufficient condition under which an involution monoid generates a variety with continuum many subvarieties. According to this result, several involution J-trivial monoids are shown to generate varieties with continuum many subvarieties. These examples include Rees quotients of free involution monoids, Lee monoids with involution, and Straubing monoids with involution.

  • articleNo Access

    Limit Varieties of Monoids Satisfying a Certain Identity

    A limit variety is a variety that is minimal with respect to being non-finitely based. Since the turn of the millennium, much attention has been given to the classification of limit varieties of aperiodic monoids. Seven explicit examples have so far been found, and the task of locating other examples has recently been reduced to two subproblems, one of which is concerned with monoids that satisfy the identity xsxtxsxtx. We provide a complete solution to this subproblem by showing that there are precisely two limit varieties that satisfy this identity. One of them turns out to be the first example having infinitely many subvarieties. It is also deduced that the variety generated by any monoid of order 5 or less contains at most countably many subvarieties.