Related papers: On generic properties of finitely presented monoid…

In this paper we study a group G which is the quotient of a free product of groups by the normal closure of a word that is contained in a in a subgroup which has the form of a generalised triangle group. We use known properties of…

Let $G$ be a generalized Baumslag-Solitar group and $\mathcal{C}$ be a class of groups containing at least one non-unit group and closed under taking subgroups, extensions, and Cartesian products of the form $\prod_{y \in Y}X_{y}$, where…

We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…

If $\mathbb{F}$ is an ordered field and $M$ is a finite-rank torsion-free monoid, then one can embed $M$ into a finite-dimensional vector space over $\mathbb{F}$ via the inclusion $M \hookrightarrow \text{gp}(M) \hookrightarrow \mathbb{F}…

Let $\Bbbk$ be an arbitrary field and let $b > 1, n > 1$ and $a$ be three positive integers. In this paper we explicitly describe a minimal $S-$graded free resolution of the semigroup algebra $\Bbbk[S]$ when $S$ is a generalized repunit…

Suppose $G$ is a compact semisimple Lie group, $\mu$ is the normalized Haar measure on $G$, and $A, A^2 \subseteq G$ are measurable. We show that $$\mu(A^2)\geq \min\{1, 2\mu(A)+\eta\mu(A)(1-2\mu(A))\}$$ with the absolute constant $\eta>0$…

We show that a certain geometric property, the QSF introduced by S. Brick and M. Mihalik, is universally true for {\ibf all} finitely presented groups $\Gamma$. One way of defining this property is the existence of a smooth compact manifold…

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…

Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V)…

In the paper we study algebraic properties of the monoid $\mathbf{I}\mathbb{N}_{\infty}^{\boldsymbol{g}[j]}$ of cofinite partial isometries of the set of positive integers $\mathbb{N}$ with the bounded finite noise $j$. For the monoids…

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the ``order formula'' of D. Testerman…

We show that for any positive integer $m\ge 1$, $m$-relator quotients of the modular group $M = PSL(2,\mathbb{Z})$ generically satisfy a very strong Mostow-type \emph{isomorphism rigidity}. We also prove that such quotients are generically…

We introduce and study the bounded word problem and the precise word problem for groups given by means of generators and defining relations. For example, for every finitely presented group, the bounded word problem is in NP, i.e., it can be…

Let $G$ be a connected reductive group over a perfect field $k$. We study a certain normal reductive monoid $\overline M$ associated to a parabolic $k$-subgroup $P$ of $G$. The group of units of $\overline M$ is the Levi factor $M$ of $P$.…

In the paper we give a survey of rather new notions and results which generalize classical ones in the theory of braids. Among such notions are various inverse monoids of partial braids. We also observe presentations different from standard…

Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…

In this paper, we describe an algorithm for computing the left, right, or 2-sided congruences of a finitely presented semigroup or monoid with finitely many classes, and an alternative algorithm when the finitely presented semigroup or…

It is shown that there exist finitely generated infinite simple groups of infinite commutator width and infinite square width on which there exists no stably unbounded conjugation-invariant norm, and in particular stable commutator length…

Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category $\mathcal D$. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the…