The rank of a commutative cancellative semigroup S is the cardinality of a maximal independent subset of S. Commutative cancellative semigroups of finite rank are subarchimedean and thus admit a Tamura-like representation. We characterize these semigroups in several ways and provide structure theorems in terms of a construction akin to the one devised by T. Tamura for N-semigroups.

We derive the actions for type II Green-Schwarz strings up to second order in the fermions, for general bosonic backgrounds. We base our work on the so-called normal coordinate expansion. The resulting actions are κ-symmetric and, for the case of surviving background supersymmetries, supersymmetric. We first obtain the type IIa superstring action from the 11D supermembrane by double dimensional...

let s be a locally compact topological foundation semigroup with identity and ma(s) be its semigroup algebra. in this paper, we give necessary and sufficient conditions to have abounded approximate identity in closed codimension one ideals of the semigroup algebra $m_a(s)$ of a locally compact topological foundationsemigroup with identity.

We describe the structure of 0-simple countably compact topological inverse semigroups and the structure of congruence-free countably compact topological inverse semigroups. We follow the terminology of [3, 4, 8]. In this paper all topological spaces are Hausdorff. If S is a semigroup then we denote the subset of idempotents of S by E(S). A topological space S that is algebraically a semigroup ...

In this paper we investigate some properties of congruences on ternary semigroups. We also define the notion of congruence on a ternary semigroup generated by a relation and we determine the method of obtaining a congruence on a ternary semigroup T from a relation R on T. Furthermore we study the lattice of congruences on a ternary semigroup and we show that this lattice is not generally modular...

We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free...

Inspired by the results of [APR], we propose combinatorial Gelfand models for semigroup algebras of some finite semigroups, which include the symmetric inverse semigroup, the dual symmetric inverse semigroup, the maximal factorizable subsemigroup in the dual symmetric inverse semigroup, and the factor power of the symmetric group. Furthermore we extend the Gelfand model for the semigroup algebr...

We call (T (t))t≥0 an abstract delay semigroup. This notion is introduced in more detail in Section 2. The semigroup thus obtained is rarely a contraction semigroup. In this paper we will show that under very mild conditions, we may change the inner product on E into an equivalent inner product, such that the delay semigroup becomes a (generalized) contraction semigroup. A contraction semigroup...

Left-discrimination of a semigroup is defined and shown to be a sufficient condition that a semigroup be isomorphic to the input semigroup of its semigroup automaton, a necessary condition if the semigroup is finite. The left-discrimination sequence of an automaton is defined as a sequence of semigroups beginning with the input semigroup of the automaton, each member being the input semigroup o...

We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential...