Related papers: Answering Five Open Problems Involving Semigroup C…
Let $G$ be a connected semi-simple algebraic group of adjoint type over an algebraically closed field, and let $\overline{G}$ be the wonderful compactification of $G$. For a fixed pair $(B, B^-)$ of opposite Borel subgroups of $G$, we look…
The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…
Given a set A of non-negative integers and a set B of positive integers,we are interested in computing all sets C (of positive integers) that are minimal in the family of sets K (of positive integers) such that (i) K contains no elements…
If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…
Motivated by the question of which completely regular semigroups have context-free word problem, we show that for certain classes of languages $\mathfrak{C}$(including context-free), every completely regular semigroup that is a union of…
Quandles are certain algebraic structures showing up in different mathematical contexts. A group $G$ with the conjugation operation forms a quandle, $\operatorname{Conj}(G)$. In the opposite direction, one can construct a group…
Given a group G, the conjugacy problem in G is the problem of giving an effective procedure for determining whether or not two given elements f, g of G are conjugate, i.e. whether there exists h belonging to G with fh = hg. This paper is…
Product systems are the classifying structures for semigroups of endomorphisms of B(H), in that two $E_0$-semigroups are cocycle conjugate iff their product systems are isomorphic. Thus it is important to know that every abstract product…
Let $G$ be a closed highly homogeneous subgroup of $S_{\infty}$ not involving circular orderings. We show that the closure of a conjugacy class from $G$ contains a conjugacy class which is comeagre in it. Furthermore, we show that the…
We study various notions of dependency in semiring team semantics. Semiring teams are essentially database relations, where each tuple is annotated with some element from a positive semiring. We consider semiring generalizations of several…
A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that…
A congruence $\varepsilon$ on a semigroup $S$ is perfect if for any congruence classes $x\varepsilon$ and $y\varepsilon$ their product as subsets of $S$ coincides (as a set) with the congruence class $(xy)\varepsilon$. Perfect congruences…
The study of word hyperbolic groups is a prominent topic in geometric group theory; however word hyperbolic groups are defined by a geometric condition which does not extend naturally to semigroups. We propose a linguistic definition.…
Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…
In this paper we provide an overview of the class of inverse semigroups $S$ such that every congruence on $S$ relates at least one idempotent to a non-idempotent; such inverse semigroups are called $E$-disjunctive. This overview includes…
We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
We consider two algorithmic problems concerning sub-semigroups of Heisenberg groups and, more generally, two-step nilpotent groups. The first problem is Intersection Emptiness, which asks whether a finite number of given finitely generated…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Let $\F$ be an algebraically closed field. Let $\V$ be a vector space equipped with a non-degenerate symmetric or symplectic bilinear form $B$ over $\F$. Suppose the characteristic of $\F$ is \emph{large}, i.e. either zero or greater than…