Cancellative semigroup

About: Cancellative semigroup is a research topic. Over the lifetime, 1320 publications have been published within this topic receiving 13319 citations.

The commuting graph of the symmetric inverse semigroup

Abstract: The commuting graph of a finite non-commutative semigroup S, denoted G(S), is a simple graph whose vertices are the non-central elements of S and two distinct vertices x, y are adjacent if xy = yx. Let I(X) be the symmetric inverse semigroup of partial injective transformations on a finite set X. The semigroup I(X) has the symmetric group Sym(X) of permutations on X as its group of units. In 1989, Burns and Goldsmith determined the clique number of the commuting graph of Sym(X). In 2008, Iranmanesh and Jafarzadeh found an upper bound of the diameter of G(Sym(X)), and in 2011, Dolžan and Oblak claimed that this upper bound is in fact the exact value. The goal of this paper is to begin the study of the commuting graph of the symmetric inverse semigroup I(X). We calculate the clique number of G(I(X)), the diameters of the commuting graphs of the proper ideals of I(X), and the diameter of G(I(X)) when |X| is even or a power of an odd prime. We show that when |X| is odd and divisible by at least two primes, then the diameter of G(I(X)) is either 4 or 5. In the process, we obtain several results about semigroups, such as a description of all commutative subsemigroups of I(X) of maximum order, and analogous results for commutative inverse and commutative nilpotent subsemigroups of I(X). The paper closes with a number of problems for experts in combinatorics and in group or semigroup theory.

On a pull-back diagram for orthodox semigroups

Abstract: In the present paper we deal with two problems concerning orthodox semigroups. M. Yamada raised the questions in [6] whether there exists an orthodox semigroup T with band of idempotents E and greatest inverse semigroup homomorphic image S for every band E and inverse semigroup S which have the property that Open image in new window is isomorphic to the semilattice of idempotents of S, and if T exists then whether it is always unique up to isomorphism. T. E. Hall [1] has published counter-examples in connection with both questions and, moreover, he has given a necessary and sufficient condition for existence. Now we prove a more effective necessary and sufficient condition for existence and deal with uniqueness, too. On the other hand, D. B. McAlister's theorem in [4] saying that every inverse semigroup is an idempotent separating homomorphic image of a proper inverse semigroup is generalized for orthodox semigroups. The proofs of these results are based on a theorem concerning a special type of pullback diagrams. In verifying this theorem we make use of the results in [5] which we draw up in Section 1. The main theorems are stated in Section 2. For the undefined notions and notations the reader is referred to [2].

Radical of weakly ordered semigroup algebras

Abstract: We define the notion of weakly ordered semigroups. For this class of semigroups, we compute the radical of the semigroup algebras. This generalizes some results on left regular bands and on 0- Hecke algebras.

On the importance of idempotence

Abstract: Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from some commutative semigroup. Subject to a fixed space of possible range shapes, the problem is to preprocess the points so that the total semigroup sum of the points lying within a given query range η can be determined quickly. In the approximate version of the problem we assume that η is bounded, and we are given an approximation parameter e > 0. We are to determine the semigroup sum of all the points contained within η and may additionally include any of the points lying within distance e • diam(η) of η's boundar.In this paper we contrast the complexity of range searching based on semigroup properties. A semigroup (S,+) is idempotent if x + x = x for all x ∈ S, and it is integral if for all k ≥ 2, the k-fold sum x + ... + x is not equal to x. For example, (R, min) and (0,1, ∨) are both idempotent, and (N, +) is integral. To date, all upper and lower bounds hold irrespective of the semigroup. We show that semigroup properties do indeed make a difference for both exact and approximate range searching, and in the case of approximate range searching the differences are dramatic.First, we consider exact halfspace range searching. The assumption that the semigroup is integral allows us to improve the best lower bounds in the semigroup arithmetic model. For example, assuming O(n) storage in the plane and ignoring polylog factors, we provide an Ω*(n2/5) lower bound for integral semigroups, improving upon the best lower bound of Ω*(n1/3), thus closing the gap with the O(n1/2) upper bound.We also consider approximate range searching for Euclidean ball ranges. We present lower bounds and nearly matching upper bounds for idempotent semigroups. We also present lower bounds for range searching for integral semigroups, which nearly match existing upper bounds. These bounds show that the advantages afforded by idempotency can result in major improvements. In particular, assuming roughly linear space, the exponent in the e-dependencies is smaller by a factor of nearly 1/2. All our results are presented in terms of space-time tradeoffs, and our lower and upper bounds match closely throughout the entire spectrum.To our knowledge, our results provide the first proof that semigroup properties affect the computational complexity of range searching in the semigroup arithmetic model. These are the first lower bound results for any approximate geometric retrieval problems. The existence of nearly matching upper bounds, throughout the range of space-time tradeoffs, suggests that we are close to resolving the computational complexity of both idempotent and integral approximate spherical range searching in the semigroup arithmetic model.

Semigroup identities in 4-Engel groups

Abstract: We say that a group G or a variety of groups V satisfies a semigroup law, if it satisfies a nontrivial law of the form u(x1, . . . , xn) = v(x1, . . . xn), where u and v are words in the free semigroup freely generated by x1, . . . , xn. It follows from a result of J. Lewin and T. Lewin [2] that a variety V of groups which satisfies a semigroup law can be characterised by its semigroups laws. Furthermore, we have then a sufficient and necessary condition for a semigroup to be embeddable in some group in V . A semigroup S is embeddable in some group in V if and only if it is cancellative and it satisfies all the semigroup laws that hold in V . In other words we have that S is embeddable in some group in V if and only if S is a cancellative semigroup in the corresponding semigroup variety. In [4] B. H. Neumann and T. Taylor show that nilpotent groups satisfy semigroup laws. We will be using their work later on so we will now describe it in more details. Let F be a free group that is freely generated by the variables x, y, z1, z2, . . .. We define a sequence of words q1, q2, . . . in the variables x, y, z1, z2, . . . by induction as follows.