Results 1 to 10 of about 241 (32)

On a locally compact monoid of cofinite partial isometries of ℕ with adjoined zero

Topological Algebra and its Applications, 2022
Let 𝒞ℕ be a monoid which is generated by the partial shift α : n↦n +1 of the set of positive integers ℕ and its inverse partial shift β : n + 1 ↦n. In this paper we prove that if S is a submonoid of the monoid Iℕ∞ of all partial cofinite isometries of ...
Gutik Oleg, Khylynskyi Pavlo
doaj   +1 more source

A study on strongly convex hyper S-subposets in hyper S-posets

Open Mathematics, 2020
In this paper, we study various strongly convex hyper S-subposets of hyper S-posets in detail. To begin with, we consider the decomposition of hyper S-posets.
Tang Jian, Xie Xiang-Yun, Davvaz Bijan
doaj   +1 more source

Monoids, their boundaries, fractals and C*-algebras

Topological Algebra and its Applications, 2020
In this note we establish some connections between the theory of self-similar fractals in the sense of John E. Hutchinson (cf. [3]), and the theory of boundary quotients of C*-algebras associated to monoids.
dal Verme Giulia, Weigel Thomas
doaj   +1 more source

On generators and presentations of semidirect products in inverse semigroups [PDF]

, 2009
In this paper we prove two main results. The first is a necessary and sufficient condition for a semidirect product of a semilattice by a group to be finitely generated.
Dombi, Erzsebet Rita, Ruskuc, Nik
core   +1 more source

The Structure of a Graph Inverse Semigroup [PDF]

, 2015
Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E).
Mesyan, Zachary, Mitchell, J. D.
core   +3 more sources

Algebras of right ample semigroups

Open Mathematics, 2018
Strict RA semigroups are common generalizations of ample semigroups and inverse semigroups. The aim of this paper is to study algebras of strict RA semigroups.
Guo Junying, Guo Xiaojiang
doaj   +1 more source

The semaphore codes attached to a Turing machine via resets and their various limits [PDF]

, 2016
We introduce semaphore codes associated to a Turing machine via resets. Semaphore codes provide an approximation theory for resets. In this paper we generalize the set-up of our previous paper "Random walks on semaphore codes and delay de Bruijn ...
Rhodes, John, Schilling, Anne, Silva, Pedro V.   +2 more
core   +3 more sources

Combinatorial Markov chains on linear extensions [PDF]

, 2013
We consider generalizations of Schuetzenberger's promotion operator on the set L of linear extensions of a finite poset of size n. This gives rise to a strongly connected graph on L.
A. Björner, A. Björner, A. Karzanov, A.H. Clifford, Anne Schilling, Arvind Ayyer, B. Steinberg, B. Steinberg, C. Berg, C. Malvenuto, C.A. Athanasiadis, D.A. Levin, G. Brightwell, G. Letac, J.-É. Dies, J.A. Fill, J.A. Green, K.S. Brown, K.S. Brown, K.S. Brown, M. Schocker, M.D. Haiman, M.L. Tsetlin, M.P. Schützenberger, P. Bidigare, P. Donnelly, P. Edelman, R. Bubley, R.M. Phatarfod, R.P. Stanley, S. Kapoor, Steven Klee, W.J. Hendricks, W.J. Hendricks   +33 more
core   +2 more sources

On the power pseudovariety $\mathbf{PCS}$ [PDF]

, 2012
Some new semantic and syntactic characterizations of the members of the power pseudovariety $\mathbf{PCS}$ are obtained. This leads in particular to new algorithms for deciding membership in $\mathbf{PCS}$
Auinger, K.
core   +4 more sources

An investigation on hyper S-posets over ordered semihypergroups

Open Mathematics, 2017
In this paper, we define and study the hyper S-posets over an ordered semihypergroup in detail. We introduce the hyper version of a pseudoorder in a hyper S-poset, and give some related properties.
Tang Jian, Davvaz Bijan, Xie Xiang-Yun
doaj   +1 more source