Related papers: Free idempotent generated semigroups: The word pro…
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…
We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…
Let $n$ be any positive integer and $\mathscr{I\!\!P\!F}(\mathbb{N}^n)$ be the semigroup of all order isomorphisms between principal filters of the $n$-th power of the set of positive integers $\mathbb{N}$ with the product order. We study…
The submonoid membership problem for a finitely generated group $G$ is the decision problem, where for a given finitely generated submonoid $M$ of $G$ and a group element $g$ it is asked whether $g \in M$. In this paper, we prove that for a…
Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…
In this paper we continue the investigations on the algebraic structure of a finite semigroup $S$ that is determined by its associated upper non-nilpotent graph $\mathcal{N}_{S}$. The vertices of this graph are the elements of $S$ and two…
As a generalization of the free semigroup algebras considered by Davidson and Pitts, and others, the second author and D.W. Kribs initiated a study of reflexive algebras associated with directed graphs. A free semigroupoid algebra L_G is…
We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…
In this paper, we extend recent results about the distribution of even and odd gaps of a numerical semigroup. We find that, for any numerical semigroup, the distribution can be computed in terms of the numbers of or the sums of odd and even…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…
A free semigroupoid algebra is the closure of the algebra generated by a TCK family of a graph in the weak operator topology. We obtain a structure theory for these algebras analogous to that of free semigroup algebra. We clarify the role…
The notion of automatic selfadjointness of all ideals in a multiplicative semigroup of the bounded linear operators on a separable Hilbert space B(H) arose in a 2015 discussion with Heydar Radjavi who pointed out that B(H) and the finite…
In this work, we explore the following question: If two words in a finitely generated free group have identical images as word maps on every finite group, must they be endomorphic to each other? In this regard, we introduce weak profinite…
We give an explicit and character-free construction of a complete set of orthogonal primitive idempotents of a rational group algebra of a finite nilpotent group and a full description of the Wedderburn decomposition of such algebras. An…
We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…
The complex algebra of an inverse semigroup with finitely many idempotents in each $\mathcal D$-class is stably finite by a result of Munn. This can be proved fairly easily using $C^*$-algebras for inverse semigroups satisfying this…
We investigate partial Equality and Word Problems for finitely generated groups. After introducing Upper Banach (UB) density on free groups, we prove that solvability of the Equality Problem on squares of UB-generic sets implies solvability…
The purpose of this paper is to extend some useful results, such as the multiplication being open, previously known for suitable finitely generated relatively free profinite semigroups, to relatively free profinite semigroupoids over…