Results 21 to 30 of about 2,488 (95)
Monoids with tests and the algebra of possibly non-halting programs [PDF]
, 2014 We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, if-then-else and while-do defined in ...
Jackson, Marcel, Stokes, Tim E.
core +4 more sources
The Finite Basis Problem for Kiselman Monoids [PDF]
, 2015 In an earlier paper, the second-named author has described the identities holding in the so-called Catalan monoids. Here we extend this description to a certain family of Hecke--Kiselman monoids including the Kiselman monoids $\mathcal{K}_n$.
Ashikhmin, D. N. +2 more
core +2 more sources
, 2019 In algebraic terms, the insertion of $n$-powers in words may be modelled at the language level by considering the pseudovariety of ordered monoids defined by the inequality $1\le x^n$.
Almeida, J., Klíma, O.
core +1 more source
Non-commutative Stone duality: inverse semigroups, topological groupoids and C*-algebras [PDF]
, 2012 We study a non-commutative generalization of Stone duality that connects a class of inverse semigroups, called Boolean inverse $\wedge$-semigroups, with a class of topological groupoids, called Hausdorff Boolean groupoids. Much of the paper is given over
Lawson, Mark V
core +1 more source
Tensor products and regularity properties of Cuntz semigroups
, 2014 The Cuntz semigroup of a C*-algebra is an important invariant in the structure and classification theory of C*-algebras. It captures more information than K-theory but is often more delicate to handle.
Antoine, Ramon +2 more
core +1 more source
Invariant means on Boolean inverse monoids [PDF]
, 2015 The classical theory of invariant means, which plays an important role in the theory of paradoxical decompositions, is based upon what are usually termed `pseudogroups'. Such pseudogroups are in fact concrete examples of the Boolean inverse monoids which
Kudryavtseva, Ganna +3 more
core +2 more sources
Reaching the minimum ideal in a finite semigroup [PDF]
, 2015 We introduce the depth parameters of a finite semigroup, which measure how hard it is to produce an element in the minimum ideal when we consider generating sets satisfying some minimality conditions.
Karimi, Nasim
core +2 more sources
Is every product system concrete?
Transactions of the London Mathematical Society, Volume 12, Issue 1, December 2025.Abstract Is every product system of Hilbert spaces over a semigroup P$P$ concrete, that is, isomorphic to the product system of an E0$E_0$‐semigroup over P$P$? The answer is no if P$P$ is discrete, cancellative and does not embed in a group. However, we show that the answer is yes for a reasonable class of semigroups.
S. Sundar
wiley +1 more source
Quivers of monoids with basic algebras
, 2011 We compute the quiver of any monoid that has a basic algebra over an algebraically closed field of characteristic zero. More generally, we reduce the computation of the quiver over a splitting field of a class of monoids that we term rectangular monoids (
Aguiar +27 more
core +1 more source
The biHecke monoid of a finite Coxeter group and its representations [PDF]
, 2012 For any finite Coxeter group W, we introduce two new objects: its cutting poset and its biHecke monoid. The cutting poset, constructed using a generalization of the notion of blocks in permutation matrices, almost forms a lattice on W.
Albert +14 more
core +3 more sources