Related papers: On the Complexity of Properties of Partial Bijecti…
We consider the complexity of deciding membership of a given finite semigroup to a fixed pseudovariety. While it is known that there exist pseudovarieties with NP-complete or even undecidable membership problems, for many well-known…
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an…
In representation theory of finite-dimensional algebras, (semi)bricks are a generalization of (semi)simple modules, and they have long been studied. The aim of this paper is to study semibricks from the point of view of $\tau$-tilting…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
The 5-element Brandt semigroup $B_2$ admits the structure of a naturally semilattice-ordered inverse semigroup, thus becoming an additively idempotent semiring with the operation of taking greatest lower bounds as the semiring addition. For…
For any graph inverse semigroup $G(E)$ we describe subsemigroups $D^0=D\cup\{0\}$ and $J^0=J\cup\{0\}$ of $G(E)$ where $D$ and $J$ are arbitrary $\mathcal{D}$-class and $\mathcal{J}$-class of $G(E)$, respectively. In particular, we prove…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…
Paterson showed how to construct an etale groupoid from an inverse semigroup using ideas from functional analysis. This construction was later simplified by Lenz. We show that Lenz's construction can itself be further simplified by using…
This paper is devoted to the study of semigroups of composition operators and semigroups of holomorphic mappings. We establish conditions under which these semigroups can be extended in their parameter to sector given a priori. We show that…
For every group $G$, the set $\mathcal{P}(G)$ of its subsets forms a semiring under set-theoretical union $\cup$ and element-wise multiplication $\cdot$ and forms an involution semigroup under $\cdot$ and element-wise inversion ${}^{-1}$.…
We describe the structure of 0-simple countably compact topological inverse semigroups and the structure of congruence-free countably compact topological inverse semigroups.
Let $Q$ be an inverse semigroup. A subsemigroup $S$ of $Q$ is a left I-order in $Q$ and $Q$ is a semigroup of left I-quotients of $S$ if every element in $Q$ can be written as $a^{-1}b$, where $a, b \in S$ and $a^{-1}$ is the inverse of $a$…
In order to investigate the relationship between weak amenability and the Haagerup property for groups, we introduce the weak Haagerup property, and we prove that having this approximation property is equivalent to the existence of a…
A smallest generating set of a semigroup is a generating set of the smallest cardinality. Similarly, an irredundant generating set $X$ is a generating set such that no proper subset of $X$ is also a generating set. A semigroup $S$ is…
For a sequence of uniformly bounded, degenerate semigroups on a Hilbert space, we compare various types of convergences to a limit semigroup. Among others, we show that convergence of the semigroups, or of the resolvents of the generators,…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
We give a new definition of the semigroup C*-algebra of a left cancellative semigroup, which resolves problems of the construction by X. Li. Namely, the new construction is functorial, and the independence of ideals in the semigroup does…
We describe a special class of representations of an inverse semigroup S on Hilbert's space which we term "tight". These representations are supported on a subset of the spectrum of the idempotent semilattice of S, called the "tight…
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…