Throughout we let Γ be a discrete group. For f : Γ → C and each s ∈ Γ we define the left translation action by (s.f)(t) = f(s−1t). Definition 1.1. A group Γ is amenable is there exists a state μ on l∞(Γ) which is invariant under the left translation action: for all s ∈ Γ and f ∈ l∞(Γ), μ(s.f) = μ(f). Example 1.2. Finite groups are amenable: take the state which sends χ{s} to 1 |Γ| for each s ∈ ...

We prove that almost every path of a random walk on a finitely generated non-amenable group converges in the compactification of the group introduced by W.J. Floyd. In fact, we consider the more general setting of ergodic cocycles of some semigroup of 1-Lipschitz maps of a complete metric space with a boundary constructed following Gromov. We obtain in addition that when the Floyd boundary of a...

Let $ (A,| cdot |) $ be a real Banach algebra, a complex algebra $ A_mathbb{C} $ be a complexification of $ A $ and $ | | cdot | | $ be an algebra norm on  $ A_mathbb{C}  $  satisfying a simple condition together with the norm $ | cdot | $ on $ A$.  In this paper we first show that $ A^* $ is a real Banach $ A^{**}$-module if and only if $ (A_mathbb{C})^* $ is a complex Banach $ (A_mathbb{C})^{...

Recommended by Mohamed Khamsi Let S be a left amenable semigroup, let S {T s : s ∈ S} be a representation of S as Lipschitzian mappings from a nonempty compact convex subset C of a smooth Banach space E into C with a uniform Lipschitzian condition, let {μn} be a strongly left regular sequence of means defined on an S-stable subspace of l∞ S , let f be a contraction on C, and let {αn}, {βn}, and...

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...