<Emphasis Type="Italic">C</Emphasis>*-Algebras Generated by Mappings. Criterion of Irreducibility

We study the operator algebra associated with a self-mapping ? on a countable set X which can be represented as a directed graph. The algebra is generated by the family of partial isometries acting on the corresponding l²(X). We study the structure of involutive semigroup multiplicatively generated by the family of partial isometries. We formulate the criterion when the algebra is irreducible on the Hilbert space. We consider the concrete examples of operator algebras. In particular, we give the examples of nonisomorphic C*-algebras, which are the extensions by compact operators of the algebra of continuous functions on the unit circle.     

Graphs and finite transformation semigroups

Given a finite set X and a semigroup S of transformations of X, we study the orbitoids of S on X and on X² and, assuming S transitive, those of the statbilizer in S of an element α ∈ X. The action of S as a semigroup of endomorphisms of some relevant graphs (having X as vertex set) is also considered.     

Embedding finite posets in cubes

In this paper we define the n-cube Q_n as the poset obtained by taking the cartesian product of n chains each consisting of two points. For a finite poset X, we then define dim₂X as the smallest positive integer n such that X can be embedded as a subposet of Q_n. For any poset X we then have log₂ |X| ? dim₂X ? |X|. For the distributive lattice $\text{L =}\text{2}{}^{\mathrm{X}}$, dim₂L = |X| and for the crown S^k_n, dim₂ (S^k_n) = n + k. For each k ? 2, there exist positive constants c₁ and c₂ so that for the poset X consisting of all one element and k-element subsets of an n-element set, the inequality c₁ log₂n < dim₂(X) < c₂ log₂n holds for all n with k < n. A poset is called Q-critical if dim₂ (X ? x) < dim₂(X) for every x ? X. We define a join operation ⊕ on posets under which the collection Q of all Q-critical posets which are not chains forms a semigroup in which unique factorization holds. We then completely determine the subcollection $\text{M}$ ? Q consisting of all posets X for which dim₂ (X) = |X|.     

A note on abundance of certain semigroups of transformations with restricted range

Given a set X and a nonempty Y?X, we denote by T(X,Y) the subsemigroup of the full transformation semigroup on X consisting of all transformations whose range is contained in Y. We show that the semigroup T(X,Y) is right abundant but not left abundant whenever Y is a proper non-singleton subset of X.     

Axioms for function semigroups with agreement quasi-order

The agreement quasi-order on pairs of (partial) transformations on a set X is defined as follows: ${(f, g) \preceq (h, k)}$ if whenever f, g are defined and agree, so do h, k. We axiomatize function semigroups and monoids equipped with this quasi-order, thereby providing a generalisation of first projection quasi-ordered ${\cap}$ -semigroups of functions. As an application, axiomatizations are obtained for groups and inverse semigroups of injective functions equipped with the quasi-order of fix-set inclusion. All axiomatizations are finite.     

The free idempotent generated locally inverse semigroup

In this paper we construct a model for the free idempotent generated locally inverse semigroup on a set X. The elements of this model are special vertex-labeled bipartite trees with a pair of distinguished vertices. To describe this model, we need first to introduce a variation of a model for the free pseudosemilattice on a set X presented in Auinger and Oliveira (On the variety of strict pseudosemilattices. Stud Sci Math Hungarica 50:207–241, 2013). A construction of a graph associated with a regular semigroup was presented in Brittenham et al. (Subgroups of free idempotent generated semigroups need not be free. J Algebra 321:3026–3042, 2009) in order to give a first example of a free regular idempotent generated semigroup on a biordered set E with non-free maximal subgroups. If G is the graph associated with the free pseudosemilattice on X, we shall see that the models we present for the free pseudosemilattice on X and for the free idempotent generated locally inverse semigroup on X are closely related with the graph G.     

Posets admitting a unique order-compatible topology

A characterization is given for those posets (X, ?) such that X admits exactly one topology inducing the given partial order ?. As a corollary, a poset is finite if and only if it is finite-dimensional and admits a unique compatible topology. Related applications and examples are also developed.     

Zero-dimensional proximities and zero-dimensional compactifications

We introduce zero-dimensional proximities and show that the poset 〈Z(X),?〉 of inequivalent zero-dimensional compactifications of a zero-dimensional Hausdorff space X is isomorphic to the poset 〈Π(X),?〉 of zero-dimensional proximities on X that induce the topology on X. This solves a problem posed by Leo Esakia. We also show that 〈Π(X),?〉 is isomorphic to the poset 〈B(X),⊆〉 of Boolean bases of X, and derive Dwinger's theorem that 〈Z(X),?〉 is isomorphic to 〈B(X),⊆〉 as a corollary. As another corollary, we obtain that for a regular extremally disconnected space X, the Stone-?ech compactification of X is a unique up to equivalence extremally disconnected compactification of X.     

Rank and idempotent rank of finite full transformation semigroups with restricted range

Let T(X) be the full transformation semigroup on the set X and let T(X,Y) be the semigroup consisting of all total transformations from X into a fixed nonempty subset Y of X. In 2011, Sanwong studied the regular part $$F(X,Y)=\bigl\{\alpha\in T(X,Y): X\alpha\subseteq Y\alpha\bigr\}, $$ of T(X,Y) and described its Green’s relations and ideals. In this paper, we compute the rank of F(X,Y) when X is a finite set. Moreover, we obtain the rank and idempotent rank of its ideals.     

Centralizers in the Full Transformation Semigroup

For an arbitrary set X (finite or infinite), denote by T(X) the semigroup of full transformations on X. For α∈T(X), let C(α)={β∈T(X):αβ=βα} be the centralizer of α in T(X). The aim of this paper is to characterize the elements of C(α). The characterization is obtained by decomposing α as a join of connected partial transformations on X and analyzing the homomorphisms of the directed graphs representing the connected transformations. The paper closes with a number of open problems and suggestions of future investigations.     

Relatively weakly open subsets of the unit ball in functions spaces

For an infinite Hausdorff compact set K and for any Banach space X we show that every nonempty weak open subset relative to the unit ball of the space of X-valued functions that are continuous when X is equipped with the weak (respectively norm, weak-∗) topology has diameter 2. As consequence, we improve known results about nonexistence of denting points in these spaces. Also we characterize when every nonempty weak open subset relative to the unit ball has diameter 2, for the spaces of Bochner integrable and essentially bounded measurable X-valued functions.     

The arithmetic of distributions in free probability theory

We give an analytical approach to the definition of additive and multiplicative free convolutions which is based on the theory of Nevanlinna and Schur functions. We consider the set of probability distributions as a semigroup M equipped with the operation of free convolution and prove a Khintchine type theorem for the factorization of elements of this semigroup. An element of M contains either indecomposable (“prime”) factors or it belongs to a class, say I ₀, of distributions without indecomposable factors. In contrast to the classical convolution semigroup, in the free additive and multiplicative convolution semigroups the class I ₀ consists of units (i.e. Dirac measures) only. Furthermore we show that the set of indecomposable elements is dense in M.     

A category of quantum posets

We investigate a category of quantum posets that generalizes the category of posets and monotone functions. Up to equivalence, its objects are hereditarily atomic von Neumann algebras equipped with quantum partial orders in Weaver’s sense. We show that this category is complete, cocomplete and symmetric monoidal closed. As a consequence, any discrete quantum family of maps from a discrete quantum space to a partially ordered set is canonically equipped with a quantum preorder. In particular, the quantum power set of a quantum set is canonically a quantum poset. We show that each quantum poset embeds into its quantum power set in complete analogy with the classical case.     

Classification of the factorial functions of Eulerian binomial and Sheffer posets

We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with n!, the factorial function of the infinite Boolean algebra, or ²n−1, the factorial function of the infinite butterfly poset. We also classify the factorial functions for Eulerian Sheffer posets. An Eulerian Sheffer poset with binomial factorial function B(n)=n! has Sheffer factorial function D(n) identical to that of the infinite Boolean algebra, the infinite Boolean algebra with two new coatoms inserted, or the infinite cubical poset. Moreover, we are able to classify the Sheffer factorial functions of Eulerian Sheffer posets with binomial factorial function B(n)=²n−1 as the doubling of an upside-down tree with ranks 1 and 2 modified. When we impose the further condition that a given Eulerian binomial or Eulerian Sheffer poset is a lattice, this forces the poset to be the infinite Boolean algebra BX or the infinite cubical lattice . We also include several poset constructions that have the same factorial functions as the infinite cubical poset, demonstrating that classifying Eulerian Sheffer posets is a difficult problem.     

Irreducible posets with large height exist

The dimension of a poset (X, P) is the minimum number of linear extensions of P whose intersection is P. A poset is irreducible if the removal of any point lowers the dimension. If A is an antichain in X and X ? A ≠ Ø, then dim X ≤ 2 width ((X ? A) + 1. We construct examples to show that this inequality is best possible; these examples prove the existence of irreducible posets of arbitrarily large height. Although many infinite families of irreducible posets are known, no explicity constructed irreducible poset of height larger than four has been found.     

Semigroups generated by nilpotent transformations

In a seminal paper published in 1966, John Howie characterised the elements of _x, the semigroup (under composition) of all total transformations of a set X into itself, which can be written as a product of idempotents in _x. We now initiate the study of the subsemigroup of _x, the semigroup of all partial transformations of X, which is generated by the nilpotents of _x     

On the Möbius function of the locally finite poset associated with a numerical semigroup

Let S be a numerical semigroup and let (?,≤ _S ) be the (locally finite) poset induced by S on the set of integers ? defined by x≤ _S y if and only if y?x∈S for all integers x and y. In this paper, we investigate the Möbius function associated to (?,≤ _S ) when S is an arithmetic semigroup.     

Even continuity and topological equicontinuity in topologized semigroups

A topologized semigroup X having an evenly continuous resp., topologically equicontinuous, family RX of right translations is investigated. It is shown that: (1) every left semitopological semigroup X with an evenly continuous family RX is a topological semigroup, (2) a semitopological group X is a paratopological group if and only if the family RX is evenly continuous and (3) a semitopological group X is a topological group if and only if the family RX is topologically equicontinuous. In particular, we get that for any paratopological group X which is not a topological group, the family RX provides an example of a transitive group of homeomorphisms of X that is evenly continuous and not topologically equicontinuous. The last conclusion answers negatively a question posed by H.L. Royden.     

Approximation of coincidence points and common fixed points of a collection of mappings of metric spaces

On a complete metric space X, we solve the problem of constructing an algorithm (in general, nonunique) of successive approximations from any point in space to a given closed subsetA. We give an estimate of the distance from an arbitrary initial point to the corresponding limit points. We consider three versions of the subset A: (1) A is the complete preimage of a closed subspace H under a mapping from X into the metric space Y; (2) A is the set of coincidence points of n (n > 1) mappings from X into Y; (3) A is the set of common fixed points of n mappings of X into itself (n = 1, 2, …). The problems under consideration are stated conveniently in terms of a multicascade, i.e., of a generalized discrete dynamical system with phase space X, translation semigroup equal to the additive semigroup of nonnegative integers, and the limit set A. In particular, in case (2) for n = 2, we obtain a generalization of Arutyunov’s theorem on the coincidences of two mappings. In case (3) for n = 1, we obtain a generalization of the contraction mapping principle.