相关论文: A monoid version of the Brin-Higman-Thompson group…

We study a class of generalisations of Thompson's group $V$ arising naturally as topological full groups of purely infinite, minimal groupoids. In the process, we show that the derived subgroup of such a group is 2-generated whenever it is…

We prove that monoids $\mathrm{Mon}\langle a,b,c,d : a^nb=0, ac=1, db=1, dc=1, dab=1, da^2b=1, \ldots, da^{n-1}b=1\rangle$ are congruence-free for all $n\geq 1$. This provides a new countable family of finitely presented congruence-free…

In this paper we study complex representations of the factorpower $\fp(G,M)$ of a finite group $G$ acting on a finite set $M$. This includes the finite monoid $\FP$, which can be seen as a kind of a ``balanced'' generalization of the…

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

We consider the symplectic groupoid of pairs $(B,\mathbb{A})$ with $\mathbb A$ unipotent upper-triangular matrices and $B\in GL_n$ being such that $\widetilde {\mathbb A}=B{\mathbb A} B^{\text{T}}$ are also unipotent upper-triangular…

We compute the higher $\Sigma$-invariants $\Sigma^m(F_{n,\infty})$ of the generalized Thompson groups $F_{n,\infty}$, for all $m,n\ge 2$. This extends the $n=2$ case done by Bieri, Geoghegan and Kochloukova, and the $m=2$ case done by…

For a natural number $n$, denote by $B_n$ the braid group on $n$ strings and by $SM_n$ the singular braid monoid on $n$ strings. $SM_n$ is one of the most important extensions of $B_n$. In [13], Y. Mikhalchishina classified all homogeneous…

Building on the work of Gabriel Conant, we investigate the enumeration problems of finite distance monoids by applying the decomposition of Archimedean classes and studying their internal arithmetic progressions. Specifically, we first…

The Burnside Problem asks whether a finitely generated group of exponent n is finite. We present a solution for 2-generator groups of prime power exponent. Results of P. Hall and G. Higman extends the finiteness conclusion to groups having…

Recently, Gray and Ruskuc (arXiv:1101.1833) proved that if e is a rank k idempotent transformation of the set {1,...,n} to itself and k<=n-2, then the maximal subgroup of the free idempotent generated semigroup over the full transformation…

We generalize free monoids by defining $k$-monoids. These are nothing other than the one-vertex higher-rank graphs used in $C^{\ast}$-algebra theory with the cardinality requirement waived. The $1$-monoids are precisely the free monoids. We…

We present a general method for proving that a semigroup is non-finitely based. The method is strong enough to cover the non-finite basis arguments in articles [1,3,4,5,7,8, 11,14,16,21,27,31,36,37]. In particular, the method allows to…

We study conjugacy relations on semigroups and monoids, focusing on the relation $a \cfn b$, defined by the existence of $g,h \in S^1$ such that $ag = gb$, $bh = ha$, $hag = b$, and $gbh = a$. This notion emerged as one that yields…

We give an alternative description of the grammic monoid in terms of weakly increasing subsequences. Specifically, we show that words $u,v$ in the generators $\{1,\ldots, n\}$ determine the same element of the grammic monoid of rank $n$ if…

We consider the Thompson-Stein group F(n_1,...,n_k) for integers n_1,...,n_k and k greater than 1. We highlight several differences between the cases k=1$ and k>1, including the fact that minimal tree-pair diagram representatives of…

Let $G$ be a group, and let $S$ be a finite subset of $G$ that generates $G$ as a monoid. The co-word problem is the collection of words in the free monoid $S^{\ast}$ that represent non-trivial elements of $G$. A current conjecture, based…

A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…

We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…

We develop general techniques for computing the fundamental group of the configuration space of $n$ identical particles, possessing a generic internal structure, moving on a manifold $M$. This group generalizes the $n$-string braid group of…