Related papers: Finitely presented monoids with linear Dehn functi…
We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…
We construct the first examples of finitely presented groups with cubic Dehn function containing a finitely generated infinite torsion subgroup. Moreover, we show that any infinite free Burnside group with sufficiently large odd exponent…
We provide every Renner monoids with a monoid presentation, and we introduce a length function which extends the Coxeter length function.
We generalize one part of Thurston's hyperbolic Dehn filling theorem to arbitrary-rank semisimple Lie groups by showing that certain deformations of extended geometrically finite subgroups of a semisimple Lie group are still extended…
We show the connection between the relative Dehn function of a finitely generated metabelian group and the distortion function of a corresponding subgroup in the wreath product of two free abelian groups of finite rank. Further, we show…
We prove that all linear Lie groups satisfying the conditions listed in the title are finite extensions of commutative Lie groups.
We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is…
In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…
The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision procedures of equational theories, based upon the principle of…
The purpose of this paper is to introduce the theory of presentations of monoids acts. We aim to construct `nice' general presentations for various act constructions pertaining to subacts and Rees quotients. More precisely, given an $M$-act…
We show how topological methods developed in a previous article can be applied to prove new results about topological and homological finiteness properties of monoids. A monoid presentation is called special if the right-hand side of each…
We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
In this paper we presents further developments regarding the enrichment of the basic Theory of Order Completion. In particular, spaces of generalized functions are constructed that contain generalized solutions to all systems of continuous,…
We show that every finitely generated conical refinement monoid can be represented as the monoid $\mathcal V(R)$ of isomorphism classes of finitely generated projective modules over a von Neumann regular ring $R$. To this end, we use the…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
For a finitely generated group $G$ and collection of subgroups $\mathcal{P}$ we prove that the relative Dehn function of a pair $(G,\mathcal{P})$ is invariant under quasi-isometry of pairs. Along the way we show quasi-isometries of pairs…